Compression of quantum multi-prover interactive proofs

DOI10.1145/3055399.3055441zbMath1370.68102arXiv1610.03133OpenAlexW2530940551MaRDI QIDQ4977979

Zhengfeng Ji

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.03133

zbMATH Keywords

Bell inequalitiesentanglementnonlocal gamesquantum interactive proofsquantum PCP conjecture

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Unnamed Item ⋮ Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

This page was built for publication: Compression of quantum multi-prover interactive proofs