Quantum addition circuits and unbounded fan-out

Quantum Information and Computation

Volumn 10, Issue 9-10, 2010, Pages 872-890

  Takahashi, Yasuhiro ^a   Tani, Seiichiro ^a,b   Kunihiro, Noboru ^c  

^a Nippon Telegraph and Telephone Corporation   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Addition; Quantum circuits; Shor's discrete logarithm algorithm; Unbounded fan out

Indexed keywords

ADDERS; QUBITS; TIMING CIRCUITS;

ADDITION; BINARY NUMBER; DISCRETE LOGARITHMS; FAN OUT; POSITIVE CONSTANT; QUANTUM CIRCUIT;

QUANTUM EFFICIENCY;

EID: 78649466529     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. P. W. Shor (1994), Algorithms for quantum computation: discrete logarithms and factoring, In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 124-134.
2. V. Vedral, A. Barenco, and A. Ekert (1996), Quantum networks for elementary arithmetic operations, Phys. Rev. A, 54(1):147-153.
3. C. Zalka (1998), Fast versions of Shor's quantum factoring algorithm, quant-ph/9806084.
4. S. Beauregard (2003), Circuit for Shor's algorithm using 2n+3 qubits, Quantum Information and Computation, 3(2):175-185.
5. J. Proos and C. Zalka (2003), Shor's discrete logarithm quantum algorithm for elliptic curves, Quantum Information and Computation, 3(4):317-344.
6. A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg (2004), Implementation of Shor's algorithm on a linear nearest neighbour qubit array, Quantum Information and Computation, 4(4):237-251.
7. Y. Takahashi and N. Kunihiro (2006), A quantum circuit for Shor's factoring algorithm using 2n + 2 qubits, Quantum Information and Computation, 6(2):184-192.
8. F. Green, S. Homer, C. Moore, and C. Pollett (2002), Counting, fanout, and the complexity of quantum ACC, Quantum Information and Computation, 2(1):35-65.
9. P. Høyer and R. Špalek (2005), Quantum fan-out is powerful, Theory of Computing, 1(5):81-103.
10. J. I. Cirac and P. Zoller (1995), Quantum computations with cold trapped ions, Phys. Rev. Lett., 74(20):4091-4094.
11. K. Mølmer and A. Sørenson (1999), Multiparticle entanglement of hot trapped ions, Phys. Rev. Lett., 82(9):1835-1838.
12. X. Wang, A. Sørenson, and K. Mølmer (2001), Multibit gates for quantum computing, Phys. Rev. Lett., 86(17):3907-3910.
13. S. A. Fenner (2003), Implementing the fanout gate by a Hamiltonian, quant-ph/0309163.
14. S. A. Fenner and Y. Zhang (2004), Implementing fanout, parity, and Mod gates via spin exchange interactions, quant-ph/0407125.
15. T. G. Draper (2000), Addition on a quantum computer, quant-ph/0008033.
16. Y. Takahashi and N. Kunihiro (2005), A linear-size quantum circuit for addition with no ancillary qubits, Quantum Information and Computation, 5(6):440-448.
17. 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, 6(4&5):351-369.
18. Y. Takahashi and N. Kunihiro (2008), A fast quantum circuit for addition with few qubits, Quantum Information and Computation, 8(6&7):636-649.
19. A. K. Chandra, S. Fortune, and R. Lipton (1983), Unbounded fan-in circuits and associative functions, In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 52-60.
20. M. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang (2006), Quantum lower bounds for fanout, Quantum Information and Computation, 6(1):46-57.
21. N. Pippenger (1987), The complexity of computations by networks, IBM Journal of Research and Development, 31(2):235-243.
22. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information, Cam- bridge University Press.
23. 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.
24. 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, Phys. Rev. A, 52(5):3457-3467.
25. D. Hankerson, A. Menezes, and S. Vanstone (2003), Guide to Elliptic Curve Cryptography, Springer.
26. D. Dolev, C. Dwork, N. Pippenger, and A. Wigderson (1983), Superconcentrators, generalizers and generalized connectors with limited depth, In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 42-51.