Reducing quantum computations to elementary unitary operations

Computing in Science and Engineering

Volumn 3, Issue 2, 2001, Pages 27-32

  Cybenko, George ^a,b  

^a DARTMOUTH COLLEGE   (United States)

^b IEEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141689114     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.908999     Document Type: Article

References (7)

1. C.P. Williams and S.H. Clearwater, Explorations in Quantum Computing, Springer-Verlag, New York, 1998.
2. P.M.B. Vitanyi, "Physics and the New Computation," Proc. 20th Int'l Symp./Mathematical Foundations of Computer Science, MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer-Verlag, Heidelberg, Germany, 1995, pp. 106-128.
3. R.H. Katz, Contemporary Logic Design, Addison-Wesley, Reading, Mass., 1993.
4. A. Barenco et al., "Elementary Gates for Quantum Computation," Physical Rev. A, vol. 52, 1995, pp. 3457-3467.
5. D. Deutsch, A. Barenco, and A. Ekert, "Universality in Quantum Computation," Proc. Royal Soc. of London A, vol. 449, 1995, pp. 669-677.
6. A. Peres, "Reversible Logic and Quantum Computers," Physical Rev. A, vol. 32, no. 6, 1985, pp. 3266-3276.
7. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins Press, Baltimore, 1996.