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
A linear-size quantum circuit for addition with no ancillary qubits
Quantum Information & Computation
Quantum lower bounds for fanout
Quantum Information & Computation
A logarithmic-depth quantum carry-lookahead adder
Quantum Information & Computation
Quantum addition circuits and unbounded fan-out
Quantum Information & Computation
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We show how to construct a fast quantum circuit for computing the sum of two n-bit binary numbers with few qubits. The constructed circuit uses O(n/ log n) ancillary qubits and its depth and size are O(log n) and O(n), respectively. The number of ancillary qubits is asymptotically less than that in Draper et al.'s quantum carry-lookahead adder, and the depth and size are asymptotically the same as those of Draper et al.'s. Moreover, we show that the circuit is useful for constructing an efficient quantum circuit for Shor's factoring algorithm.