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:2611.05865

Symmetry-guided algorithms for variational quantum optimization

Eunjin In, Kristina D. Launey, Darin C. Mumma, James A. Sauls

Published Nov 4, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum numbers associated with symmetries classify quantum states and identify the sectors relevant to a given simulation. Generic hardware-efficient ansatzes do not necessarily preserve the quantum numbers and may therefore explore states outside the target sector. We develop symmetry-guided algorithms based on the quantum-accessible Hilbert-Schmidt asymmetry $\mathrm{A}_\mathrm{HS}$, which quantifies the deviation of a quantum state from invariance under a specified symmetry group. This quantity guides the optimization toward a highly reduced symmetry-based target sector, without enforcing the symmetry on the preparation circuit. We demonstrate the approach as a proof of principle in variational quantum eigensolver calculations targeting singlet ground states with collective SU(2) symmetry. The applications include a five-qubit $S$-wave $p+{}^3\mathrm{He}$ two-cluster Hamiltonian, deduced from $\textit{ab initio}$ many-body calculations, and collective spin models with up to 12 particles, which provide a many-particle benchmark of asymmetry-guided optimization. Across these applications, $\mathrm{A}_\mathrm{HS}$-based guidance increases the singlet probability. Overall, the proposed algorithms improve energy accuracy during optimization and ground-state fidelity compared with direct energy minimization, with substantial fidelity improvements in the larger spin systems. These results demonstrate the utility of an asymmetry objective determined by the group action, independently of the Hamiltonian energy, for improving the reliability of variational quantum optimization.

DOI
10.48550/arxiv.2611.05865

Related papers

Using Symmetries for Near-Term Quantum Computing

Eckstein, Timo

Our works [1–7] focus on algorithm development for current and near-term quantum computing platforms. Symmetries, which are mathematically described by groups, divide the full space of possibilities, the Hilbert space, into smaller sectors. If a symmetry is conserved within an application, then one of these smaller symmetry sectors will be sufficient to model it. Therefore, our works incorporate symmetries like translational invariance [1, 2, 5, 7], time-periodicity [3, 4] or electron number conservation [6] to improve algorithms for relevant system classes compared to symmetry-unaware standard methods. In the first direction, we utilise symmetries for Hamiltonian simulation, where one aims to approximate the time evolution of a reproduced quantum system of interest on a quantum computer and predict the time-dependent properties of the system, such as correlations. Concretely, we improve Hamiltonian simulation algorithms for time-periodic systems by taking advantage of high-frequency expansions in works [3, 4]. In Ref. [5], we reduce the approximation error of product formulas by classical variational optimisation, and translational symmetry to scale up the system size n. The second direction is state preparation, where one targets the recreation of a quantum state, typically a ground state, and the prediction of its properties that are too difficult to compute classically. In Ref. [6], we take advantage of the electron number conservation of fermionic systems for a symmetry-aware circuit ansatz and self-consistent configuration recovery. Paired with warm-starting and classical subsystem diagonalisation, it allows us to estimate the Fe(III)-NTA ground state energy within chemical accuracy via samples obtained from an ion-trap quantum computer. The third direction is to use symmetry for the reduction of statistical uncertainty of quantum estimators, which are computed from measured bitstring values at the end of a quantum computation. Concretely, in Refs. [1, 2], we improve the sampling complexity for energy estimation of quantum lattice systems, which can be mapped efficiently to current quantum hardware. Our approach leverages translational invariance to construct more sample-efficient estimators, where their minimal improvement compared to local Pauli bases is guaranteed by an analytical lower bound. Further in Refs. [3, 4], we take advantage of the translational invariance of both the quantum state and observable to boost the number of observed bitstring values per ion trap hardware sample by the number of qubits. [1] T. Eckstein, R. Mansuroglu, S. Wolf, L. Nützel, S. Tasler, M. Kliesch, and M. J. Hartmann, in Quantum Computing Theory in Practice 2025 (Freie Universität Berlin, 2025). [2] T. Eckstein, R. Mansuroglu, S. Wolf, L. Nützel, S. Tasler, M. Kliesch, and M. J. Hartmann, arXiv preprint arXiv:2410.21251 10.48550/arXiv.2410.21251 (2024). [3] T. Eckstein, R. Mansuroglu, P. Czarnik, J.-X. Zhu, M. J. Hartmann, L. Cincio, A. T. Sornborger, and Z. Holmes, in Quantum Computing Theory in Practice 2024 (University of Edinburgh, 2024). [4] T. Eckstein, R. Mansuroglu, P. Czarnik, J.-X. Zhu, M. J. Hartmann, L. Cincio, A. T. Sornborger, and Z. Holmes, npj Quantum Information 10, 84 (2024). [5] R. Mansuroglu, T. Eckstein, L. N¨utzel, S. A. Wilkinson, and M. J. Hartmann, Quantum Science and Technology 8, 025006 (2023). [6] L. Nützel, A. Gresch, L. Hehn, L. Marti, R. Freund, A. Steiner, C. D. Marciniak, T. Eckstein, N. Stockinger, S. Wolf, et al., Quantum Science and Technology 10, 015066 (2025). [7] S. Tasler, J. Old, L. Heunisch, V. Feulner, T. Eckstein, M. Müller, and M. J. Hartmann, arXiv preprint arXiv:2506.09028 10.48550/arXiv.2506.09028 (2025).

