Synthesis of quantum-logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 25, Issue 6, 2006, Pages 1000-1010

  Shende, Vivek V ^b,c,f   Bullock, Stephen S ^d,e   Markov, Igor L ^a,c,g,h  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

^d NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

^e INSTITUTE FOR DEFENSE ANALYSES   (United States)

^f Quantum Computing Group   (United States)

^g ASSOCIATION FOR COMPUTING MACHINERY   (United States)

^h AMERICAN MATHEMATICAL SOCIETY   (United States)

Author keywords

Application specific integrated circuits; Circuit analysis; Circuit optimization; Circuit synthesis; Circuit topology; Design automation; Logic design; Matrix decompositions; Quantum effect semiconductor devices; Quantum theory

Indexed keywords

DESIGN AUTOMATION; QUANTUM COMPUTATION; QUANTUM CONTROLLED-NOTS; QUANTUM REGISTERS;

ALGORITHMS; ASYMPTOTIC STABILITY; AUTOMATION; COMPUTER AIDED DESIGN; MULTIPLEXING EQUIPMENT; QUANTUM THEORY;

LOGIC CIRCUITS;

EID: 33646742753     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.855930     Document Type: Article

References (38)

1. The ARDA Roadmap for Quannim Information Science and Technology. [Online]. Available: http://qist.lanl.gov/qcomp\_map.shtml
2. A. Aho and K, Svore. "The design and optimization of quantum circuits using the Palindrome Transform." in Proc. ERATO Conf. Quantum Inf. Sci., Kyoto, Japan. Sept. 5-7, 2003. LANL ArXiv: quant-ph/0311008. [Online]. Available: http://www1.cs.columbia.edu-kmsvore/research.htm
3. A. Barenco, C. Bennett. R. Cleve. D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, "Elementary gates for quantum computation," Phyx. Rev. A, At. Mol, Opt. Phy., vol. 52. no. 5. pp. 3457-3467, Nov. 1995.
4. C. H. Bennett and G. Brassard, "Quantum cryptography: Public-key distribution and coin tossing." in Pmc. IEEE Int. Conf. Computers, Systems, and Signal Processing. Bangalore, India. 1984, pp. 175-179.
5. G. K. Brennen, D. Song, and C. J. Williams, "Quantum-computer architecture using nonlocal interactions." Phyx. Rev. A, Al. Mol. Opt. Phy. (R). vol. 67. no. 5, p. 050302. May 2003.
6. S. S. Bullock, "Note on the Khaneja Glaser decomposition," Quantum Inf. Comput.. vol. 4. no. 5, pp. 396-100, Mar. 2004.
7. S. S. Bullock and I. L. Markov, "An elementary two-qubit quantum computation in twenty-three elementary gates," in Proc. 40th ACM/IEEE Design Automation Conf., Anaheim. CA, Jun, 2003. pp. 324-329.
8. _. "An elementary two-qubit quantum computation in twenty-three elementary gates." Phys. Rev. A, At. Mol. Opt. Phy., vol. 68. p. 012318, 2003.
9. _. "Smaller circuits for arbitrary n-qubit diagonal computations," Quantum Inf. Comput., vol. 4, no. 1, pp. 27-47. 2004.
10. G. Cybenko. "Reducing quantum computations to elementary unitary operations." Cmnput. Sci. Eng., vol. 3. no. 2, pp. 27-32. Mar./Apr. 2001.
11. D. Deutsch. "Quantum computational networks." Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 425. no. 1868, pp. 73-90. 1989.
12. D. Deutsch. A. Barenco. and A. Ekert. "Universality in quantum computation," Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 449, no. 1937, pp. 669-677. 1995.
13. D. P. DiVincenzo, "Two-bit gates are universal for quantum computation," Phys. Rev. A, At. Mol. Opt. Phy.. vol. 51. no. 2, pp. 1015-1022. Feb. 1995.
14. R. P. Feynman, "Quantum mechanical computers." Found. Phys., vol. 16. no. 6, pp. 507-531, 1986.
15. A. G. Fowler, S. J. Devitt. and L. C. L. Hollenberg. "Implementation of Shor's algorithm on a linear nearest neighbour qubit array," Quantum Inf. Comput., vol. 4, no. 4. p. 237, 2004.
16. G. H. Golub and C. van Loan. Matrix Computations. Baltimore. MD: The Johns Hopkins Univ. Press. 1989.
17. L. K. Graver, "Quantum mechanics helps with searching for a needle in a haystack." Phys. Rev. Lett., vol. 79. no. 2. pp. 325-328, Jul. 1997.
18. W. N. N. Hung. X. Song, G. Yang. J. Yang, and M. Perkowski, "Quantum logic synthesis by symbolic reachability analysis," in Proc. 41st Design Automation Conf., San Diego, CA, Jun. 2004. pp. 838-841.
19. K. Iwama, Y Kambayashi, and S. Yamashita, "Transformation rales for designing CNOT-based quantum circuits," in Proc. 39th Design Automation Conf., New Orleans. LA. 2002, pp. 419-124.
20. R. Jozsa and N. Linden, "On the Role of Entanglement in Quantum-Computational Speed-Up," Proc. R. Soc. A, vol. 459, no. 2036, pp. 2011-2032, 2003.
21. E. Knill. "Approximation by quantum circuits," Los Alamos National Laboratory, Los Alamos, NM, LANL Rep. LAUR-95-2225, 1995.
22. M. Möttönen. J. J. Vartiainen. V. Bergholm, and M. M. Salomaa, "Quantum circuits for general multiqubit gates." Phys. Rev. Lett., vol. 93, no. 13, p. 130502, Sep. 2004.
23. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge, U.K.: Cambridge Univ. Press, 2000.
24. M. Oskin, F. T. Chong, I. Chuang. and J. Kubiatowicz, "Building quantum wires: The long and the short of it." in Proc. 30th Annu. ISCA. San Diego. CA, Jun. 2003, pp. 374-385.
25. C. C. Paige and M. Wei, "History and generality of the CS decomposition." Linear Algebra Appl., vol. 208. pp. 303-326, 1994.
26. V. V. Shende. S. S. Bullock, and I. L. Markov, "Recognizing small-circuit structure in two-qubit operators." Phys. Rev. A, At. Mol. Opt. Phy.. vol. 70, no. 1. p. 012310. 2004.
27. V. V. Shende and I. L. Markov, "Quantum circuits for incompletely specified two-qubit operators," Quantum Inf. Comput., vol. 5. no. 1, pp. 49-58, 2005.
28. V. V. Shende. I. L. Markov, and S. S. Bullock, "Smaller two-qubit circuits for quantum communication and computation." in Proc. Design, Automation, and Test Eur., Paris. France, Feb. 2004, pp. 980-985.
29. _, "Minimal universal two-qubit controlled-not based circuits." Phys. Rev. A, At. Mol Opt. Phy., vol. 69, pp. 062321-062329. 2004.
30. V. V. Shende, A. K. Prasad. I. L. Markov, and J. P. Haves, "Synthesis of reversible logic circuits," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.. vol. 22. no. 6. pp. 710-722, Jun. 2003.
31. P. Shor. "Polynomial-time algorithms for prime factorization and discrete logarithm on a quantum computer." SIAM J. Comput., vol. 26, no. 5. pp. 1484-1509. Oct. 1997.
32. R. R. Tucci, A Rudimentary Quantum Compiler. [Online], Available: http://www.arxiv.org/abs/quant-ph/9805015
33. J. J. Vartiainen. M. Möttönen. and M. M. Salomaa. "Efficient decomposition of quantum gates." Phys. Rev. Lett., vol. 92. no. 17. p. 177902. Apr. 2004.
34. F. Vatan and C. Williams, Realization of a General Three-Qubit Quantum Gate, [Online]. Available: http://www.arxiv.org/abs/quant-ph/ 0401178
35. _, "Optimal quantum circuits for general two-qubit gates," Phys. Rev. A, At. Mol. Opt. Phy., vol. 69. no. 3. p. 032315. 2004.
36. G. Vidal and C. M. Dawson. "A universal quantum circuit for two-qubit transformations with three CNOT gates." Phys. Rev. A, At. Mol. Opt. Phy., vol. 69, no. 1, p. 010301, Jan. 2004.
37. J. Zhang, J. Vala, S. Sastry, and K. B. Whaley. "Exact two-qubit universal quantum circuit." Phys. Rev. Lett., vol. 91. no. 2, p. 027903, Jul. 2003.
38. V. V. Zhirnov, R. K. Cavin, J. A. Hutchby, and G. I. Bourianoff, "Limits to binary logic switch scaling-A gedanken model," Proc. IEEE, vol. 91, no. 11, pp. 1934-1939, Nov. 2003.