Quantum computability

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1524-1540

  Adleman, Leonard M ^a   Demarrais, Jonathan ^a   Huang, Ming Deh A ^a  

^a University of Southern California ^*  (United States)

Author keywords

Quantum complexity classes; Quantum Turing machines

Indexed keywords

EID: 5544263287     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795293639     Document Type: Article

References (16)

1. A. BAKER, Transcendental Number Theory, Cambridge University Press, London, 1979.
2. C. H. BENNETT, Logical reversibility of computation, IBM J. Res. Develop., 17 (1973), pp. 525-532.
3. C. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26(1997), pp. 1510-1523.
4. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, in Proc. 25th ACM Symposium on Theory of Computation, San Diego, CA, 1993, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
5. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, in Proc. 25th ACM Symposium on Theory of Computation, San Diego, CA, 1993, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
6. D. DEUTSCH, Quantum, theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 96-117.
7. D. DEUTSCH, Quantum computational networks, Proc. Roy. Soc. London Ser. A., 425 (1989), pp. 73-90.
8. D. DEUTSCH AND R. JOUZSA, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439 (1992), pp. 553-558.
9. R. FEYNMAN, Simulating physics with computers, Internat. J. Theoret. Phys., 21 (1982), pp. 467-488.
10. N. I. FELDMAN, An improvement of the estimate of a linear form in the logarithms of algebraic numbers, Mat. Sb. (N.S.), 77 (119) (1968), pp. 423-436 (in Russian).
11. N. JACOBSON, Basic Algebra I, W. H. Freeman, San Francisco, 1980.
12. I. NIVEN, irrational Numbers, The Mathematics Association of America, Rahway, NJ, 1956.
13. P. SHOR, Algorithms for quantum computation: Discrete log and factoring, in Proc. 35th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 124-134.
14. D. SIMON, On the power of quantum computation, SIAM J. Comput., 26 (1997), pp. 1474-1483.
15. R. SOLOVAY, Virtual Reading Group Communication, Internet, 14 August 1994.
16. [Y] A. YAO, Quantum circuit complexity, in Proc. 34th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 352-361.