Quantum

A quantum oracle separation between QMA(2) and QMA

John Bostanci, Sabee Grewal, Jonas Haferkamp, Andrew Huang, Yeongwoo Hwang, Anand Natarajan, Chinmay Nirkhe

Featured September 4, 2026

AI-generated analysis — This is SciGrove's AI interpretation of the paper, not peer-reviewed content. Always refer to the original paper.

Simply

Having two separate, unentangled quantum proofs can help solve certain black-box problems much faster than having just one proof, even if that one proof could be entangled, proving that 'un-entanglement' is a powerful resource.

In depth

The paper establishes a quantum oracle separation between the complexity classes QMA(2) and QMA, demonstrating that the absence of entanglement in quantum proofs can be a computational resource. This is achieved by constructing a specific black-box problem, the Antisymmetric Entangled Subspace problem, which a QMA(2) verifier can solve efficiently but a QMA verifier cannot without exponentially many queries or an exponentially large proof. The core technical innovation involves combining the unitarily invariant polynomial method with a novel construction based on symmetric and antisymmetric subspace projectors, which allows the problem to be reduced to the approximate degree of OR.

Key Takeaways

1
The study provides the first unitary-oracle separation between QMA(2) and QMA, showing that unentanglement can be a genuine source of computational power in quantum proof systems.
2
The work resolves the no-disentanglers conjecture of Watrous, proving that approximate disentanglers require an input size exponential in the number of output qubits for constant error rates.
3
A key technical insight is the use of symmetric and antisymmetric subspace projectors which, under local-unitary invariant polynomials, behave as the same polynomial evaluated at positive and negative dimensions, enabling the application of the polynomial method.

Conceptual Flow

HIGH LEVEL

Methodology: The 'Negative Dimension' Trick

Imagine a special math trick where you can use positive numbers to describe one type of quantum space and negative numbers to describe another, but using the same simple formula.

Quantum Space A

Quantum Space B

Apply Math Trick

Same Formula

Positive Number

Negative Number

Results: Unentangled Proofs Win

This trick helps show that a problem that's super hard for one type of quantum computer becomes easy if it can use two proofs that aren't tangled together.

Hard Problem

One Proof (QMA)

Very Slow Solution

This breakdown was generated by SciGrove. Get the same analysis — intuition, storyboard, peer review, a runnable prototype and a glossary — on any paper you upload or paste a DOI for.