scholar.google.com › citations
Dec 11, 2015 � We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of�...
We present efficient circuits for ternary reversible and quantum arithmetics. ... 864 Improved quantum ternary arithmetic use ancillary qudits fairly�...
Aug 22, 2024 � We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of�...
Jul 1, 2016 � We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of�...
Dec 11, 2015 � We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of�...
Oct 17, 2019 � Alex Bocharov, Shawn X. Cui, Martin Roetteler , Krysta M. Svore: Improved Quantum Ternary Arithmetics. CoRR abs/1512.03824 (2015).
Title: Improved Quantum Ternary Arithmetics. Authors: Alex Bocharov, Shawn X ... Title: Quantum binary field inversion: improved circuit depth via choice of basis�...
Oct 9, 2023 � In this paper, we propose a quantum–classical comparator based on the quantum Fourier transform. Then we extend it to compare two quantum integers and modular�...
Abstract: Multiple-valued logic is a promising choice for future computer technologies, which provides a set of advantages comparing to binary circuits.
Missing: Improved | Show results with:Improved
This paper, for the first time, considers balanced ternary advantages to achieve a more efficient design for quantum multipliers as the main component in�...