Reproduce “Quantum Merlin-Arthur with an internally separable proof” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Roozbeh Bassirian, Bill Fefferman, Itai Leigh, Kunal Marwaha, Pei Wu
Bassirian et al. introduce QMA_IS, a new complexity class where quantum proofs possess specific internal entanglement properties. Their work demonstrates a computational separation, showing that two unentangled QMA_IS proofs are strictly more powerful than one, providing a new path to the QMA(2) = NEXP conjecture.
Key insights
- Restricting quantum proofs to be "internally separable" provides a structure amenable to distinguishing the computational power of one versus two proofs.
- Two unentangled internally separable proofs can effectively enforce proof purity through a SWAP test, a mechanism critical for achieving NEXP-completeness.
- This new model offers a theoretically robust path to the QMA(2) = NEXP conjecture, as its gap amplification would not imply an unlikely complexity collapse for QMA itself.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.