The problem of degeneracy in quantum mechanics is related to the existence of groups of contact transformations under which the Hamiltonian is invariant. The correspondence between transformations in classical and quantum theories is developed. The Fock-Bargmann treatment of the symmetry group of the hydrogenic atom comes under this theory. The symmetry group of the 2-dimensional Kepler problem is found to be the 3-dimensional rotation group; that of the $n$ -dimensional isotropic oscillator is isomorphic to the unimodular unitary group in $n$ dimensions. The 2-dimensional anisotropic oscillator has the same symmetry as the isotropic oscillator in classical mechanics, but the quantum-mechanical problem presents complications which leave its symmetry group in doubt.The problem of degeneracy in quantum mechanics is related to the existence of groups of contact transformations under which the Hamiltonian is invariant. The correspondence between transformations in classical and quantum theories is developed. The Fock-Bargmann treatment of the symmetry group of the hydrogenic atom comes under this theory. The symmetry group of the 2-dimensional Kepler problem is found to be the 3-dimensional rotation group; that of the $n$-dimensional isotropic oscillator is isomorphic to the unimodular unitary group in $n$ dimensions. The 2-dimensional anisotropic oscillator has the same symmetry as the isotropic oscillator in classical mechanics, but the quantum-mechanical problem presents complications which leave its symmetry group in doubt.

Physical ReviewApr 1, 1940369 citations

Spectral Theory and Quantum Mechanics

Valter Moretti

UnitextJan 1, 201761 citations

The Quantum Character Transform

Kagwe A. Muchane

Bastidas et al. (2025) highlighted the importance of exploiting group symmetries to reduce computational overhead and unify simulation methods across both condensed matter physics and ab initio quantum chemistry. I discuss the discrete character transform, which is the group Fourier transform restricted to $Z(\mathbb{C}[G])$ , the center of the group algebra, where class functions form a commutative convolution algebra and irreducible characters are its spectral basis. The normalized character table of a non-abelian group can be obtained through a restriction operator, which means an efficient quantum character transform for any finite group with an efficient quantum Fourier transform. I give complementary quantum algorithms for class convolution based on direct class-sum block encoding and spectral implementation in the character basis, explaining their applications to symmetry-adapted many-body dynamics, molecular and spectroscopic symmetry analysis, and quantum walks, as well as characterizing the central information used in hidden-subgroup problems, including its limitations for graph isomorphism.Bastidas et al. (2025) highlighted the importance of exploiting group symmetries to reduce computational overhead and unify simulation methods across both condensed matter physics and ab initio quantum chemistry. I discuss the discrete character transform, which is the group Fourier transform restricted to $Z(\mathbb{C}[G])$, the center of the group algebra, where class functions form a commutative convolution algebra and irreducible characters are its spectral basis. The normalized character table of a non-abelian group can be obtained through a restriction operator, which means an efficient quantum character transform for any finite group with an efficient quantum Fourier transform. I give complementary quantum algorithms for class convolution based on direct class-sum block encoding and spectral implementation in the character basis, explaining their applications to symmetry-adapted many-body dynamics, molecular and spectroscopic symmetry analysis, and quantum walks, as well as characterizing the central information used in hidden-subgroup problems, including its limitations for graph isomorphism.

quant-pharXiv:2610.16827Oct 13, 20260 citations

Group Theory in Quantum Mechanics

Elsevier eBooksJan 1, 1960514 citations

Learning quantum symmetries

Isaac Holt, Sathyawageeswar Subramanian

