REVIEW 3 cited by
The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
read the original abstract
Identifying the symmetry properties of quantum states is a central theme in quantum information theory and quantum many-body physics. In this work, we investigate quantum learning problems in which the goal is to identify a hidden symmetry of an unknown quantum state. Building on the recent formulation of the state hidden subgroup problem (StateHSP), we focus on abelian groups and develop an efficient quantum algorithm that learns any hidden symmetry subgroup using a generalized form of Fourier sampling. We showcase the versatility of the approach in three concrete applications: These are learning (i) qubit and qudit stabilizer groups, (ii) cuts along which a state is unentangled, and (iii) hidden translation symmetries. Through these applications, we reveal that well-known quantum learning primitives, such as Bell sampling and Bell difference sampling, are, in fact, special cases of Fourier sampling. Our results highlight the broad potential of the StateHSP framework for symmetry-based quantum learning tasks and provide protocols that are easier to implement on near-term quantum devices.
Forward citations
Cited by 3 Pith papers
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...
-
Agnostic learning of qudit stabilizer states
A quantum algorithm learns an n-qudit stabilizer state within ε of optimal fidelity with sample/time (d/τ)^{O(d^2 log(1/τ))} poly(n,1/ε), for odd prime d.
-
Single-copy stabilizer learning: average case and worst case
Log-depth circuits suffice for average-case single-copy stabilizer learning with t=O(log n), but worst-case adaptive single-copy learning requires exp(t) samples.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.