Quantum interactive proofs with competing provers

Authors:
Gus Gutoski;John Watrous
Affiliations:
Department of Computer Science, University of Calgary, Alberta, Canada;Department of Computer Science, University of Calgary, Alberta, Canada
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 17
Cited 3

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
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)
Multi-oracle interactive protocols with constant space verifiers

Journal of Computer and System Sciences
Making games short (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Quantum circuits with mixed states

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Parallel Repetition Theorem

SIAM Journal on 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
The Noisy Oracle Problem

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
PSPACE has constant-round quantum interactive proof systems

Theoretical Computer Science - Algorithms,automata, complexity and games
A game-theoretic classification of interactive complexity classes

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Classical and Quantum Computation

Classical and Quantum Computation
Cryptographic distinguishability measures for quantum-mechanical states

IEEE Transactions on Information Theory

Guest Column: NP-complete problems and physical reality

ACM SIGACT News
Toward a general theory of quantum games

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Secure two-party quantum evaluation of unitaries against specious adversaries

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language having an ordinary quantum interactive proof system also has a quantum refereed game in which the verifier exchanges just one round of messages with each prover. A key part of our proof is the fact that there exists a single quantum measurement that reliably distinguishes between mixed states chosen arbitrarily from disjoint convex sets having large minimal trace distance from one another. We also show how to reduce the probability of error for some classes of quantum refereed games.