Abelian State Hidden Subgroup Problems

• Abelian StateHSP is a quantum framework that generalizes the classical hidden subgroup problem by recovering invariant subgroups from quantum states.
• It employs character-POVM and Fourier sampling techniques to efficiently identify symmetries, achieving polynomial sample complexity in group size and error parameters.
• Applications include quantum stabilizer learning, entanglement cut identification, and translation symmetry detection, driving advances in quantum algorithm design.

The Abelian State Hidden Subgroup Problem (StateHSP) is an extension of the classical Abelian Hidden Subgroup Problem (HSP), in which the objective is to recover a symmetry subgroup hidden in the state space of a quantum system, rather than by an oracle-defined function over a group domain. StateHSP generalizes the quantum learning of invariance and symmetry in quantum states and underpins a range of tasks in quantum information theory and quantum algorithms, including the efficient identification of stabilizer groups and symmetry partitions in composite quantum systems.

1. Formal Definition and Foundational Structure

Let $G$ be a finite abelian group and $R: G \to U(\mathcal{H})$ a unitary representation on a finite-dimensional Hilbert space $\mathcal{H}$. Given black-box access to a pure quantum state $|\psi\rangle \in \mathcal{H}$, the StateHSP is defined by the condition that there exists a hidden subgroup $H \leq G$ such that:

• Invariance: $R(h)|\psi\rangle = |\psi\rangle$ for all $h \in H$;
• Non-invariance: For $g \notin H$, $|\langle\psi|R(g)|\psi\rangle| \leq 1-\epsilon$ for some $\epsilon>0$.

The principal goal is to efficiently identify $R: G \to U(\mathcal{H})$0 (or, equivalently, its character annihilator $R: G \to U(\mathcal{H})$1 in the dual group $R: G \to U(\mathcal{H})$2) using samples and quantum circuits acting on $R: G \to U(\mathcal{H})$3 (Hinsche et al., 21 May 2025, Bouland et al., 2024).

This paradigm abstracts symmetry identification problems where group actions may not be explicit in the computational structure but are manifest in the invariance properties of the state.

2. Quantum Algorithmic Framework for StateHSP

The central component of the quantum approach is the application of the character-POVM associated with $R: G \to U(\mathcal{H})$4, yielding the following:

• For each character $R: G \to U(\mathcal{H})$5, define the projection operator

$R: G \to U(\mathcal{H})$6

which projects onto the $R: G \to U(\mathcal{H})$7-isotypic subspace. Measurement in the $R: G \to U(\mathcal{H})$8 POVM on $R: G \to U(\mathcal{H})$9 yields outcome $\mathcal{H}$0 with probability

$\mathcal{H}$1

• Due to the invariance under $\mathcal{H}$2, $\mathcal{H}$3 is supported on $\mathcal{H}$4 and anti-concentration properties ensure that sufficient samples span $\mathcal{H}$5 with high probability (Hinsche et al., 21 May 2025).

There are two primary implementation routes:

1. Eigenbasis method: Direct measurement in the simultaneous eigenbasis of $\mathcal{H}$6 (possible because $\mathcal{H}$7 is abelian and the $\mathcal{H}$8 commute).
2. Fourier-sampling method: Prepare an entangled state $\mathcal{H}$9, apply controlled-$|\psi\rangle \in \mathcal{H}$0, then implement an inverse quantum Fourier transform (QFT) over $|\psi\rangle \in \mathcal{H}$1 on the first register and measure (Hinsche et al., 21 May 2025, Bouland et al., 2024).

Sample complexity scales as $|\psi\rangle \in \mathcal{H}$2 for $|\psi\rangle \in \mathcal{H}$3-separated subgroups, with polynomial-time classical post-processing via Gaussian elimination.

3. Comparison with Classical Abelian HSP

The classical Abelian HSP, in its function-oracle form, reduces the hidden subgroup identification to Fourier sampling: measurement in the Fourier basis after coset-state preparation yields random characters from $|\psi\rangle \in \mathcal{H}$4, from which $|\psi\rangle \in \mathcal{H}$5 is reconstructed (Dutto et al., 1 Dec 2025, Gogioso et al., 2017). In the StateHSP context, the character-POVM measurement achieves an essentially identical sampling distribution under the exact invariance assumption, and achieves similar performance guarantees in terms of sample and time complexity (Hinsche et al., 21 May 2025).

Both paradigms, function-oracle HSP and state-oracle StateHSP, thus share algorithmic techniques (QFT, character sampling, linear algebraic reconstruction), yet their query access is fundamentally different: the former queries function values, the latter manipulates quantum states with group symmetries.

