A quantum oracle separation between QMA(2) and QMA
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 $ε+δ<1$, any $(ε,δ)$-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...
Description / Details
We find a quantum oracle relative to which . As a consequence, we resolve the no-disentanglers conjecture of Watrous: for every , any -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 lower bound to the approximate degree of .
Source: arXiv:2609.02865v1 - http://arxiv.org/abs/2609.02865v1 PDF: https://arxiv.org/pdf/2609.02865v1 Original Link: http://arxiv.org/abs/2609.02865v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 3, 2026
Quantum Computing
Quantum Physics
0