PSPACE has constant-round quantum interactive proof systems

Authors:
John Watrous
Affiliations:
Department of Computer Science, University of Calgary, Calgary, Alberta, Canada
Venue:
Theoretical Computer Science - Algorithms,automata, complexity and games
Year:
2003

Citing 21
Cited 12

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
Two-prover one-round proof systems: their power and their problems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
IP = SPACE: simplified proof

Journal of the ACM (JACM)
PSPACE is provable by two provers in one round

Journal of Computer and System Sciences
On the power of multi-prover interactive protocols

Theoretical Computer Science
Interactive proof systems with polynomially bounded strategies

Journal of Computer and System Sciences
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum Computability

SIAM Journal on Computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Quantum circuits with mixed states

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum computation

Complexity theory retrospective II
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
A proof of the security of quantum key distribution (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information

Quantum multi-prover interactive proof systems with limited prior entanglement

Journal of Computer and System Sciences
Quantum Information and the PCP Theorem

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Zero-knowledge against quantum attacks

Proceedings of the thirty-eighth 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
An application of quantum finite automata to interactive proof systems

Journal of Computer and System Sciences
General properties of quantum zero-knowledge proofs

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Polynomial-space approximation of no-signaling provers

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quantum commitments from complexity assumptions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Quantum interactive proofs with competing provers

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An application of quantum finite automata to interactive proof systems (extended abstract)

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Stronger methods of making quantum interactive proofs perfectly complete

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Bidirectional controlled quantum teleportation and secure direct communication using five-qubit entangled state

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 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 interactive proof system that requires a total of only three messages to be sent between the prover and verifier and has exponentially small (one-sided) probability of error. It follows that quantum interactive proof systems are strictly more powerful than classical interactive proof systems in the constant-round case unless the polynomial time hierarchy collapses to the second level.