Feature	Classical Abelian HSP	Abelian StateHSP
Oracle access	Function $|\psi\rangle \in \mathcal{H}$6	State $|\psi\rangle \in \mathcal{H}$7, $|\psi\rangle \in \mathcal{H}$8
Hidden object	Subgroup $|\psi\rangle \in \mathcal{H}$9 of $H \leq G$0	Invariant subgroup $H \leq G$1 under $H \leq G$2
Coset superposition	Yes	Encoded through state invariance
Measurement	QFT over $H \leq G$3	Character-POVM or Fourier sampling
Reconstruction complexity	Poly$H \leq G$4	Poly$H \leq G$5

4. Algorithmic Applications: Quantum Stabilizer and Symmetry Learning

StateHSP provides an efficient foundation for key symmetry-identification and learning tasks in quantum information theory (Hinsche et al., 21 May 2025, Bouland et al., 2024):

• Learning qubit/qudit stabilizer groups: For $H \leq G$6-qudit systems, one can efficiently identify the full stabilizer group of a pure state via Bell-difference or $H \leq G$7-copy Bell-type measurements corresponding to the character-POVM of the generalized Pauli group. This encompasses and generalizes traditional stabilizer formalism and applies to broader classes of qudit codes.
• Entanglement cut and hidden partition identification: Identifying the block decomposition (cuts) along which a composite state is a tensor product (unentangled) is reducible to a StateHSP over $H \leq G$8 with a swap representation; the hidden subgroup is the span of block indicators. Algorithms for the "hidden cut" problem achieve $H \leq G$9 sample complexity, which is tight up to logarithmic factors (Bouland et al., 2024).
• Translation symmetry and hidden periodicity: Detecting translation-invariant subgroups acting on a quantum state (e.g., ring systems) becomes a phase estimation problem in the StateHSP context.

These applications illustrate the conceptual universality and applicability of the StateHSP framework to a broad class of quantum learning and symmetry recovery problems.

5. Algorithmic and Structural Generalizations

StateHSP supports multiple generalizations:

• Many-copy vs. many-state: The algorithmic framework can accommodate either multiple copies of the same $R(h)|\psi\rangle = |\psi\rangle$0 or different states with shared hidden invariance under $R(h)|\psi\rangle = |\psi\rangle$1, reducing circuit depth and enabling more general quantum learning scenarios (Hinsche et al., 21 May 2025).
• Non-abelian StateHSP: Extending the approach beyond abelian $R(h)|\psi\rangle = |\psi\rangle$2 is largely open, as multiplicities, noncommuting operators, and representation-theoretic complexity present significant barriers (Hinsche et al., 21 May 2025).
• Beyond perfect invariance: For mixed input states or approximate invariance (as quantified by trace distance or fidelity), the anti-concentration properties and sample complexity become more intricate, with optimality and robustness properties still under investigation (Bouland et al., 2024).
• Infinite and compact groups: Extensions to continuous or infinite abelian groups (e.g., compact tori, real spaces) require infinite-dimensional Fourier analysis and present additional analytical and computational challenges (Kuperberg, 24 Jul 2025, Gogioso et al., 2017).

6. Methodological Connections and Cryptographic Implications

StateHSP unifies and generalizes several established primitives:

• Bell measurement and state symmetry testing: The character-POVM approach covers standard Bell-basis and difference sampling methods within a single algebraic formalism.
• Fourier sampling structure: The underlying algebra reproduces the measurement statistics and reconstruction techniques of the QFT-based HSP algorithms (Gogioso et al., 2017).
• Cryptanalysis and pseudorandomness: StateHSP-based algorithms can be applied to decompose cryptographically significant quantum states, potentially breaking certain pseudorandom constructions (e.g., recursively-defined product states), unless entropy across cuts is maintained (Bouland et al., 2024). The behavior under small-entropy cuts suggests a possible connection to computationally hard tasks like Learning Parity with Noise (LPN), which may inform quantum cryptographic protocol design.

7. Open Directions and Theoretical Landscape

Outstanding directions include:

• Extending noise robustness: Determining tight lower/upper bounds for mixed-state StateHSP and learning under weak symmetry constraints (Hinsche et al., 21 May 2025).
• Full generalization beyond abelian groups: Developing efficient StateHSP algorithms for nonabelian $R(h)|\psi\rangle = |\psi\rangle$3 remains a largely open frontier.
• Practical implementations: Analyzing depth, width, and fault tolerance for character-POVM and QFT-based circuits in NISQ and distributed architectures.

Theoretical developments in the abelian StateHSP have established polynomial-time quantum algorithms for hidden symmetry identification, have provided tight complexity bounds (optimal up to logarithmic factors in many regimes), and shaped new perspectives in quantum learning, symmetry exploitation, and quantum state certification (Hinsche et al., 21 May 2025, Bouland et al., 2024). The framework stands as a central nexus between quantum algorithms, representation theory, and quantum information processing.