Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.03452 · New Journal of Physics

Revealing symmetries in quantum computing for many-body systems

Robert van Leeuwen

Published Oct 1, 2024• 3 citations
arXivHTMLPDF

Abstract

Abstract We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan–Wigner form in which they can act on multi-qubit states. Symmetries, such as point-group symmetries in molecules, are apparent in the standard second quantized form of the Hamiltonian. They are, however, masked when the Hamiltonian is translated into a Pauli matrix representation required for its operation on qubits. To reveal these symmetries we prove a general theorem that provides a straightforward method to calculate the transformation of Pauli tensor strings under symmetry operations. They are a subgroup of the Clifford group transformations and induce a corresponding group representation inside the symplectic matrices. We finally give a simplified derivation of an affine qubit encoding scheme which allows for the removal of qubits due to Boolean symmetries and thus reduces effort in quantum computations for many-body systems.

DOI
10.1088/1367-2630/ad8677

Related papers

Reducing Qubit Requirements for Quantum Simulations Using Molecular Point Group Symmetries

Kanav Setia, Richard Chen, Julia E. Rice +3 more

Simulating molecules is believed to be one of the early stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence; therefore, optimizing resources to execute quantum algorithms is crucial. In this work, we develop the second quantization representation of spatial symmetries, which are then transformed to their qubit operator representation. These qubit operator representations are used to reduce the number of qubits required for simulating molecules. We present our results for various molecules and elucidate a formal connection of this work with a previous technique that analyzed generic Z 2 Pauli symmetries.

arXiv:1910.14644•Journal of Chemical Theory and Computation•Aug 24, 2020•134 citations

From Pauli Strings to Quantum Dynamics: A Unified Characterization

Roberto Gargiulo, Paul Herringer, Robert Zeier

Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

quant-pharXiv:2606.09773•Jun 9, 2026•7 citations

Symmetry-adapted encodings for qubit number reduction by point-group and other Boolean symmetries

Dario Picozzi, Jonathan Tennyson

Abstract A symmetry-adapted fermion-to-spin mapping or encoding that is able to store information about the occupancy of the n spin-orbitals of a molecular system into a lower number of n − k qubits in a quantum computer (where the number of reduced qubits k ranges from 2 to 5 depending on the symmetry of the system) is introduced. This mapping reduces the computational cost of a quantum computing simulation and at the same time enforces symmetry constraints. These symmetry-adapted encodings (SAEs) can be explicitly seen as a block-diagonalization of the Jordan–Wigner qubit Hamiltonian, followed by an orthogonal projection. We provide the form of the Clifford tableau for a general class of fermion-to-qubit encodings, and then use it to construct the map that block-diagonalizes the Hamiltonian in the SAEs. The algorithm proposed does not require any further computations to obtain this map, which is derived directly from the character table of the molecular point group. An implementation of the algorithm is presented as an open-source Python package, QuantumSymmetry, a user guide and code examples. QuantumSymmetry uses open-source quantum chemistry software PySCF for Hartree–Fock calculations, and is compatible with quantum computing toolsets OpenFermion and Qiskit. QuantumSymmetry takes arbitrary user input such as the molecular geometry and atomic basis set to construct the qubit operators that correspond in the appropriate SAE to fermionic operators on the molecular system, such as the second-quantized electronic structure Hamiltonian. QuantumSymmetry is used to produce numerical examples of variational quantum algorithm simulations to find the ground state energy for a number of example molecules, for both Unitary Coupled Clusters with Singles and Doubles and Adaptive Derivative Assembled Pseudo-Trotter Variational Quantum Eigensolver ansätze. We show that, beyond the advantage given by the lower qubit count, the proposed encodings consistently result in shallower and less complex circuits with a reduced number of variational parameters that are able to reach convergence faster and without any loss of computed accuracy.

Quantum Science and Technology•May 24, 2023•10 citations

Hidden rotation symmetry of the Jordan-Wigner transformation and its application to measurement in quantum computation

Grant Davis, James K. Freericks

Using a global rotation by theta about the z-axis in the spin sector of the Jordan-Wigner transformation rotates Pauli matrices X and Y in the x-y-plane, while it adds a global complex phase to fermionic quantum states that have a fixed number of particles. With the right choice of angles, this relates expectation values of Pauli strings containing products of X and Y to different products, which can be employed to reduce the number of measurements needed when simulating fermionic systems on a quantum computer. Here, we derive this symmetry and show how it can be applied to systems in Physics and Chemistry that involve Hamiltonians with only single-particle (hopping) and two-particle (interaction) terms. We also discuss the consequences of this for finding efficient measurement circuits in variational ground state preparation.

quant-pharXiv:2512.24589•Symmetry•Jan 1, 2026•1 citation

Wigner’s theorem for stabilizer states and quantum designs

Valentin Obst, Arne Heimendahl, Tanmay Singal +1 more

We describe the symmetry group of the stabilizer polytope for any number n of systems and any prime local dimension d. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. In the case of qudits, the structure is somewhat richer: For n = 1, it is a wreath product of permutations of bases and permutations of the elements within each basis. For n > 1, the symmetries are given by affine symplectic similitudes. These are the affine maps that preserve the symplectic form of the underlying discrete phase space up to a non-zero multiplier. We phrase these results with respect to a number of a priori different notions of “symmetry,” including Kadison symmetries (bijections that are compatible with convex combinations), Wigner symmetries (bijections that preserve inner products), and symmetries realized by an action on Hilbert space. Going beyond stabilizer states, we extend an observation of Heinrich and Gross [Quantum 3, 132 (2019)] and show that the symmetries of fairly general sets of Hermitian operators are constrained by certain moments. In particular: the symmetries of a set that behaves like a 3-design preserve Jordan products and are therefore realized by conjugation with unitaries or anti-unitaries. (The structure constants of the Jordan algebra are encoded in an order-three tensor, which we connect to the third moments of a design). This generalizes Kadison’s formulation of the classic Wigner theorem on quantum mechanical symmetries.

