A Quantum Oracle Separation Between $\mathsf{QMA}(2)$ and $\mathsf{QMA}$
resolvedconfidence 70%
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
We find a quantum oracle relative to which $\mathsf{QMA}\neq\mathsf{QMA}(2)$. As a consequence, we resolve the no-disentanglers conjecture of Watrous: for every $\varepsilon+\delta<1$, any $(\varepsilon,\delta)$-disentangler requires input size exponential in the number of output qubits.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement
fidelity, correctness, priority, or novelty.
What AI did
ChatGPT 5.6 Sol
The authors explicitly state that the proof idea underlying the main theorem was generated using ChatGPT 5.6 Sol. They initially directed Sol to the unitary polynomial method of She and Yuen; with minimal further guidance, the model proposed the proof idea used in the paper. The authors then verified, simplified, and developed the argument. The key construction uses symmetric and antisymmetric subspace projectors to make the relevant local-unitary invariant polynomials collapse to a single univariate polynomial, reducing the lower bound to the approximate degree of $\mathrm{OR}$.
Unreviewed. A 25-page preprint two days old, no peer review, no formalisation. Seven authors, including several who work on exactly this, state that they "verified, simplified, and developed" the model's proof idea and take full responsibility. The argument reduces to the approximate degree of OR through the She-Yuen unitary polynomial method, so it is checkable by anyone who knows that toolkit. Nobody outside the author list has done so on the record.
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.
Known method families
construction (source-reported)
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
VibeMath has not independently verified the mathematical claim.
AI-attempt independence and training-data exposure are unknown unless explicitly documented.
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.