•Jan 1, 2025•0 citations

Determination of molecular excited states via symmetry guided subspace search variational quantum eigensolver

Dibyendu Mondal, Rahul Maitra

computations of the ground and excited electronic states. While substantial progress has been made in designing physically informed quantum algorithms to address the ground state under the constraints of near-term quantum hardware, relatively fewer developments exist for reliably computing excited state energetics, presumably due to the growing complexity of the quantum circuits for excited eigenroots. In this work, we exploit the inherent point-group and spin symmetries of molecular systems to construct symmetry-adapted sets of orthogonal reference states which are evolved with a common symmetry-scalar unitary, enabling the simultaneous determination of ground and excited eigenroots. By minimizing the energy functional over a restricted symmetry-adapted correlated manifold, the weighted subspace-search variational quantum eigensolver enables us to directly target multiple eigenroots within each spatial and spin symmetry sector. This physically motivated selection of references and the unitary confer substantial flexibility to the weighted energy landscape, largely allowing the optimization to avoid numerical traps and converge directly to the targeted eigenstates. More crucially, symmetry resolution also enables access to a larger number of eigenstates without substantially increasing the complexity of the cost function. Through benchmarking on moderate to strongly correlated molecular systems, we demonstrate the accuracy and advantages of our approach relative to several established excited state algorithms on quantum computers.

Physical Chemistry Chemical Physics•Jan 1, 2026•1 citation

Variational simulation of higher-spin systems on qubit-based quantum simulators

Chufan Lyu, Zuoheng Zou, Xusheng Xu +2 more

Qubit-based quantum simulators naturally target two-level systems, whereas many quantum many-body problems are intrinsically d level. Encodings from qudits to qubits then enlarge the Hilbert space and can introduce unphysical states that interfere with variational optimization. We formulate a variational framework for encoded d -level models that suppresses these illegitimate states with penalty terms and benchmark it for spin-1 and spin-3/2 bilinear-biquadratic Heisenberg chains. We compare binary encoding, which minimizes the qubit overhead, with symmetry encoding, which preserves the relevant spin symmetries and enables symmetry-conserving ansätze. Although binary encoding is more qubit efficient, its hardware-efficient ansatz is harder to train and less effective at exploiting conserved quantities. In contrast, symmetry encoding requires more qubits but reaches substantially higher fidelities, converges faster, and exhibits better trainability than the binary hardware-efficient ansatz. These results identify symmetry-preserving encodings as a practical route to simulating higher-spin models on existing qubit platforms.

arXiv:2405.05051•Physical Review Research•Jun 29, 2026•3 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

