Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the global SU(2) spin symmetry, remains a major challenge. In fact, expressing total-spin eigenstates in terms of the computational basis can require an exponentially large number of coefficients. In this work, we introduce a novel formalism for designing quantum algorithms directly in an eigenbasis of the total-spin operator. Our strategy relies on the symmetric group approach in conjunction with a truncation scheme for the internal degrees of freedom of total-spin eigenstates. For the case of the antiferromagnetic Heisenberg model, we show that this formalism yields a hierarchy of spin-adapted Hamiltonians, for each truncation threshold, whose ground-state energy and wave function quickly converge to their exact counterparts, calculated on the full model. These truncated Hamiltonians can be encoded with sparse and local qubit Hamiltonians that are suitable for quantum simulations. We demonstrate this by developing a state-preparation schedule to construct shallow quantum-circuit approximations, expressed in a total-spin eigenbasis, for the ground states of the Heisenberg Hamiltonian in different symmetry sectors.
Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the global SU(2) spin symmetry, remains a major challenge. In fact, expressing total-spin eigenstates in terms of the computational basis can require an exponentially large number of coefficients. In this work, we introduce a novel formalism for designing quantum algorithms directly in an eigenbasis of the total-spin operator. Our strategy relies on the symmetric group approach in conjunction with a truncation scheme for the internal degrees of freedom of total-spin eigenstates. For the case of the antiferromagnetic Heisenberg model, we show that this formalism yields a hierarchy of spin-adapted Hamiltonians, for each truncation threshold, whose ground-state energy and wave function quickly converge to their exact counterparts, calculated on the full model. These truncated Hamiltonians can be encoded with sparse and local qubit Hamiltonians that are suitable for quantum simulations. We demonstrate this by developing a state-preparation schedule to construct shallow quantum-circuit approximations, expressed in a total-spin eigenbasis, for the ground states of the Heisenberg Hamiltonian in different symmetry sectors.
The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.
We propose applying the adiabatic algorithm to prepare high-energy eigenstates of integrable models on a quantum computer. We first review the standard adiabatic algorithm to prepare ground states in each magnetization sector of the prototypical XXZ Heisenberg chain. Based on the thermodynamic Bethe ansatz, we show that the algorithm circuit depth is polynomial in the number of qubits N , outperforming previous methods explicitly relying on integrability. Next, we propose a protocol to prepare arbitrary eigenstates of integrable models that satisfy certain conditions. For a given target eigenstate, we construct a suitable parent Hamiltonian written in terms of a complete set of local conserved quantities. We propose using such Hamiltonian as an input for an adiabatic algorithm. After benchmarking this construction in the case of the non-interacting XY spin chain, where we can rigorously prove its efficiency, we apply it to prepare arbitrary eigenstates of the Richardson-Gaudin models. In this case, we provide numerical evidence that the circuit depth of our algorithm is polynomial in N for all eigenstates, despite the models being interacting.
Preserving spin symmetry in variational quantum algorithms is essential for producing physically meaningful electronic wavefunctions. Implementing spin-adapted transformations on quantum hardware, however, is challenging because the corresponding fermionic generators translate into noncommuting Pauli operators. In this work, we introduce an exact and computationally efficient factorization of spin-adapted unitaries derived from fermionic double excitation and deexcitation rotations. These unitaries are expressed as ordered products of exponentials of Pauli operators. Our method exploits the fact that the elementary operators in these generators form small Lie algebras. By working in the adjoint representation of these algebras, we reformulate the factorization problem as a low-dimensional nonlinear optimization over matrix exponentials. This approach enables precise numerical reparametrization of the unitaries without relying on symbolic manipulations. The proposed factorization provides a practical strategy for constructing symmetry-conserving quantum circuits within variational algorithms. It preserves spin symmetry by design, reduces implementation cost, and ensures the accurate representation of electronic states in quantum simulations of molecular systems.
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.
We provide a spin-adapted formulation of the Full Configuration Interaction Quantum Monte Carlo (FCIQMC) algorithm, based on the Graphical Unitary Group Approach (GUGA), which enables the exploitation of SU(2) symmetry within this stochastic framework. Random excitation generation and matrix element calculation on the Shavitt graph of GUGA can be efficiently implemented via a biasing procedure on the branching diagram. The use of a spin-pure basis explicitly resolves the different spin-sectors and ensures that the stochastically sampled wavefunction is an eigenfunction of the total spin operator S^2. The method allows for the calculation of states with low or intermediate spin in systems dominated by Hund’s first rule, which are otherwise generally inaccessible. Furthermore, in systems with small spin gaps, the new methodology enables much more rapid convergence with respect to walker number and simulation time. Some illustrative applications of the GUGA-FCIQMC method are provided: computation of the 2F − 4F spin gap of the cobalt atom in large basis sets, achieving chemical accuracy to experiment, and the Σg+1, Σg+3, Σg+5, and Σg+7 spin-gaps of the stretched N2 molecule, an archetypal strongly correlated system.
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 8∥H∥(1−αDT)1/2, where αDT is the probability weight captured by the DT 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.