Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's

Authors:
Richard Cleve;Dmitry Gavinsky;Rahul Jain
Affiliations:
David R. Cheriton School of Computer Science and Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada and Perimeter Institute for Theoretical Physics, Ontario, Canada;David R. Cheriton School of Computer Science and Institute for Quantum Computing, University of Waterloo, Canada and NEC Labs America, Princeton, New Jersey;David R. Cheriton School of Computer Science and Institute for Quantum Computing, University of Waterloo, Canada and Centre for Quantum Technologies and Department of Computer Science, National Un ...
Venue:
Quantum Information & Computation
Year:
2009

Citing 12
Cited 2

Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of 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
On the power of multi-prover interactive protocols

Theoretical Computer Science
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
Some optimal inapproximability results

Journal of the ACM (JACM)
Nonmalleable Cryptography

SIAM Journal on Computing
PSPACE Has Constant-Round Quantum Interactive Proof Systems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement

Journal of Computer and System Sciences
Consequences and Limits of Nonlocal Strategies

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems

CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Entangled Games are Hard to Approximate

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science

A lower bound on the value of entangled binary games

Quantum Information & Computation
Entangled Games Are Hard to Approximate

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that every language in NP is recognized by a two-prover interactive proof system with the following properties. The proof system is entanglement-resistant (i.e., its soundness is robust against provers who have prior shared entanglement), it has one round of interaction, the provers' answers are single bits, and the completeness-soundness gap is constant (formally, NP ⊆ ⊕MIP* 1-ε,1/2+ε[2], for any ε such that 0