Efficient quantum information-inspired ansatz for variational quantum eigensolver algorithm: Applications to atomic systems

Abdul Kalam, Prasenjit Deb, Akitada Sakurai +3 more

We present a quantum information-inspired ansatz for the variational quantum eigensolver and demonstrate its efficacy in calculating ground-state energies of atomic systems. Instead of adopting a heuristic approach, we start with an approximate multiqubit target state and utilize two quantum information-theoretic quantities, i.e., von Neumann entropy and quantum mutual information, to construct our ansatz. The quantum information encoded in the target state helps us design unique blocks and identify qubit pairs that exhibit maximal quantum correlations within the multi-qubit system, thereby enabling us to deterministically place two-qubit entanglers in the suitably constructed parametrized quantum circuit. We find that our approach offers the advantage of reduced circuit depth compared to the physics-inspired unitary coupled-cluster (UCC) ansatz, while yielding accurate results. To test the performance of our ansatz, we apply it to compute ground-state energies of atomic systems in the relativistic regime. Our results show that for up to 12-qubits (12-spinorbitals) noiseless calculations, our ansatz yields energies within chemical accuracy ( ∼ 1.6 mhartree) relative to the complete active space configuration interaction values, while utilizing only a few blocks that contain in the best case 98 % fewer two-qubit gates when compared with the UCC ansatz in the singles and doubles approximation.

arXiv:2508.10593•Physical Review Research•Apr 25, 2026•1 citation

Symmetry enhanced variational quantum spin eigensolver

Chufan Lyu, Xusheng Xu, Man‐Hong Yung +1 more

The variational quantum-classical algorithms are the most promising approach for achieving quantum advantage on near-term quantum simulators. Among these methods, the variational quantum eigensolver has attracted a lot of attention in recent years. While it is very effective for simulating the ground state of many-body systems, its generalization to excited states becomes very resource demanding. Here, we show that this issue can significantly be improved by exploiting the symmetries of the Hamiltonian. The improvement is even more effective for higher energy eigenstates. We introduce two methods for incorporating the symmetries. In the first approach, called hardware symmetry preserving, all the symmetries are included in the design of the circuit. In the second approach, the cost function is updated to include the symmetries. The hardware symmetry preserving approach indeed outperforms the second approach. However, integrating all symmetries in the design of the circuit could be extremely challenging. Therefore, we introduce hybrid symmetry preserving method in which symmetries are divided between the circuit and the classical cost function. This allows to harness the advantage of symmetries while preventing sophisticated circuit design.

