NQPℂ = co-C=P

Information Processing Letters

Volumn 71, Issue 2, 1999, Pages 63-69

  Yamakami, Tomoyuki ^a   Yao, Andrew C ^a  

^a Princeton University   (United States)

Author keywords

Computational complexity; Theory of computation

Indexed keywords

EID: 33644825593     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00084-8     Document Type: Article

References (23)

1. L.M. Adleman, J. DeMarrais, M.A. Huang, Quantum computability, SIAM J. Comput. 26 (1997) 1524-1540.
2. D. Aharonov, Quantum computation, in: D. Stauffer (Ed.), Annual Reviews of Computational Physics VI, World Scientific, Singapore, 1998.
3. C.H. Bennett, Logical reversibility of computation, IBM J. Res. Develop. 17 (1973) 525-532.
4. E. Bernstein, U. Vazirani, Quantum complexity theory, SIAM J. Comput. 26 (1997) 1411-1473.
5. A. Berthiaume, Quantum computation, in: L.A. Hemaspaandra, A.L. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997, pp. 23-51.
6. P. Benioff, Quantum mechanical Hamiltonian models of Turing machines, J. Stat. Phys. 29 (1982) 515-546.
7. D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A 400 (1985) 97-117.
8. D. Deutsch, Quantum computational networks, Proc. Roy. Soc. London Ser. A 425 (1989) 73-90.
9. D. Deutsch, R. Jozsa, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A 439 (1992) 553-558.
10. S. Fenner, L. Fortnow, S. Kurtz, Gap-definable counting classes, J. Comput. System Sci. 48 (1994) 116-148.
11. S. Fenner, F. Green, S. Homer, R. Pruim, Quantum NP is hard for PH, in: Proc. 6th Italian Conference on Theoretical Computer Science, World Scientific, Singapore, 1998, pp. 241-252.
12. S. Fenner, F. Green, S. Homer, R. Pruim, Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy, quant-ph/9812056, December 18, 1998.
13. R. Feynman, Quantum mechanical computers, Found. Phys. 16 (1986) 507-531.
14. L. Fortnow, J. Rogers, Complexity limitations on quantum computation, in: Proc. 13th IEEE Conference on Computational Complexity, 1998, pp. 202-209.
15. =P, Math. Systems Theory 26 (1993) 215-233.
16. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proc. 28th ACM Symposium on Theory of Computing, 1996, pp. 212-219.
17. L. Li, On the counting functions, Ph.D. dissertation, Department of Computer Science, University of Chicago, 1993.
18. P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Cornput. 26 (1997) 1484-1509.
19. D.R. Simon, On the power of quantum computation, SIAM J. Comput. 26 (1997) 1474-1483.
20. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput. 20 (1991) 865-877.
21. J. Torán, Complexity classes defined by counting quantifiers, J. ACM 38 (1991) 753-774.
22. K. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Inform. 23 (1986) 325-356.
23. T. Yamakami, A foundation of programming a multi-tape quantum Turing machine, in: Proc. 24th International Symposium on Mathematical Foundation of Computer Science, Lecture Note in Computer Sci., Springer, Berlin, to appear.