Perfect parallel repetition theorem for quantum XOR proof systems

DOI10.1007/S00037-008-0250-4zbMath1145.81017arXivquant-ph/0608146OpenAlexW2177980858MaRDI QIDQ937205

Falk Unger, Sarvagya Upadhyay, William Slofstra, Richard Cleve

Publication date: 20 August 2008

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0608146

zbMATH Keywords

quantum computinginteractive proof systemsparallel repetition

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (18)

Anchored Parallel Repetition for Nonlocal Games ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ A generalized Grothendieck inequality and nonlocal correlations that require high entanglement ⋮ Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction ⋮ Parallel Repetition of Two-Prover One-Round Games: An Exposition ⋮ Information value of two-prover games ⋮ On decomposable correlation matrices ⋮ Linear conic formulations for two-party correlations and values of nonlocal games ⋮ Exponential quantum enhancement for distributed addition with local nonlinearity ⋮ Large violation of Bell inequalities with low entanglement ⋮ Survey on nonlocal games and operator space theory ⋮ Unnamed Item ⋮ Parallel Repetition of the Odd Cycle Game ⋮ Quantum XOR Games ⋮ Lower bounds on the entanglement needed to play XOR non-local games ⋮ Optimal bounds for parity-oblivious random access codes ⋮ A parallel repetition theorem for entangled projection games ⋮ Rank-one quantum games

This page was built for publication: Perfect parallel repetition theorem for quantum XOR proof systems