Compression of qantum multi-prover interactive proofs

Publication Type:
Conference Proceeding
Citation:
Proceedings of the Annual ACM Symposium on Theory of Computing, 2017, Part F128415 pp. 289 - 302
Issue Date:
2017-06-19
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
C0A55243-893D-4F93-8283-0B52D24E4161_am.pdfAccepted Manuscript554.18 kB
Adobe PDF
© 2017 ACM. We present a protocol that transforms any quantum multi-prover interactive proof into a nonlocal game in which questions consist of logarithmic number of bits and answers of constant number of bits. As a corollary, it follows that the promise problem corresponding to the approximation of the nonlocal value to inverse polynomial accuracy is complete for QMIP∗, and therefore NEXP-hard. This establishes that nonlocal games are provably harder than classical games without any complexity theory assumptions. Our result also indicates that gap amplification for nonlocal games may be impossible in general and provides a negative evidence for the feasibility of the gap amplification approach to the multi-prover variant of the quantum PCP conjecture.
Please use this identifier to cite or link to this item: