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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.