A Quantum Oracle Separation Between $\mathsf{QMA}(2)$ and $\mathsf{QMA}$

Lineage and corrections

This event attributed to John Bostanci; Sabee Grewal; Jonas Haferkamp; Andrew Huang; Yeongwoo Hwang; Anand Natarajan; Chinmay Nirkhe

This event attributed to ChatGPT 5.6 Sol

The authors construct a unitary oracle $U$ such that $$\mathsf{QMA}^{U}\neq\mathsf{QMA}(2)^{U}.$$ Their black-box problem is solvable by a $\mathsf{QMA}(2)$ verifier with one oracle query and linear-size unentangled proofs, whereas any $\mathsf{QMA}$ verifier must use either exponentially many queries or an exponentially large witness. As a non-oracle consequence, they prove that for every fixed $\varepsilon,\delta\ge 0$ with $\varepsilon+\delta<1$, any $(\varepsilon,\delta)$-disentangler requires exponentially many input qubits in the number of output qubits, resolving Watrous's no-disentanglers conjecture. parent of this event

A Quantum Oracle Separation Between $\mathsf{QMA}(2)$ and $\mathsf{QMA}$ parent of this event

VibeMathed record: A Quantum Oracle Separation Between $\mathsf{QMA}(2)$ and $\mathsf{QMA}$ evidence for this event

Aaronson, Beigi, Drucker, Fefferman and Shor, The Power of Unentanglement, where the question is posed evidence for this event

A Quantum Oracle Separation Between $\mathsf{QMA}(2)$ and $\mathsf{QMA}$ evidence for this event