Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
The complexity of promise problems with applications to public-key cryptography
Information and Control
A fast parallel algorithm for determining all roots of a polynomial with real roots
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Approximating linear programming is log-space complete for P
Information Processing Letters
Journal of the ACM (JACM)
A note on approximate linear programming
Information Processing Letters
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Specified precision polynomial root isolation is in NC
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
SIAM Journal on Computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Quantum computation and quantum information
Quantum computation and quantum information
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
IBM Journal of Research and Development
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient algorithms using the multiplicative weights update method
Efficient algorithms using the multiplicative weights update method
Computational Complexity
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Parallel Approximation of Non-interactive Zero-sum Quantum Games
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Zero-Knowledge against Quantum Attacks
SIAM Journal on Computing
Two-Message Quantum Interactive Proofs Are in PSPACE
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A Parallel Approximation Algorithm for Positive Semidefinite Programming
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
COLT'06 Proceedings of the 19th annual conference on Learning Theory
| Hi-index | 0.00 |
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.