Quantum computation and quantum information
Quantum computation and quantum information
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Circuit for Shor's algorithm using 2n+3 qubits
Quantum Information & Computation
Arithmetic on a distributed-memory quantum multicomputer
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Quantum addition circuits and unbounded fan-out
Quantum Information & Computation
A quantum circuit for shor's factoring algorithm using 2n + 2 qubits
Quantum Information & Computation
A fast quantum circuit for addition with few qubits
Quantum Information & Computation
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Design of efficient reversible logic-based binary and BCD adder circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information & Computation
| Hi-index | 0.00 |
We construct a quantum circuit for addition of two n-bit binary numbers that uses no ancillary qubits. The circuit is based on the ripple-carry approach. The depth and size of the circuit are O(n). This is an affirmative answer to the question of Kutin [1] as to whether a linear-depth quantum circuit for addition can be constructed without ancillary qubits using the ripple-carry approach. We also construct quantum circuits for addition modulo 2n, subtraction, and comparison that use no ancillary qubits by modifying the circuit for addition.