Shorter unentangled proofs for ground state connectivity

@article{Caha2018ShorterUP,
  title={Shorter unentangled proofs for ground state connectivity},
  author={Libor Caha and Daniel Nagaj and M. Schwarz},
  journal={Quantum Information Processing},
  year={2018},
  volume={17},
  pages={1-32}
}
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 $$\textsf {QCMA}$$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 $$\textsf {QMA}(2)$$QMA(2): There exists a two-copy, unentangled proof with length of order n, up to logarithmic factors, while the completeness–soundness… Expand

References

SHOWING 1-10 OF 23 REFERENCES
A Quantum Characterization Of NP
The Power of Unentanglement
Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
Ground State Connectivity of Local Hamiltonians
On QMA protocols with two short quantum proofs
An efficient test for product states
Strong NP-hardness of the quantum separability problem
NP vs QMA_log(2)
  • S. Beigi
  • Physics, Mathematics
  • Quantum Inf. Comput.
  • 2010
The PCP theorem by gap amplification
  • Irit Dinur
  • Mathematics, Computer Science
  • STOC '06
  • 2006
...
1
2
3
...