PSPACE has constant-round quantum interactive proof systems

Theoretical Computer Science

Volumn 292, Issue 3, 2003, Pages 575-588

  Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; ERRORS; MATHEMATICAL MODELS; QUANTUM THEORY;

QUANTUM INTERACTIVE PROOF SYSTEMS;

COMPUTER SCIENCE;

EID: 0037473943     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00375-9     Document Type: Conference Paper

References (33)

1. Adleman L., Demarrais J., Huang M. Quantum computability. SIAM J. Comput. 26(5):1997;1524-1540.
2. D. Aharonov, A. Kitaev, N. Nisan, Quantum circuits with mixed states, Proc. 30th Annual ACM Symp. on Theory of Computing, 1998, pp. 20-30.
3. Arora S., Safra S. Probabilistic checking of proofs. a new characterization of NP J. ACM. 45(1):1998;70-122.
4. L. Babai, Trading group theory for randomness, Proc. 17th Ann. ACM Symp. on Theory of Computing, 1985, pp. 421-429.
5. Babai L., Fortnow L., Lund C. Non-deterministic exponential time has two-prover inter-active protocols. Comput. Complex. 1(1):1991;3-40.
6. Babai L., Moran S. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. System Sci. 36(2):1988;254-276.
7. Barenco A. A universal two-bit gate for quantum computation. Proc. Roy. Soc. London. 449:1995;679-683.
8. Barenco A., Bennett C.H., Cleve R., DiVincenzo D., Margolus N., Shor P., Sleator T., Smolin J., Weinfurter H. Elementary gates for quantum computation. Phys. Rev. A. 52:1995;3457-3467.
9. M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson, Multi-prover interactive proofs: how to remove intractability assumptions, Proc. 20th Ann. ACM Symp. on Theory of Computing, 1988, pp. 113-131.
10. C.H. Bennett, G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Proc. IEEE Internat. Conf. on Computers, Systems, and Signal Processing, 1984, pp. 175-179.
11. Berthiaume A. Quantum computation. Hemaspaandra L., Selman A. Complexity Theory Retrospective II. 1997;23-50 Springer, Berlin.
12. E. Biham, M. Boyer, P.O. Boykin, T. More, V. Roychowdhury, A proof of the security of quantum key distribution, Proc. 32nd Annual ACM Symp. on Theory of Computing, 2000, pp. 715-724.
13. Cai J., Condon A., Lipton R. PSPACE is provable by two provers in one round. J. Comput. System Sci. 48(1):1994;183-193.
14. Condon A., Ladner R. Interactive proof systems with polynomially bounded strategies. J. Comput. System Sci. 50(3):1995;506-518.
15. Deutsch D. Quantum computational networks. Proc. Roy. Soc. London Ser. A. 425:1989;73-90.
16. DiVincenzo D. Two-bit gates are universal for quantum computation. Phys. Rev. A. 50:1995;1015-1022.
17. Dwork C., Stockmeyer L. Finite state verifiers I. the power of interaction J. ACM. 39(4):1992;800-828.
18. U. Feige, L. Lovász, Two-prover one-round proof systems: their power and their problems, Proc. 24th Ann. ACM Symp. on Theory of Computing, 1992, pp. 733-744.
19. P. Feldman, The optimum prover lies in PSPACE, Manuscript, M.I.T., 1986.
20. Fortnow L., Rompel J., Sipser M. On the power of multi-prover interactive protocols. Theoret. Comput. Sci. 134:1994;545-557.
21. Goldwasser S., Micali S., Rackoff C. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1):1989;186-208.
22. Goldwasser S., Sipser M. Private coins versus public coins in interactive proof systems. Micali S. Randomness and Computation, Advances in Computing Research. Vol. 5:1989;73-90 JAI Press.
23. A. Kitaev, J. Watrous, Parallelization, amplification, and exponential time simulation of quantum interactive proof system, Proc. 32nd ACM Symp. on Theory of Computing, 2000, pp. 608-617.
24. Lund C., Fortnow L., Karloff H., Nisan N. Algebraic methods for interactive proof systems. J. ACM. 39(4):1992;859-868.
25. D. Mayers, Unconditional security in quantum cryptography. Los Alamos Preprint Archive, quant-ph/9802025, 1998.
26. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambridge, MA.
27. R. Raz, Exponential separation of quantum and classical communication complexity, Proc. 31st Annual ACM Symp. on Theory of Computing, 1999, pp. 358-376.
28. Shamir A. IP=PSPACE J. ACM. 39(4):1992;869-877.
29. Shen A. IP=PSPACE: simplified proof J. ACM. 39(4):1992;878-880.
30. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5):1997;1484-1509.
31. P. Shor, J. Preskill, Simple proof of security of the BB84 quantum key distribution protocol, Los Alamos Preprint Archive, quant-ph/0003004, 2000.
32. Shoup V. New algorithms for finding irreducible polynomials over finite fields. Math. Comput. 54:1990;435-447.
33. A. Yao, Quantum circuit complexity, Proc. 34th Ann. Symp. on Foundations of Computer Science, 1993, pp. 352-361.