arXiv:2609.38134
Resource Compatibility in Optimal Quantum Symmetry Testing
Yimeng Cao, Ranyiliu Chen, Chengkai Zhu, Xin Wang
Abstract
Can a symmetry be tested optimally without using the quantum resource naturally associated with it? For parallel subgroup-versus-Haar testing, we derive a quantitative representation-theoretic converse for every protocol with zero type-I error: the excess type-II error is bounded below by the sum of two nonnegative penalties, one for weight on suboptimal subgroup types and one for deviations of within-type Schur profiles from their typewise extremal profiles. At optimality, both penalties vanish, yielding support and weight locking for every optimal system marginal. Disjointness of the resulting locked set and the free marginal set rules out resource-free optimality, whereas overlap alone does not establish attainability. For the diagonal torus in dimension $d\geq 2$, optimal testing without coherence is possible only with a single query. We determine both the exact optimal type-II error over all protocols with incoherent system marginals and the minimum system-marginal coherence required to attain the unrestricted optimum. For the orthogonal subgroup in dimension $d\geq 2$, a real protocol attains the optimum at every query number. For the qutrit Clifford group, Wigner-positive optimal protocols exist at three and four queries but not from five through nine; whether they exist beyond nine queries remains open. Together, these results relate the subgroup- and query-dependent resource requirements of optimal symmetry testing to structural constraints on optimal system marginals.
AI Summary
The paper asks whether optimal unitary symmetry tests require the quantum resource associated with the tested subgroup. It considers $m$ parallel uses of one unitary sampled either from Haar measure on a closed subgroup $G\subseteq U(d)$ or from Haar measure on $U(d)$, with zero type-I error and arbitrary ancillas. Starting from the known optimum $\beta^\star=1/h_{\max}$, it derives a marginal-dependent converse: excess type-II error bounds two nonnegative penalties, measuring weight on suboptimal subgroup irreducible types and Pearson divergence of conditional Schur-sector weights from prescribed profiles. Optimality therefore locks support and sector weights; near-optimal marginals lie within trace distance $O(\sqrt\varepsilon)$ of this locked set. The proof uses subgroup twirling, Schur decomposition, and operator inequalities. For diagonal-torus testing in every $d\ge2$, incoherent system marginals are optimal only at $m=1$. Their exact restricted optimum is a balanced-basis-string Haar return probability, scaling as $\Theta_d(m^{-d(d-1)/2})$, versus $\Theta_d(m^{-d(d-1)})$ unrestricted. Minimum marginal relative-entropy coherence at optimality equals a classical profile divergence; for qubits it is $(2/3-1/(6\ln2))m+O(\log m)$ bits. Explicit protocols attain these bounds. Conjugation symmetry gives real optimal protocols for $O(d)$ at every query number. For qutrit-Clifford testing, Wigner-positive protocols attain optimality at three and four queries, while exact phase-space witnesses exclude Wigner-positive optimal marginals at five through nine. Locking is necessary, not sufficient, for attainability. The results do not determine total probe-and-measurement resource costs or resource requirements beyond parallel strategies. General resource-budget tradeoffs and Wigner-positive optimality beyond nine queries remain open.
These tools also assisted with code development for exact computations and certificate verification, and with the refinement of the manuscript's mathematical exposition and presentation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6 pages, 1 figure; Supplemental Material: 35 pages, 8 tables