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:2404.18878 · Physical Review Research

Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers

Daniel Marti-Dafcik, Hugh G. A. Burton, David P. Tew

Published Feb 24, 2025• 20 citations
arXivHTMLPDF

Abstract

The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.

DOI
10.1103/physrevresearch.7.013191

Related papers

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

Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm

Bryan Gard, Linghua Zhu, George S. Barron +3 more

Abstract The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to prepare multi-qubit trial states on the quantum processor that either include, or at least closely approximate, the actual energy eigenstates of the problem being simulated while avoiding states that have little overlap with them. Symmetries play a central role in determining the best trial states. Here, we present efficient state preparation circuits that respect particle number, total spin, spin projection, and time-reversal symmetries. These circuits contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace dictated by the chemistry problem while avoiding all irrelevant sectors of Hilbert space. We show how to construct these circuits for arbitrary numbers of orbitals, electrons, and spin quantum numbers, and we provide explicit decompositions and gate counts in terms of standard gate sets in each case. We test our circuits in quantum simulations of the $${H}_{2}$$ H 2 and $$LiH$$ L i H molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.

arXiv:1904.10910•npj Quantum Information•Jan 28, 2020•294 citations

Quantum algorithm for weakly correlated molecular electronic ground states with sub-quintic scaling in the system size

Oskar Leimkuhler, Marvin Kronenberger, Davide Castaldo +8 more

Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity $O(n^7)$ in the number of molecular orbitals and with no guarantee of energy error $\varepsilon$ at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as $\tilde{O}(n^{4.8}/\varepsilon^2)$ in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or $\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)$ when scaling the simulation time $T\propto 1/\varepsilon$. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for $\varepsilon$-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.

quant-pharXiv:2611.00751•Nov 3, 2026•0 citations

Algebraic Tools for Quantum Simulations of Electronic Structure

Smik Patel

Accurately predicting the properties of molecules and materials from first principles requires solving the electronic structure problem. However, the computational cost of solving the electronic structure problem scales prohibitively in the number of atoms, and the usual approximate methods designed to reduce the overhead are often inaccurate for strongly correlated systems. For this reason, quantum algorithms have been developed as a promising alternative. In this work, we develop algebraic tools to improve the efficiency of three quantum algorithms for the electronic structure problem, addressing key bottlenecks for both near-term and fault-tolerant quantum computers. The first is the variational quantum eigensolver (VQE), which suffers from a large measurement overhead needed to estimate the Hamiltonian expectation value. To this end, we introduce a general class of measurable fragments of the electronic Hamiltonian, which enable partitioning schemes that significantly reduce the sampling cost for energy estimation. The second are quantum subspace methods (QSMs). We introduce a new QSM, the quantum seniority-based subspace expansion algorithm, which is a scalable alternative to VQE that alleviates VQE's state preparation, measurement, and optimization challenges while reducing qubit requirements. The third is quantum phase estimation (QPE), which requires an encoding of the electronic Hamiltonian directly on the quantum computer, the cost of which scales indirectly with the Hamiltonian spectral range. To address this, we develop linear programming approaches to implement the Block Invariant Symmetry Shift protocol, a method which reduces the spectral range of the Hamiltonian, improving its block-encoding cost for QPE. Collectively, these methods demonstrate that one can exploit the Hamiltonian's algebraic structure to mitigate computational costs, accelerating the path toward practical quantum advantage for electronic structure.

•Mar 1, 2026•0 citations

Solving strongly correlated electron models on a quantum computer

Dave Wecker, Matthew B. Hastings, Nathan Wiebe +3 more

One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine the ground state phase diagram of a quantum model and the properties of its phases is more involved. Using the Hubbard model as a prototypical example, we here show all the steps necessary to determine its phase diagram and ground state properties on a quantum computer. In particular, we discuss strategies for efficiently determining and preparing the ground state of the Hubbard model starting from various mean-field states with broken symmetry. We present an efficient procedure to prepare arbitrary Slater determinants as initial states and present the complete set of quantum circuits needed to evolve from these to the ground state of the Hubbard model. We show that, using efficient nesting of the various terms each time step in the evolution can be performed with just $\mathcal{O}(N)$ gates and $\mathcal{O}(\log N)$ circuit depth. We give explicit circuits to measure arbitrary local observables and static and dynamic correlation functions, both in the time and frequency domain. We further present efficient non-destructive approaches to measurement that avoid the need to re-prepare the ground state after each measurement and that quadratically reduce the measurement error.

arXiv:1506.05135•Physical Review A•Dec 10, 2015•310 citations

Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers

Anutosh Biswas, Sayan Ghosh, Ritajit Majumdar +3 more

We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing $U(1)$ spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by $\sqrt{8}\,\|H\|\left(1-\sqrt{α_{D_T}}\right)^{1/2}$, where $α_{D_T}$ is the probability weight captured by the $D_T$ sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-$1/2$ Heisenberg XXZ chain (up to $N=62$ qubits on the IBM Heron processor), the algorithm achieves a $3.5\%$ energy error in the gapped Neel phase ($Δ=2.0$) and below $0.5\%$ at the ferromagnetic boundary ($Δ=-1.0$). The accuracy degrades to $28.7\%$ in the strongly quasi-long-range-ordered regime ($Δ=0.5$). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.