arXiv:2405.17565•Journal of Mathematical Physics•Nov 1, 2024•7 citations

Clifford symmetries in quantum many-body systems

Charlie Nation, Rick P. A. Simon, Shreya Banerjee +4 more

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result of insightful thinking. In this work, we complement human ingenuity with an algorithm. We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation. We demonstrate our method on random and physical Hamiltonians, with instances of up to one thousand qubits and demonstrate how our approach can provide deeper understanding of the model.

quant-pharXiv:2605.18966•May 20, 2026•3 citations
Abstract We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan–Wigner form in which they can act on multi-qubit states. Symmetries, such as point-group symmetries in molecules, are apparent in the standard second quantized form of the Hamiltonian. They are, however, masked when the Hamiltonian is translated into a Pauli matrix representation required for its operation on qubits. To reveal these symmetries we prove a general theorem that provides a straightforward method to calculate the transformation of Pauli tensor strings under symmetry operations. They are a subgroup of the Clifford group transformations and induce a corresponding group representation inside the symplectic matrices. We finally give a simplified derivation of an affine qubit encoding scheme which allows for the removal of qubits due to Boolean symmetries and thus reduces effort in quantum computations for many-body systems.
Simulating molecules is believed to be one of the early stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence; therefore, optimizing resources to execute quantum algorithms is crucial. In this work, we develop the second quantization representation of spatial symmetries, which are then transformed to their qubit operator representation. These qubit operator representations are used to reduce the number of qubits required for simulating molecules. We present our results for various molecules and elucidate a formal connection of this work with a previous technique that analyzed generic Z 2 Pauli symmetries.
Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.
Abstract A symmetry-adapted fermion-to-spin mapping or encoding that is able to store information about the occupancy of the n spin-orbitals of a molecular system into a lower number of n − k qubits in a quantum computer (where the number of reduced qubits k ranges from 2 to 5 depending on the symmetry of the system) is introduced. This mapping reduces the computational cost of a quantum computing simulation and at the same time enforces symmetry constraints. These symmetry-adapted encodings (SAEs) can be explicitly seen as a block-diagonalization of the Jordan–Wigner qubit Hamiltonian, followed by an orthogonal projection. We provide the form of the Clifford tableau for a general class of fermion-to-qubit encodings, and then use it to construct the map that block-diagonalizes the Hamiltonian in the SAEs. The algorithm proposed does not require any further computations to obtain this map, which is derived directly from the character table of the molecular point group. An implementation of the algorithm is presented as an open-source Python package, QuantumSymmetry, a user guide and code examples. QuantumSymmetry uses open-source quantum chemistry software PySCF for Hartree–Fock calculations, and is compatible with quantum computing toolsets OpenFermion and Qiskit. QuantumSymmetry takes arbitrary user input such as the molecular geometry and atomic basis set to construct the qubit operators that correspond in the appropriate SAE to fermionic operators on the molecular system, such as the second-quantized electronic structure Hamiltonian. QuantumSymmetry is used to produce numerical examples of variational quantum algorithm simulations to find the ground state energy for a number of example molecules, for both Unitary Coupled Clusters with Singles and Doubles and Adaptive Derivative Assembled Pseudo-Trotter Variational Quantum Eigensolver ansätze. We show that, beyond the advantage given by the lower qubit count, the proposed encodings consistently result in shallower and less complex circuits with a reduced number of variational parameters that are able to reach convergence faster and without any loss of computed accuracy.
Using a global rotation by theta about the z-axis in the spin sector of the Jordan-Wigner transformation rotates Pauli matrices X and Y in the x-y-plane, while it adds a global complex phase to fermionic quantum states that have a fixed number of particles. With the right choice of angles, this relates expectation values of Pauli strings containing products of X and Y to different products, which can be employed to reduce the number of measurements needed when simulating fermionic systems on a quantum computer. Here, we derive this symmetry and show how it can be applied to systems in Physics and Chemistry that involve Hamiltonians with only single-particle (hopping) and two-particle (interaction) terms. We also discuss the consequences of this for finding efficient measurement circuits in variational ground state preparation.
We describe the symmetry group of the stabilizer polytope for any number n of systems and any prime local dimension d. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. In the case of qudits, the structure is somewhat richer: For n = 1, it is a wreath product of permutations of bases and permutations of the elements within each basis. For n > 1, the symmetries are given by affine symplectic similitudes. These are the affine maps that preserve the symplectic form of the underlying discrete phase space up to a non-zero multiplier. We phrase these results with respect to a number of a priori different notions of “symmetry,” including Kadison symmetries (bijections that are compatible with convex combinations), Wigner symmetries (bijections that preserve inner products), and symmetries realized by an action on Hilbert space. Going beyond stabilizer states, we extend an observation of Heinrich and Gross [Quantum 3, 132 (2019)] and show that the symmetries of fairly general sets of Hermitian operators are constrained by certain moments. In particular: the symmetries of a set that behaves like a 3-design preserve Jordan products and are therefore realized by conjugation with unitaries or anti-unitaries. (The structure constants of the Jordan algebra are encoded in an order-three tensor, which we connect to the third moments of a design). This generalizes Kadison’s formulation of the classic Wigner theorem on quantum mechanical symmetries.
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result of insightful thinking. In this work, we complement human ingenuity with an algorithm. We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation. We demonstrate our method on random and physical Hamiltonians, with instances of up to one thousand qubits and demonstrate how our approach can provide deeper understanding of the model.