Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 608-617

  Kitaev, Alexei ^a,b   Watrous, John ^c  

^a MICROSOFT RESEARCH   (United States)

^b LANDAU INSTITUTE FOR THEORETICAL PHYSICS   (Russian Federation)

^c UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED ERRORS; EXPONENTIAL TIME; INTERACTIVE PROOF SYSTEM; PARALLELIZATIONS; QUANTUM INFORMATION; QUANTUM INTERACTIVE PROOF SYSTEMS;

QUANTUM COMPUTERS; QUANTUM OPTICS; POLYNOMIALS; THEOREM PROVING;

COMPUTATION THEORY; INTERACTIVE COMPUTER SYSTEMS;

QUANTUM INTERACTIVE PROOF SYSTEMS;

EID: 0033720106     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335387     Document Type: Conference Paper

References (32)

1. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 20-30, 1998.
2. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13-51, 1995.
3. L. Babai. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 421-429, 1985.
4. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
5. A. Barenco. A universal two-bit gate for quantum computation. Proceedings of the Royal Society of London, 449:679-683, 1995.
6. A. Barenco, C. H. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Physical Review Letters A, 52:3457-3467, 1995.
7. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997. (Pubitemid 127613098)
8. A. Berthiaume. Quantum computation. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 23-50. Springer, 1997.
9. J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45-54, 1990.
10. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London, A400:97-117, 1985. (Pubitemid 15563359)
11. D. Deutsch. Quantum computational networks. Proceedings of the Royal Society of London, A425:73-90, 1989.
12. D. DiVincenzo. Two-bit gates are universal for quantum computation. Physical Review A, 50:1015-1022, 1995.
13. U. Feige. On the success probability of two provers in one-round proof systems. In Proceedings of the Sixth Annual Conference on Structure in Complexity Theory, pages 116-123, 1991.
14. U. Feige and L. Lovász. Two-prover one-round proof systems: their power and their problems. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
15. C. Fuchs and J. van de Graaf. Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory, 45(4):1216-1227, 1999.
16. O. Goldreich. A taxonomy of proof systems. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 109-134. Springer-Verlag, 1997.
17. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
18. Preliminary version appeared in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 291-304, 1985.
19. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 73-90. JAI Press, 1989.
20. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1, 1981.
21. R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1985.
22. L. Hughston, R. Jozsa, and W. Wootters. A complete classification of quantum ensembles having a given density matrix. Physics Letters A, 183:14-18, 1993.
23. R. Jozsa. Fidelity for mixed quantum states. Journal of Modern Optics, 41(12):2315-2323, 1994.
24. A. Kitaev. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6):1191-1249, 1997. (Pubitemid 127374800)
25. D. Lapidot and A. Shamir. Fully parallelized multi prover protocols for NEXP-time. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 13-18, 1991.
26. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992. (Pubitemid 23600385)
27. A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992. (Pubitemid 23600384)
28. P. Shor. Fault-tolerant quantum computation. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 56-65, 1996.
29. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997. (Pubitemid 127613100)
30. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996. (Pubitemid 126610912)
31. J. Watrous. PSPACE has constant-round quantum interactive proof systems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 112-119, 1999.
32. A. Yao. Quantum circuit complexity. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 352-361, 1993.