# 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

The Power of Unentanglement

- Physics, Mathematics
- 2008 23rd Annual IEEE Conference on Computational Complexity
- 2008

Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements

- Physics, Mathematics
- 2010

Ground State Connectivity of Local Hamiltonians

- Computer Science, Mathematics
- ACM Trans. Comput. Theory
- 2018

On QMA protocols with two short quantum proofs

- Physics, Computer Science
- Quantum Inf. Comput.
- 2012

Strong NP-hardness of the quantum separability problem

- Mathematics, Physics
- Quantum Inf. Comput.
- 2010

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems

- Computer Science, Mathematics
- Quantum Inf. Comput.
- 2012