Abstract
This work considers the quantum interactive proof system model of computation, which is the (classical) interactive proof system model’s natural quantum computational analogue. An exact characterization of the expressive power of quantum interactive proof systems is obtained: the collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable by deterministic Turing machines that use at most a polynomial amount of space (or, more succinctly, QIP = PSPACE). This characterization is proved through the use of a parallelized form of the matrix multiplicative weights update method, applied to a class of semidefinite programs that captures the computational power of quantum interactive proof systems. One striking implication of this characterization is that quantum computing provides no increase in computational power whatsoever over classical computing in the context of interactive proof systems, for it is well known that the collection of computational problems having classical interactive proof systems coincides with those problems solvable by polynomial-space computations.
- Arora, S. and Barak, B. 2009. Computational Complexity: A Modern Approach. Cambridge University Press. Google ScholarDigital Library
- Arora, S., Hazan, E., and Kale, S. 2005. 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. IEEE Computer Society Press, Los Alamitos, CA, 339--348. Google ScholarDigital Library
- Arora, S. and Kale, S. 2007. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM, New York, 227--236. Google ScholarDigital Library
- Babai, L. 1985. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing. ACM, New York, 421--429. Google ScholarDigital Library
- Babai, L. and Moran, S. 1988. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36, 2, 254--276. Google ScholarDigital Library
- Babai, L., Fortnow, L., and Lund, C. 1991. Non-deterministic exponential time has two-prover interactive protocols. Computat. Complex. 1, 1, 3--40.Google ScholarCross Ref
- Ben-Or, M., Feig, E., Kozen, D., and Tiwari, P. 1986. 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. ACM, New York, 340--349. Google ScholarDigital Library
- Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A. 1988. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, New York, 113--131. Google ScholarDigital Library
- Bennett, C. and Brassard, G. 1984. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing. IEEE Computer Society Press, Los Alamitos, CA, 175--179.Google Scholar
- Bhatia, R. 1997. Matrix Analysis. Springer, New York.Google Scholar
- Bini, D. and Pan, V. 1998. Computing matrix eigenvalues and polynomial zeros where the output is real. SIAM J. Comput. 27, 4, 1099--1115. Google ScholarDigital Library
- Borodin, A. 1977. On relating time and space to size and depth. SIAM J. Comput. 6, 733--744.Google ScholarDigital Library
- Borodin, A., Cook, S., and Pippenger, N. 1983. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inf. Cont. 58, 113--136. Google ScholarDigital Library
- Bugeaud, Y. 2004. Approximation by Algebraic Numbers. Cambridge Tracts in Mathematics, vol. 160. Cambridge University Press, Cambridge, UK.Google Scholar
- Buhrman, H., Cleve, R., and Wigderson, A. 1998. Quantum vs. classical communication and computation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, 63--68. Google ScholarDigital Library
- Church, A. 1936. An unsolvable problem of elementary number theory. Amer. J. Math. 58, 2, 345--363.Google ScholarCross Ref
- Cook, S. 1971. The complexity of theorem proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, 151--158. Google ScholarDigital Library
- Csanky, L. 1976. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5, 4, 618--623.Google ScholarDigital Library
- Deutsch, D. 1985. Quantum theory, the Church--Turing principle and the universal quantum computer. Proc. Roy. Soc. London A400, 97--117.Google ScholarCross Ref
- Dobkin, D., Lipton, R., and Reiss, S. 1979. Linear programming is log-space hard for P. Inf. Proc. Lett. 8, 2, 96--97.Google ScholarCross Ref
- Even, S., Selman, A., and Yacobi, Y. 1984. The complexity of promise problems with applications to public-key cryptography. Inf. Cont. 61, 2, 159--173. Google ScholarDigital Library
- Feige, U. and Kilian, J. 1997. Making games short. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. ACM, New York, 506--516. Google ScholarDigital Library
- Feldman, P. 1986. The optimum prover lies in PSPACE. Manuscript.Google Scholar
- Feynman, R. 1982. Simulating physics with computers. Int. J. Theoret. Physics 21, 6/7, 467--488.Google ScholarCross Ref
- Furer, M., Goldreich, O., Mansour, Y., Sipser, M., and Zachos, S. 1989. On completeness and soundness in interactive proof systems. In Randomness and Computation, S. Micali Ed. Advances in Computing Research, vol. 5. JAI Press, 429--442.Google Scholar
- Goldreich, O. 2005. On promise problems (a survey in memory of Shimon Even {1935--2004}). In Electronic Colloquium on Computational Complexity, Rep. TR05-018.Google Scholar
- Goldreich, O., Micali, S., and Wigderson, A. 1991. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38, 1, 691--729. Google ScholarDigital Library
- Goldwasser, S. and Sipser, M. 1989. Private coins versus public coins in interactive proof systems. In Randomness and Computation, S. Micali Ed. Advances in Computing Research, vol. 5. JAI Press, 73--90.Google Scholar
- Goldwasser, S., Micali, S., and Rackoff, C. 1985. The knowledge complexity of interactive proof systems. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing. ACM, New York, 291--304. Google ScholarDigital Library
- Goldwasser, S., Micali, S., and Rackoff, C. 1989. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 1, 186--208. Google ScholarDigital Library
- Gutoski, G. and Watrous, J. 2007. Toward a general theory of quantum games. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM, New York, 565--574. Google ScholarDigital Library
- Gutoski, G. and Wu, X. 2010. Short quantum games characterize PSPACE. arXiv.org e-Print 1011.2787.Google Scholar
- Hallgren, S., Kolla, A., Sen, P., and Zhang, S. 2008. Making classical honest verifier zero knowledge protocols secure against quantum attacks. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 5126. Springer, 592--603. Google ScholarDigital Library
- Horodecki, R., Horodecki, P., Horodecki, M., and Horodecki, K. 2009. Quantum entanglement. Rev. Modern Phys. 81, 2, 865--942.Google ScholarCross Ref
- Jain, R. and Watrous, J. 2009. Parallel approximation of non-interactive zero-sum quantum games. In Proceedings of the 24th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 243--253. Google ScholarDigital Library
- Jain, R. and Yao, P. 2011. A parallel approximation algorithm for positive semidefinite programming. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. To appear. Google ScholarDigital Library
- Jain, R., Upadhyay, S., and Watrous, J. 2009. Two-message quantum interactive proofs are in PSPACE. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 534--543. Google ScholarDigital Library
- Kale, S. 2007. Efficient algorithms using the multiplicative weights update method. Ph.D. thesis, Princeton University. Google ScholarDigital Library
- Karp, R. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. Miller and J. Thatcher Eds. Plenum Press, New York, 85--103.Google Scholar
- Kempe, J., Kobayashi, H., Matsumoto, K., and Vidick, T. 2009. Using entanglement in quantum multi-prover interactive proofs. Computat. Complex. 18, 2, 273--307.Google ScholarCross Ref
- Kitaev, A. and Watrous, J. 2000. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 608--617. Google ScholarDigital Library
- Kobayashi, H. 2008. General properties of quantum zero-knowledge proofs. In Proceedings of the 5th IACR Theory of Cryptography Conference. Lecture Notes in Computer Science, vol. 4948. Springer, Berlin, 107--124. Google ScholarDigital Library
- Kobayashi, H. and Matsumoto, K. 2003. Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66, 3, 429--450. Google ScholarDigital Library
- Levin, L. 1973. Universal sequential search problems (English translation). Probl. Inf. Trans. 9, 3, 265--266.Google Scholar
- Lund, C., Fortnow, L., Karloff, H., and Nisan, N. 1992. Algebraic methods for interactive proof systems. J. ACM 39, 4, 859--868. Google ScholarDigital Library
- Mahler, K. 1961. Lectures on Diophantine Approximations. Cushing Malloy, Ann Arbor, MI.Google Scholar
- Marriott, C. and Watrous, J. 2005. Quantum Arthur-Merlin games. Computat. Complex. 14, 2, 122--152. Google ScholarDigital Library
- Megiddo, N. 1992. A note on approximate linear programming. Inf. Proc. Lett. 42, 1, 53. Google ScholarDigital Library
- Moler, C. and Van Loan, C. 2003. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Review 45, 1, 3--49.Google ScholarDigital Library
- Neff, C. A. 1994. Specified precision polynomial root isolation is in NC. J. Comput. Syst. Sci. 48, 3, 429--463. Google ScholarDigital Library
- Nielsen, M. and Chuang, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Raz, R. 1999. Exponential separation of quantum and classical communication complexity. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing. ACM, New York, 358--376. Google ScholarDigital Library
- Serna, M. 1991. Approximating linear programming is log-space complete for P. Inf. Proc. Lett. 37, 4, 233--236. Google ScholarDigital Library
- Shamir, A. 1992. IP = PSPACE. J. ACM 39, 4, 869--877. Google ScholarDigital Library
- Shor, P. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5, 1484--1509. Google ScholarDigital Library
- Sipser, M. 1997. Introduction to the Theory of Computation. PWS Publishing Company, Boston, MA. Google ScholarDigital Library
- Terhal, B. 2004. Is entanglement monogamous? IBM J. Res. Develop. 48, 1, 71--78. Google ScholarDigital Library
- Turing, A. 1937. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. (second series) 42, 1, 230--265.Google ScholarCross Ref
- von zur Gathen, J. 1993. Parallel linear algebra. In Synthesis of Parallel Algorithms. J. Reif Ed. Morgan Kaufmann Publishers, Inc., San Francisco, CA, Chap. 13, 573--618.Google Scholar
- Warmuth, M. and Kuzmin, D. 2006. Online variance minimization. In Proceedings of the 19th Annual Conference on Learning Theory. Lecture Notes in Computer Science, vol. 4005. Springer, Berlin, 514--528. Google ScholarDigital Library
- Watrous, J. 1999. PSPACE has constant-round quantum interactive proof systems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 112--119. Google ScholarDigital Library
- Watrous, J. 2009. Zero-knowledge against quantum attacks. SIAM J. Comput. 39, 1, 25--58. Google ScholarDigital Library
Index Terms
QIP = PSPACE
Recommendations
QIP = PSPACE
The interactive proof system model of computation has been studied extensively in computational complexity theory and theoretical cryptography for more than 25 years, and has driven the development of interesting new techniques and insights in those ...
QIP = PSPACE
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a ...
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer ScienceIn this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a quantum ...
Comments