arXiv:2203.02444•Quantum•Jan 19, 2023•45 citations
Quantum numbers associated with symmetries classify quantum states and identify the sectors relevant to a given simulation. Generic hardware-efficient ansatzes do not necessarily preserve the quantum numbers and may therefore explore states outside the target sector. We develop symmetry-guided algorithms based on the quantum-accessible Hilbert-Schmidt asymmetry AHS\mathrm{A}_\mathrm{HS}AHS​, which quantifies the deviation of a quantum state from invariance under a specified symmetry group. This quantity guides the optimization toward a highly reduced symmetry-based target sector, without enforcing the symmetry on the preparation circuit. We demonstrate the approach as a proof of principle in variational quantum eigensolver calculations targeting singlet ground states with collective SU(2) symmetry. The applications include a five-qubit SSS-wave p+3Hep+{}^3\mathrm{He}p+3He two-cluster Hamiltonian, deduced from ab initio\textit{ab initio}ab initio many-body calculations, and collective spin models with up to 12 particles, which provide a many-particle benchmark of asymmetry-guided optimization. Across these applications, AHS\mathrm{A}_\mathrm{HS}AHS​-based guidance increases the singlet probability. Overall, the proposed algorithms improve energy accuracy during optimization and ground-state fidelity compared with direct energy minimization, with substantial fidelity improvements in the larger spin systems. These results demonstrate the utility of an asymmetry objective determined by the group action, independently of the Hamiltonian energy, for improving the reliability of variational quantum optimization.
Our works [1–7] focus on algorithm development for current and near-term quantum computing platforms. Symmetries, which are mathematically described by groups, divide the full space of possibilities, the Hilbert space, into smaller sectors. If a symmetry is conserved within an application, then one of these smaller symmetry sectors will be sufficient to model it. Therefore, our works incorporate symmetries like translational invariance [1, 2, 5, 7], time-periodicity [3, 4] or electron number conservation [6] to improve algorithms for relevant system classes compared to symmetry-unaware standard methods. In the first direction, we utilise symmetries for Hamiltonian simulation, where one aims to approximate the time evolution of a reproduced quantum system of interest on a quantum computer and predict the time-dependent properties of the system, such as correlations. Concretely, we improve Hamiltonian simulation algorithms for time-periodic systems by taking advantage of high-frequency expansions in works [3, 4]. In Ref. [5], we reduce the approximation error of product formulas by classical variational optimisation, and translational symmetry to scale up the system size n. The second direction is state preparation, where one targets the recreation of a quantum state, typically a ground state, and the prediction of its properties that are too difficult to compute classically. In Ref. [6], we take advantage of the electron number conservation of fermionic systems for a symmetry-aware circuit ansatz and self-consistent configuration recovery. Paired with warm-starting and classical subsystem diagonalisation, it allows us to estimate the Fe(III)-NTA ground state energy within chemical accuracy via samples obtained from an ion-trap quantum computer. The third direction is to use symmetry for the reduction of statistical uncertainty of quantum estimators, which are computed from measured bitstring values at the end of a quantum computation. Concretely, in Refs. [1, 2], we improve the sampling complexity for energy estimation of quantum lattice systems, which can be mapped efficiently to current quantum hardware. Our approach leverages translational invariance to construct more sample-efficient estimators, where their minimal improvement compared to local Pauli bases is guaranteed by an analytical lower bound. Further in Refs. [3, 4], we take advantage of the translational invariance of both the quantum state and observable to boost the number of observed bitstring values per ion trap hardware sample by the number of qubits. [1] T. Eckstein, R. Mansuroglu, S. Wolf, L. Nützel, S. Tasler, M. Kliesch, and M. J. Hartmann, in Quantum Computing Theory in Practice 2025 (Freie Universität Berlin, 2025). [2] T. Eckstein, R. Mansuroglu, S. Wolf, L. Nützel, S. Tasler, M. Kliesch, and M. J. Hartmann, arXiv preprint arXiv:2410.21251 10.48550/arXiv.2410.21251 (2024). [3] T. Eckstein, R. Mansuroglu, P. Czarnik, J.-X. Zhu, M. J. Hartmann, L. Cincio, A. T. Sornborger, and Z. Holmes, in Quantum Computing Theory in Practice 2024 (University of Edinburgh, 2024). [4] T. Eckstein, R. Mansuroglu, P. Czarnik, J.-X. Zhu, M. J. Hartmann, L. Cincio, A. T. Sornborger, and Z. Holmes, npj Quantum Information 10, 84 (2024). [5] R. Mansuroglu, T. Eckstein, L. N¨utzel, S. A. Wilkinson, and M. J. Hartmann, Quantum Science and Technology 8, 025006 (2023). [6] L. Nützel, A. Gresch, L. Hehn, L. Marti, R. Freund, A. Steiner, C. D. Marciniak, T. Eckstein, N. Stockinger, S. Wolf, et al., Quantum Science and Technology 10, 015066 (2025). [7] S. Tasler, J. Old, L. Heunisch, V. Feulner, T. Eckstein, M. Müller, and M. J. Hartmann, arXiv preprint arXiv:2506.09028 10.48550/arXiv.2506.09028 (2025).
computations of the ground and excited electronic states. While substantial progress has been made in designing physically informed quantum algorithms to address the ground state under the constraints of near-term quantum hardware, relatively fewer developments exist for reliably computing excited state energetics, presumably due to the growing complexity of the quantum circuits for excited eigenroots. In this work, we exploit the inherent point-group and spin symmetries of molecular systems to construct symmetry-adapted sets of orthogonal reference states which are evolved with a common symmetry-scalar unitary, enabling the simultaneous determination of ground and excited eigenroots. By minimizing the energy functional over a restricted symmetry-adapted correlated manifold, the weighted subspace-search variational quantum eigensolver enables us to directly target multiple eigenroots within each spatial and spin symmetry sector. This physically motivated selection of references and the unitary confer substantial flexibility to the weighted energy landscape, largely allowing the optimization to avoid numerical traps and converge directly to the targeted eigenstates. More crucially, symmetry resolution also enables access to a larger number of eigenstates without substantially increasing the complexity of the cost function. Through benchmarking on moderate to strongly correlated molecular systems, we demonstrate the accuracy and advantages of our approach relative to several established excited state algorithms on quantum computers.
Qubit-based quantum simulators naturally target two-level systems, whereas many quantum many-body problems are intrinsically d level. Encodings from qudits to qubits then enlarge the Hilbert space and can introduce unphysical states that interfere with variational optimization. We formulate a variational framework for encoded d -level models that suppresses these illegitimate states with penalty terms and benchmark it for spin-1 and spin-3/2 bilinear-biquadratic Heisenberg chains. We compare binary encoding, which minimizes the qubit overhead, with symmetry encoding, which preserves the relevant spin symmetries and enables symmetry-conserving ansätze. Although binary encoding is more qubit efficient, its hardware-efficient ansatz is harder to train and less effective at exploiting conserved quantities. In contrast, symmetry encoding requires more qubits but reaches substantially higher fidelities, converges faster, and exhibits better trainability than the binary hardware-efficient ansatz. These results identify symmetry-preserving encodings as a practical route to simulating higher-spin models on existing qubit platforms.
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.
We present a quantum information-inspired ansatz for the variational quantum eigensolver and demonstrate its efficacy in calculating ground-state energies of atomic systems. Instead of adopting a heuristic approach, we start with an approximate multiqubit target state and utilize two quantum information-theoretic quantities, i.e., von Neumann entropy and quantum mutual information, to construct our ansatz. The quantum information encoded in the target state helps us design unique blocks and identify qubit pairs that exhibit maximal quantum correlations within the multi-qubit system, thereby enabling us to deterministically place two-qubit entanglers in the suitably constructed parametrized quantum circuit. We find that our approach offers the advantage of reduced circuit depth compared to the physics-inspired unitary coupled-cluster (UCC) ansatz, while yielding accurate results. To test the performance of our ansatz, we apply it to compute ground-state energies of atomic systems in the relativistic regime. Our results show that for up to 12-qubits (12-spinorbitals) noiseless calculations, our ansatz yields energies within chemical accuracy ( ∼ 1.6 mhartree) relative to the complete active space configuration interaction values, while utilizing only a few blocks that contain in the best case 98 % fewer two-qubit gates when compared with the UCC ansatz in the singles and doubles approximation.
The variational quantum-classical algorithms are the most promising approach for achieving quantum advantage on near-term quantum simulators. Among these methods, the variational quantum eigensolver has attracted a lot of attention in recent years. While it is very effective for simulating the ground state of many-body systems, its generalization to excited states becomes very resource demanding. Here, we show that this issue can significantly be improved by exploiting the symmetries of the Hamiltonian. The improvement is even more effective for higher energy eigenstates. We introduce two methods for incorporating the symmetries. In the first approach, called hardware symmetry preserving, all the symmetries are included in the design of the circuit. In the second approach, the cost function is updated to include the symmetries. The hardware symmetry preserving approach indeed outperforms the second approach. However, integrating all symmetries in the design of the circuit could be extremely challenging. Therefore, we introduce hybrid symmetry preserving method in which symmetries are divided between the circuit and the classical cost function. This allows to harness the advantage of symmetries while preventing sophisticated circuit design.