Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Merlin-Arthur with an internally separable proof

Published 24 Oct 2024 in quant-ph and cs.CC | (2410.19152v1)

Abstract: We find a modification to QMA where having one quantum proof is strictly less powerful than having two unentangled proofs, assuming EXP $\ne$ NEXP. This gives a new route to prove QMA(2) = NEXP that overcomes the primary drawback of a recent approach arXiv:2402.18790 , arXiv:2306.13247. Our modification endows each proof with a form of multipartite unentanglement: after tracing out one register, a small number of qubits are separable from the rest of the state.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 5 tweets with 475 likes about this paper.