Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum Simulation
Entanglement Theory Quantum Correlations
Shorter unentangled proofs for Ground State Connectivity
arXiv
Authors: Libor Caha, Daniel Nagaj, Martin Schwarz
Year
2017
Paper ID
24374
Status
Preprint
Abstract Read
~2 min
Abstract Words
85
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2017 reference point for readers tracking recent quantum research.
- Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers?
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.