Quantum algorithms are powerful tools for finding symmetries of classical objects, most famously through Shor's algorithm and the Hidden Subgroup Problem (HSP). In this work, we study quantum algorithms for learning symmetries of \emph{quantum} objects. Existing work in this area centres on the recently introduced State Hidden Subgroup Problem (StateHSP), a quantum generalisation of HSP in which the task is to learn the symmetry subgroup of a quantum state. We develop efficient quantum algorithms for non-abelian StateHSP when the hidden subgroup is normal and the ambient group belongs to a broad class of non-abelian groups, extending the previous general theory beyond the abelian setting. StateHSP learns \emph{Bose} symmetries, under which a state must be invariant exactly under the action of the symmetry group. In quantum mechanics, however, physically equivalent pure states are defined only up to global phase. Motivated by this, we introduce a natural notion of \emph{Anyonic} state symmetry learning, based on invariance up to global phase. We give an efficient quantum algorithm by reducing the problem to StateHSP, where the reduction rests on a new correspondence between linearisations of projective representations and linear error-correcting codes. As an application, we obtain an improved algorithm for learning stabiliser groups of mixed qudit states of arbitrary local dimension. Finally, we introduce symmetry learning problems for other quantum objects, including unitaries, Hamiltonians, and finite collections of states, and give efficient algorithms for them by reduction to state symmetry learning. Together, these results broaden the scope of state symmetry learning as a common algorithmic primitive for learning quantum symmetries.Quantum algorithms are powerful tools for finding symmetries of classical objects, most famously through Shor's algorithm and the Hidden Subgroup Problem (HSP). In this work, we study quantum algorithms for learning symmetries of \emph{quantum} objects. Existing work in this area centres on the recently introduced State Hidden Subgroup Problem (StateHSP), a quantum generalisation of HSP in which the task is to learn the symmetry subgroup of a quantum state. We develop efficient quantum algorithms for non-abelian StateHSP when the hidden subgroup is normal and the ambient group belongs to a broad class of non-abelian groups, extending the previous general theory beyond the abelian setting. StateHSP learns \emph{Bose} symmetries, under which a state must be invariant exactly under the action of the symmetry group. In quantum mechanics, however, physically equivalent pure states are defined only up to global phase. Motivated by this, we introduce a natural notion of \emph{Anyonic} state symmetry learning, based on invariance up to global phase. We give an efficient quantum algorithm by reducing the problem to StateHSP, where the reduction rests on a new correspondence between linearisations of projective representations and linear error-correcting codes. As an application, we obtain an improved algorithm for learning stabiliser groups of mixed qudit states of arbitrary local dimension. Finally, we introduce symmetry learning problems for other quantum objects, including unitaries, Hamiltonians, and finite collections of states, and give efficient algorithms for them by reduction to state symmetry learning. Together, these results broaden the scope of state symmetry learning as a common algorithmic primitive for learning quantum symmetries.

quant-pharXiv:2609.38085Sep 30, 20260 citations

Generalized Spectral Decomposition for Quantum Impurity Problems

Jun-Bin Wang, Dongchen Huang, Yi‐feng Yang

Solving quantum impurity problems may advance our understanding of strongly correlated electron physics, but its development in multi-impurity systems has been greatly hindered due to the presence of shared bath. Here, we propose a general operation strategy to disentangle the shared bath into multiple auxiliary baths and relate the problem to a spectral decomposition problem of function matrix for applying the numerical renormalization group (NRG). We prove exactly that such decomposition is possible for models satisfying (block) circulant symmetry, and show how to construct the auxiliary baths for arbitrary impurity configuration by mapping its graph structure to the subgraph of a regular impurity configuration. We further propose an approximate decomposition algorithm to reduce the number of auxiliary baths and save the computational workload. Our work reveals a deep connection between quantum impurity problems and the graph theory, and provides a general scheme to extend the NRG applications for realistic multi-impurity systems.Solving quantum impurity problems may advance our understanding of strongly correlated electron physics, but its development in multi-impurity systems has been greatly hindered due to the presence of shared bath. Here, we propose a general operation strategy to disentangle the shared bath into multiple auxiliary baths and relate the problem to a spectral decomposition problem of function matrix for applying the numerical renormalization group (NRG). We prove exactly that such decomposition is possible for models satisfying (block) circulant symmetry, and show how to construct the auxiliary baths for arbitrary impurity configuration by mapping its graph structure to the subgraph of a regular impurity configuration. We further propose an approximate decomposition algorithm to reduce the number of auxiliary baths and save the computational workload. Our work reveals a deep connection between quantum impurity problems and the graph theory, and provides a general scheme to extend the NRG applications for realistic multi-impurity systems.

arXiv:2404.09444Apr 15, 20240 citations

n

-dimensional isotropic oscillator is isomorphic to the unimodular unitary group in

n

dimensions. The 2-dimensional anisotropic oscillator has the same symmetry as the isotropic oscillator in classical mechanics, but the quantum-mechanical problem presents complications which leave its symmetry group in doubt.

Z(\mathbb{C}[G])

, the center of the group algebra, where class functions form a commutative convolution algebra and irreducible characters are its spectral basis. The normalized character table of a non-abelian group can be obtained through a restriction operator, which means an efficient quantum character transform for any finite group with an efficient quantum Fourier transform. I give complementary quantum algorithms for class convolution based on direct class-sum block encoding and spectral implementation in the character basis, explaining their applications to symmetry-adapted many-body dynamics, molecular and spectroscopic symmetry analysis, and quantum walks, as well as characterizing the central information used in hidden-subgroup problems, including its limitations for graph isomorphism.