Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

Authors:
Richard Cleve;William Slofstra;Falk Unger;Sarvagya Upadhyay
Affiliations:
University of Waterloo, Canada;University of California, Berkeley, USA;CWI, the Netherlands;University of Waterloo, Canada
Venue:
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Year:
2007

Citing 0
Cited 10

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Can quantum mechanics help distributed computing?

ACM SIGACT News
Amortized Communication Complexity of Distributions

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Exponential quantum enhancement for distributed addition with local nonlinearity

Quantum Information Processing
Parallel repetition of the odd cycle game

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Constructive proofs of concentration bounds

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Unique Games with Entangled Provers Are Easy

SIAM Journal on Computing
Properties of local quantum operations with shared entanglement

Quantum Information & Computation
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's

Quantum Information & Computation
Two provers in isolation

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to coordinate their behavior using a shared entangled quantum state, a perfect parallel repetition theorem holds in the following sense. The prover's optimal success probability for simultaneously playing a collection of XOR proof systems is exactly the product of the individual optimal success probabilities. This property is remarkable in view of the fact that, in the classical case (where the provers can only utilize classical information), it does not hold. The theorem is proved by analyzing parities of XOR proof systems using semidefinite programming techniques, which we then relate to parallel repetitions of XOR games via Fourier analysis.