QIP = PSPACE

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 573-581

  Jain, Rahul ^a   Ji, Zhengfeng ^b,c   Upadhyay, Sarvagya ^d   Watrous, John ^d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

^c INSTITUTE OF SOFTWARE   (China)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

matrix multiplicative weights update method; quantum computation; quantum interactive proof systems; semidefinite programming

Indexed keywords

COMPLEXITY CLASS; COMPUTATIONAL POWER; INTERACTIVE PROOFS; MATRIX; QUANTUM COMPUTATION; QUANTUM INTERACTIVE PROOF SYSTEMS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS;

COMPUTATIONAL LINGUISTICS; MATHEMATICAL PROGRAMMING; QUANTUM COMPUTERS; QUANTUM THEORY;

MATRIX ALGEBRA;

EID: 77954754160     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806768     Document Type: Conference Paper

References (46)

1. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
2. S. Arora, E. Hazan, and S. Kale. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 339-348, 2005.
3. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pages 227-236, 2007.
4. L. Babai. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 421-429, 1985.
5. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254-276, 1988.
6. M. Ben-Or, E. Feig, D. Kozen, and P. Tiwari. A fast parallel algorithm for determining all roots of a polynomial with real roots. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 340-349, 1986.
7. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: how to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
8. R. Bhatia. Matrix Analysis. Springer, 1997.
9. D. Bini and V. Pan. Computing matrix eigenvalues and polynomial zeros where the output is real. SIAM Journal on Computing, 27(4):1099-1115, 1998.
10. A. Borodin. On relating time and space to size and depth. SIAM Journal on Computing, 6:733-744, 1977.
11. A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58:113-136, 1983.
12. Y. Bugeaud. Approximation by Algebraic Numbers, volume 160 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2004.
13. L. Csanky. Fast parallel matrix inversion algorithms. SIAM Journal on Computing, 5(4):618-623, 1976.
14. D. Dobkin, R. Lipton, and S. Reiss. Linear programming is log-space hard for P. Information Processing Letters, 8(2):96-97, 1979.
15. S. Even, A. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2):159-173, 1984.
16. U. Feige and J. Kilian. Making games short. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 506-516, 1997.
17. P. Feldman. The optimum prover lies in PSPACE. Manuscript, 1986.
18. J. von zur Gathen. Parallel linear algebra. In J. Reif, editor, Synthesis of Parallel Algorithms, chapter 13. Morgan Kaufmann Publishers, Inc., 1993.
19. O. Goldreich. On promise problems (a survey in memory of Shimon Even [1935-2004]). Electronic Colloquium on Computational Complexity, Report TR05-018, 2005.
20. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691-729, 1991.
21. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 291-304, 1985.
22. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
23. 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.
24. G. Gutoski and J. Watrous. Toward a general theory of quantum games. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 565-574, 2007.
25. S. Hallgren, A. Kolla, P. Sen, and S. Zhang. Making classical honest verifier zero knowledge protocols secure against quantum attacks. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, volume 5126 of Lecture Notes in Computer Science, pages 592-603. Springer, 2008.
26. R. Jain, S. Upadhyay, and J. Watrous. Two-message quantum interactive proofs are in PSPACE. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 2009.
27. R. Jain and J. Watrous. Parallel approximation of non-interactive zero-sum quantum games. In Proceedings of the 24th IEEE Conference on Computational Complexity, pages 243-253, 2009.
28. S. Kale. Efficient algorithms using the multiplicative weights update method. PhD thesis, Princeton University, 2007.
29. J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick. Using entanglement in quantum multi-prover interactive proofs. Computational Complexity, 18(2):273-307, 2009.
30. A. Kitaev and J.Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 608-617, 2000.
31. H. Kobayashi. General properties of quantum zero-knowledge proofs. In Proceedings of the Fifth IACR Theory of Cryptography Conference, volume 4948 of Lecture Notes in Computer Science, pages 107-124. Springer, 2008.
32. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. Journal of Computer and System Sciences, 66(3):429-450, 2003.
33. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992.
34. K. Mahler. Lectures on Diophantine Approximations, volume 1. Cushing Malloy, 1961.
35. C. Marriott and J. Watrous. Quantum Arthur-Merlin games. Computational Complexity, 14(2):122-152, 2005.
36. N. Megiddo. A note on approximate linear programming. Information Processing Letters, 42(1):53, 1992.
37. C. Moler and C. V. Loan. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Review, 45(1):3-49, 2003.
38. C. A. Neff. Specified precision polynomial root isolation is in NC. Journal of Computer and System Sciences, 48(3):429-463, 1994.
39. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
40. M. Serna. Approximating linear programming is log-space complete for P. Information Processing Letters, 37(4):233-236, 1991.
41. A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992.
42. A. Shen. IP = PSPACE: simplified proof. Journal of the ACM, 39(4):878-880, 1992.
43. M. Sipser. Introduction to the Theory of Computation. Thomson Course Technology, second edition, 2005.
44. M. Warmuth and D. Kuzmin. Online variance minimization. In Proceedings of the 19th Annual Conference on Learning Theory, volume 4005 of Lecture Notes in Computer Science, pages 514-528. Springer, 2006.
45. J. Watrous. PSPACE has constant-round quantum interactive proof systems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 112-119, 1999.
46. J. Watrous. Zero-knowledge against quantum attacks. SIAM Journal on Computing, 39(1):25-58, 2009.