cond-mat.str-elCross-listedarXiv:2512.12753•Dec 16, 2025•0 citations
The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
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.
Abstract The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to prepare multi-qubit trial states on the quantum processor that either include, or at least closely approximate, the actual energy eigenstates of the problem being simulated while avoiding states that have little overlap with them. Symmetries play a central role in determining the best trial states. Here, we present efficient state preparation circuits that respect particle number, total spin, spin projection, and time-reversal symmetries. These circuits contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace dictated by the chemistry problem while avoiding all irrelevant sectors of Hilbert space. We show how to construct these circuits for arbitrary numbers of orbitals, electrons, and spin quantum numbers, and we provide explicit decompositions and gate counts in terms of standard gate sets in each case. We test our circuits in quantum simulations of the H2{H}_{2}H2​ H 2 and LiHLiHLiH L i H molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.
Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity O(n7)O(n^7)O(n7) in the number of molecular orbitals and with no guarantee of energy error ε\varepsilonε at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as O~(n4.8/ε2)\tilde{O}(n^{4.8}/\varepsilon^2)O~(n4.8/ε2) in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or O~(n4.8+n3.8/ε)\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)O~(n4.8+n3.8/ε) when scaling the simulation time T∝1/εT\propto 1/\varepsilonT∝1/ε. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for ε\varepsilonε-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.
Accurately predicting the properties of molecules and materials from first principles requires solving the electronic structure problem. However, the computational cost of solving the electronic structure problem scales prohibitively in the number of atoms, and the usual approximate methods designed to reduce the overhead are often inaccurate for strongly correlated systems. For this reason, quantum algorithms have been developed as a promising alternative. In this work, we develop algebraic tools to improve the efficiency of three quantum algorithms for the electronic structure problem, addressing key bottlenecks for both near-term and fault-tolerant quantum computers. The first is the variational quantum eigensolver (VQE), which suffers from a large measurement overhead needed to estimate the Hamiltonian expectation value. To this end, we introduce a general class of measurable fragments of the electronic Hamiltonian, which enable partitioning schemes that significantly reduce the sampling cost for energy estimation. The second are quantum subspace methods (QSMs). We introduce a new QSM, the quantum seniority-based subspace expansion algorithm, which is a scalable alternative to VQE that alleviates VQE's state preparation, measurement, and optimization challenges while reducing qubit requirements. The third is quantum phase estimation (QPE), which requires an encoding of the electronic Hamiltonian directly on the quantum computer, the cost of which scales indirectly with the Hamiltonian spectral range. To address this, we develop linear programming approaches to implement the Block Invariant Symmetry Shift protocol, a method which reduces the spectral range of the Hamiltonian, improving its block-encoding cost for QPE. Collectively, these methods demonstrate that one can exploit the Hamiltonian's algebraic structure to mitigate computational costs, accelerating the path toward practical quantum advantage for electronic structure.
One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine the ground state phase diagram of a quantum model and the properties of its phases is more involved. Using the Hubbard model as a prototypical example, we here show all the steps necessary to determine its phase diagram and ground state properties on a quantum computer. In particular, we discuss strategies for efficiently determining and preparing the ground state of the Hubbard model starting from various mean-field states with broken symmetry. We present an efficient procedure to prepare arbitrary Slater determinants as initial states and present the complete set of quantum circuits needed to evolve from these to the ground state of the Hubbard model. We show that, using efficient nesting of the various terms each time step in the evolution can be performed with just O(N)\mathcal{O}(N)O(N) gates and O(log⁡N)\mathcal{O}(\log N)O(logN) circuit depth. We give explicit circuits to measure arbitrary local observables and static and dynamic correlation functions, both in the time and frequency domain. We further present efficient non-destructive approaches to measurement that avoid the need to re-prepare the ground state after each measurement and that quadratically reduce the measurement error.
We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing U(1)U(1)U(1) spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by 8 ∥H∥(1−αDT)1/2\sqrt{8}\,\|H\|\left(1-\sqrt{α_{D_T}}\right)^{1/2}8​∥H∥(1−αDT​​​)1/2, where αDTα_{D_T}αDT​​ is the probability weight captured by the DTD_TDT​ sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-1/21/21/2 Heisenberg XXZ chain (up to N=62N=62N=62 qubits on the IBM Heron processor), the algorithm achieves a 3.5%3.5\%3.5% energy error in the gapped Neel phase (Δ=2.0Δ=2.0Δ=2.0) and below 0.5%0.5\%0.5% at the ferromagnetic boundary (Δ=−1.0Δ=-1.0Δ=−1.0). The accuracy degrades to 28.7%28.7\%28.7% in the strongly quasi-long-range-ordered regime (Δ=0.5Δ=0.5Δ=0.5). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.