Shorter unentangled proofs for ground state connectivity
Abstract
Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers? We consider a frustration-free variant of the sf {QCMA}-complete ground state connectivity (GSCON) problem for a system of size n with a proof of superlinear size. We show that we can shorten this proof in sf {QMA}(2): There exists a two-copy, unentangled proof with length of order n, up to logarithmic factors, while the completeness-soundness gap of the new protocol becomes a small inverse polynomial in n.
- Publication:
-
Quantum Information Processing
- Pub Date:
- July 2018
- DOI:
- 10.1007/s11128-018-1944-4
- arXiv:
- arXiv:1712.07400
- Bibcode:
- 2018QuIP...17..174C
- Keywords:
-
- Quantum complexity;
- QMA(2);
- Unentanglement;
- Short proofs;
- Ground state connectivity problem (GSCON);
- Quantum Physics
- E-Print:
- 21 pages