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:2512.12097 · The Journal of Chemical Physics

Symmetry Dilemmas in Quantum Computing for Chemistry: A Comprehensive Analysis

Ilias Magoulas, Muhan Zhang, Francesco A. Evangelista

quant-phphysics.chem-phSubmitted Dec 13, 2025• Announced Dec 16, 2025• 0 citations
arXivHTMLPDF

Abstract

Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits, gate-efficient universal operator pools generally break symmetries, and gate-efficient fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and are universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analysis provides a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.

Journal reference
J. Chem. Phys. 164, 144113 (2026)
DOI
10.1063/5.0316482

Related papers

Closed-form expressions for unitaries of spin-adapted fermionic operators

Ilias Magoulas, Francesco A. Evangelista

One of the open challenges in quantum computing simulations of problems of chemical interest is the proper enforcement of spin symmetry. Efficient quantum circuits implementing unitaries generated by spin-adapted operators remain elusive, while naïve Trotterization schemes break spin symmetry. In this work, we analyze the mathematical structure of spin-adapted operators and derive closed-form expressions for unitaries generated by singlet spin-adapted generalised single and double excitations. These results represent significant progress toward the economical enforcement of spin symmetry in quantum simulations.

arXiv:2505.02984•Molecular Physics•Aug 11, 2025•3 citations

Accurate and gate-efficient quantum Ansätze for electronic states without adaptive optimization

Hugh G. A. Burton

The ability of quantum computers to overcome the exponential memory scaling of many-body problems is expected to transform quantum chemistry. Quantum algorithms require accurate representations of electronic states on a quantum device, but current approximations struggle to combine chemical accuracy and gate efficiency while preserving physical symmetries, and rely on measurement-intensive adaptive methods that tailor the wave function to each molecule. In this contribution, we present a symmetry-preserving and gate-efficient that provides chemically accurate molecular energies with a well-defined circuit structure. Our approach exploits local qubit connectivity, orbital optimization, and connections with generalized valence bond theory to maximize the accuracy that is obtained with shallow quantum circuits. Numerical simulations for molecules with weak and strong electron correlation, including benzene, water, and the singlet-triplet gap in tetramethyleneethane, demonstrate that chemically accurate energies are achieved with as much as 84% fewer two-qubit gates compared to state-of-the-art adaptive techniques. Published by the American Physical Society 2024

arXiv:2312.09761•Physical Review Research•Jun 20, 2024•41 citations

Quantum algorithms for quantum chemistry

Daniel Marti-Dafcik

Computer simulation is central to understanding the behaviour of matter. Yet, more than a century after the development of quantum theory, first-principles simulation of chemistry remains a daunting challenge, owing to the exponential growth in memory required to represent interacting quantum particles such as electrons in molecules. Quantum computing offers, in principle, a fundamentally more efficient paradigm for simulating quantum systems, with quantum chemistry often cited as a flagship application. However, many quantum algorithms face intrinsic limitations, and any genuine quantum advantage must surpass the strong baseline set by decades of progress in classical algorithms and hardware. While classical methods often suffice for simulating weakly correlated systems, systems with many strongly correlated electrons remain a challenge for both classical and quantum approaches. In this thesis, we develop quantum algorithms for solving the time-independent Schrödinger equation, with a focus on molecular systems with strongly correlated electrons. We introduce a framework for identifying a compact set of states that parametrise the many-body wavefunction by capturing the correlation due to spin coupling between localised electrons. This representation requires very few variational parameters but incurs a very high memory cost on classical computers. To overcome this, we design quantum circuits that efficiently prepare such states by exploiting their symmetry, encoding the dominant entanglement structure of electronic wavefunctions into the initial qubit states. Through theoretical analysis and classical simulations of quantum computers, we show that this substantially reduces the quantum resources required to accurately compute ground- and excitedstate properties. Finally, we develop an approach for approximating the optimal ansatz within the variational quantum eigensolver, an algorithm designed for near-term quantum devices. Our method constructs wavefunctions from products of symmetrypreserving unitary operators and couples discrete and continuous optimisation to yield highly compact representations of strongly correlated electrons using shallow quantum circuits. Together, these results establish complementary directions for embedding problemspecific structure into quantum simulation algorithms, advancing the practical simulation of strongly correlated electrons.

