Shorter unentangled proofs for Ground State Connectivity
Quantum Physics
2018-07-02 v1
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 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 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.
Cite
@article{arxiv.1712.07400,
title = {Shorter unentangled proofs for Ground State Connectivity},
author = {Libor Caha and Daniel Nagaj and Martin Schwarz},
journal= {arXiv preprint arXiv:1712.07400},
year = {2018}
}
Comments
21 pages