A fast quantum circuit for addition with few qubits

Quantum Information and Computation

Volumn 8, Issue 6-7, 2008, Pages 636-649

  Takahashi, Yasuhiro ^a,b   Kunihiro, Noboru ^b  

^a Nippon Telegraph and Telephone Corporation   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Addition; Ancillary qubits; Quantum circuits; Shor's factoring algorithm

Indexed keywords

QUANTUM COMPUTERS; QUANTUM OPTICS;

ADDITION; ANCILLARY QUBIT; BINARY NUMBER; CARRY LOOKAHEAD ADDER; QUANTUM CIRCUIT; SHOR'S FACTORING ALGORITHM;

TIMING CIRCUITS;

EID: 65649107251     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic8.6-7-5     Document Type: Article

References (13)

1. P. W. Shor (1994), Algorithms for quantum computation: discrete logarithms and factoring,Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 124-134.
2. V. Vedral, A. Barenco, and A. Ekert (1996), Quantum networks for elementary arithmetic operations, Physical Review A, Vol.54 No. 1, pp. 147-153. (Pubitemid 126583488)
3. S. Beauregard (2003), Circuit for Shor's algorithm using 2n + 3 qubits, Quantum Information and Computation, Vol.3 No. 2, pp. 175-185. (Pubitemid 37177534)
4. T. G. Draper (2000), Addition on a quantum computer, quant-ph/0008033.
5. P. Kaye (2004), Reversible addition circuit using one ancillary bit with application to quantum computing, quant-ph/0408173.
6. S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton (2005), A new quantum ripple-carry addition circuit, The Eighth Workshop on Quantum Information Processing. Also on quant-ph/0410184.
7. Y. Takahashi and N. Kunihiro (2005), A linear-size quantum circuit for addition with no ancillary qubits, Quantum Information and Computation, Vol.5 No. 6, pp. 440-448. (Pubitemid 41125854)
8. T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore (2006), A logarithmic-depth quantum carry-lookahead adder, Quantum Information and Computation, Vol.6 No. 4&5, pp. 351-369.
9. M. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang (2006), Quantum lower bounds for fanout, Quantum Information and Computation, Vol.6 No. 1, pp. 46-57.
10. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information,Cambridge University Press.
11. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter (1995), Elementary gates for quantum computation,PhysicalReview A, Vol.52 No. 5, pp. 3457-3467.
12. S. A. Kutin (2006), Shor's algorithm on a nearest-neighbor machine, quant-ph/0609001.
13. C. Zalka (2006), Shor's algorithm with fewer (pure) qubits, quant-ph/0601097.