•Jan 1, 2025•0 citations

Symmetry adaptation in quantum chemistry calculations on a quantum computer

Ilya G. Ryabinkin, Scott N. Genin

Quantum chemistry calculations on a quantum computer frequently suffer from symmetry breaking: the situation when a state of assumed spin and number of electrons is contaminated with contributions of undesired symmetry. The situation may even culminate in convergence to a state of completely unexpected symmetry, e.g. that of for a neutral species while a cation was expected. Previously, the constrained variational quantum eigensolver (CVQE) approach was proposed to alleviate this problem [Ryabinkin et al. (2018), J. Chem. Theory Comput. DOI:10.1021/acs.jctc.8b00943] here we analyze alternative, more robust solutions. In particular, we investigate how symmetry information can be incorporated directly into qubit Hamiltonians. We identify three essentially different techniques, the symmetry projection, spectral shift, and spectral reflection methods, which are all capable of solving the problem albeit at different computational cost, measured as the length of the resulting qubit operators. On the examples of LiH and H$_2$O molecules we show that the spectral shift method, which is equivalent to penalizing states of wrong symmetry, is the most efficient, followed by spectral reflection, and symmetry projection.

arXiv:1812.09812•Dec 24, 2018•14 citations

Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces

Andreas Stergiou, Nicolas PD Sawaya

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates are universal for state preparation in these subspaces. The key mechanism is Pauli $Z$ dressing: commutators of overlapping gates produce Pauli $Z$ operators on shared qubits, acting as spectator projectors that decompose multi-plane rotations into single-plane generators spanning the full $\mathfrak{so}(w)$ algebra, where $w$ is the dimension of the constrained subspace, thereby guaranteeing universality for real state preparation. Adding independent complex phases extends this to $\mathfrak{su}(w)$, enabling arbitrary complex state preparation. We provide a computationally efficient Jacobian criterion for verifying that a circuit can explore any direction on the target manifold from almost any parameter configuration. Our findings are applicable to many problem areas, including Fermi-Hubbard models, Bose-Hubbard models, and molecular electronic structure. We apply our framework to two physical settings: we prove the completeness of the binary encoded multi-level particles ansatz on the conserved-particle-number subspace, and we construct symmetry-preserving circuits for the fuzzy sphere regularisation of the 3D Ising conformal field theory (CFT). For the latter, we variationally prepare the ground and excited states and extract some CFT data.

quant-pharXiv:2605.00979•Journal of Quantum Science•May 5, 2026•3 citations

Unification of finite symmetries in the simulation of many-body systems on quantum computers

V. M. Bastidas, Nathan Fitzpatrick, K. J. Joven +5 more

Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.

