Pith. sign in

REVIEW 2 cited by

Quantum Merlin-Arthur with an internally separable proof

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.19152 v1 pith:RZR4CXTN submitted 2024-10-24 quant-ph cs.CC

Roozbeh Bassirian , Bill Fefferman , Itai Leigh , Kunal Marwaha , Pei Wu This is my paper · ORCID
classification quant-phcs.CC
keywords proofarxivhavingmodificationnexpquantumseparableapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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] (QIP 2024). 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Near-Optimal Gap Amplification for Nonnegative Unentangled Quantum Proofs

    quant-ph 2026-08 conditional novelty 8.0 of 10

    This paper proves NEXP = QMA^+(2,1-1/poly,1/4+1/poly), a near-optimal gap amplification for nonnegative unentangled quantum proofs.

  2. The power of unentanglement without destructive interference

    quant-ph 2026-04 unverdicted novelty 8.0 of 10

    StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.

Pith tools