Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper establishes a separation between QMA and QMA(2) relative to a quantum oracle, definitively resolving Watrous's no-disentanglers conjecture regarding the exponential input size requirements for disentanglers. By integrating the unitarily invariant polynomial method with new constructions based on subspace projectors, the work provides significant theoretical advances in understanding the complexity landscape of quantum verification.
Sources coveringarXiv, AI Alignment Forum, pronedra.ru, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

A quantum oracle separation between QMA(2) and QMA

arXiv1 min read

arXiv:2609.02865v1 Announce Type: new Abstract: 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 $\epsilon+\delta<1$, any $(\epsilon,\delta)$-disentangler requires input size exponential in the number of output qubits. Our proof combines the unitarily invariant polynomial method of She and Yuen (ITCS '23) with a new construction based on the symmetric and antisymmetric subspace projectors, reducing the $\mathsf{QMA}$ lower bound to the approximate degree of $\mathrm{OR}$.

Abstract: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 $\epsilon+\delta<1$, any $(\epsilon,\delta)$-disentangler requires input size exponential in the number of output qubits. Our proof combines the unitarily invariant polynomial method of She and Yuen (ITCS '23) with a new construction based on the symmetric and antisymmetric subspace projectors, reducing the $\mathsf{QMA}$ lower bound to the approximate degree of $\mathrm{OR}$.

arXiv:2609.02865 [quant-ph]

(or arXiv:2609.02865v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.02865 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 164 words

Related coverage