arXiv:2411.05058•Physical Review A•May 16, 2025•4 citations
Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits, gate-efficient universal operator pools generally break symmetries, and gate-efficient fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and are universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analysis provides a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.
One of the open challenges in quantum computing simulations of problems of chemical interest is the proper enforcement of spin symmetry. Efficient quantum circuits implementing unitaries generated by spin-adapted operators remain elusive, while naïve Trotterization schemes break spin symmetry. In this work, we analyze the mathematical structure of spin-adapted operators and derive closed-form expressions for unitaries generated by singlet spin-adapted generalised single and double excitations. These results represent significant progress toward the economical enforcement of spin symmetry in quantum simulations.
The ability of quantum computers to overcome the exponential memory scaling of many-body problems is expected to transform quantum chemistry. Quantum algorithms require accurate representations of electronic states on a quantum device, but current approximations struggle to combine chemical accuracy and gate efficiency while preserving physical symmetries, and rely on measurement-intensive adaptive methods that tailor the wave function to each molecule. In this contribution, we present a symmetry-preserving and gate-efficient that provides chemically accurate molecular energies with a well-defined circuit structure. Our approach exploits local qubit connectivity, orbital optimization, and connections with generalized valence bond theory to maximize the accuracy that is obtained with shallow quantum circuits. Numerical simulations for molecules with weak and strong electron correlation, including benzene, water, and the singlet-triplet gap in tetramethyleneethane, demonstrate that chemically accurate energies are achieved with as much as 84% fewer two-qubit gates compared to state-of-the-art adaptive techniques. Published by the American Physical Society 2024
Computer simulation is central to understanding the behaviour of matter. Yet, more than a century after the development of quantum theory, first-principles simulation of chemistry remains a daunting challenge, owing to the exponential growth in memory required to represent interacting quantum particles such as electrons in molecules. Quantum computing offers, in principle, a fundamentally more efficient paradigm for simulating quantum systems, with quantum chemistry often cited as a flagship application. However, many quantum algorithms face intrinsic limitations, and any genuine quantum advantage must surpass the strong baseline set by decades of progress in classical algorithms and hardware. While classical methods often suffice for simulating weakly correlated systems, systems with many strongly correlated electrons remain a challenge for both classical and quantum approaches. In this thesis, we develop quantum algorithms for solving the time-independent Schrödinger equation, with a focus on molecular systems with strongly correlated electrons. We introduce a framework for identifying a compact set of states that parametrise the many-body wavefunction by capturing the correlation due to spin coupling between localised electrons. This representation requires very few variational parameters but incurs a very high memory cost on classical computers. To overcome this, we design quantum circuits that efficiently prepare such states by exploiting their symmetry, encoding the dominant entanglement structure of electronic wavefunctions into the initial qubit states. Through theoretical analysis and classical simulations of quantum computers, we show that this substantially reduces the quantum resources required to accurately compute ground- and excitedstate properties. Finally, we develop an approach for approximating the optimal ansatz within the variational quantum eigensolver, an algorithm designed for near-term quantum devices. Our method constructs wavefunctions from products of symmetrypreserving unitary operators and couples discrete and continuous optimisation to yield highly compact representations of strongly correlated electrons using shallow quantum circuits. Together, these results establish complementary directions for embedding problemspecific structure into quantum simulation algorithms, advancing the practical simulation of strongly correlated electrons.
Quantum chemistry calculations on a quantum computer frequently suffer from symmetry breaking: the situation when a state of assumed spin and number of electrons is contaminated with contributions of undesired symmetry. The situation may even culminate in convergence to a state of completely unexpected symmetry, e.g. that of for a neutral species while a cation was expected. Previously, the constrained variational quantum eigensolver (CVQE) approach was proposed to alleviate this problem [Ryabinkin et al. (2018), J. Chem. Theory Comput. DOI:10.1021/acs.jctc.8b00943] here we analyze alternative, more robust solutions. In particular, we investigate how symmetry information can be incorporated directly into qubit Hamiltonians. We identify three essentially different techniques, the symmetry projection, spectral shift, and spectral reflection methods, which are all capable of solving the problem albeit at different computational cost, measured as the length of the resulting qubit operators. On the examples of LiH and H2_22​O molecules we show that the spectral shift method, which is equivalent to penalizing states of wrong symmetry, is the most efficient, followed by spectral reflection, and symmetry projection.
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates are universal for state preparation in these subspaces. The key mechanism is Pauli ZZZ dressing: commutators of overlapping gates produce Pauli ZZZ operators on shared qubits, acting as spectator projectors that decompose multi-plane rotations into single-plane generators spanning the full so(w)\mathfrak{so}(w)so(w) algebra, where www is the dimension of the constrained subspace, thereby guaranteeing universality for real state preparation. Adding independent complex phases extends this to su(w)\mathfrak{su}(w)su(w), enabling arbitrary complex state preparation. We provide a computationally efficient Jacobian criterion for verifying that a circuit can explore any direction on the target manifold from almost any parameter configuration. Our findings are applicable to many problem areas, including Fermi-Hubbard models, Bose-Hubbard models, and molecular electronic structure. We apply our framework to two physical settings: we prove the completeness of the binary encoded multi-level particles ansatz on the conserved-particle-number subspace, and we construct symmetry-preserving circuits for the fuzzy sphere regularisation of the 3D Ising conformal field theory (CFT). For the latter, we variationally prepare the ground and excited states and extract some CFT data.
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.