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:2109.08420 · Physical Review A

Using gradient-based algorithms to determine ground-state energies on a quantum computer

Tomislav Piskor, Jan-Michael Reiner, Sebastian Zanker, Nicolas Vogt, Michael Marthaler, Frank K. Wilhelm, F. G. Eich

Published Jun 8, 2022• 8 citations
arXivHTMLPDF

Abstract

Variational algorithms are promising candidates to be implemented on near-term quantum computers. In our work, we investigate the variational Hamiltonian ansatz (VHA), where a parametrized trial state of the quantum mechanical wave function is optimized to obtain the ground-state energy. In the VHA, the trial state is given by a noninteracting reference state modified by unitary rotations using generators that are part of the Hamiltonian describing the system. The lowest energy is obtained by optimizing the angles of those unitary rotations. A standard procedure to optimize the variational parameters is to use gradient-based algorithms. However, shot noise and the intrinsic noise of the quantum device affect the evaluation of the required gradients. We study how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and the noise of the quantum computer. To this end, we simulate a simple quantum circuit, as well as the two-site and six-site Hubbard models.

DOI
10.1103/physreva.105.062415

Related papers

Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors

Jan-Michael Reiner, Frank K. Wilhelm, Gerd Schön +1 more

Abstract A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the—ideally short—fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g. unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.

arXiv:1811.04476•Quantum Science and Technology•May 1, 2019•56 citations

Preparing ground states with a broken symmetry with variational quantum algorithms

Nicolas Vogt, Sebastian Zanker, Jan-Michael Reiner +3 more

Abstract One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct symmetry broken ground state of an interacting electron system is one of the central challenges. To help finding the correct broken symmetries in the thermodynamic limit methods that allow to determine the groundstate of large but finite interacting electron systems are very useful. The variational Hamiltonian ansatz (VHA), a variational hybrid quantum-classical algorithm especially suited for finding the ground state of a solid state system, will in general not prepare a broken symmetry state unless the initial state is chosen to exhibit the correct symmetry. In this work, we discuss three variations of the VHA designed to find the symmetry-breaking groundstate of a finite system close to a transition point between different orders. As a test case we use the two-dimensional Hubbard model where we break the symmetry explicitly by means of external fields coupling to the Hamiltonian and calculate the response to these fields. For the calculation we simulate a gate-based quantum computer and also consider the effects of dephasing noise on the algorithms. We find that two of the three algorithms are in good agreement with the exact solution for the considered parameter range. The third algorithm agrees with the exact solution only for a part of the parameter regime, but is more robust with respect to dephasing compared to the other two algorithms.

arXiv:2007.01582•Quantum Science and Technology•Feb 11, 2021•21 citations

Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry

Meenambika Gowrishankar, Jerimiah Wright, Daniel Claudino +4 more

The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•2 citations

Progress towards practical quantum variational algorithms

Dave Wecker, Matthew B. Hastings, Matthias Troyer

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimize the energy of the constructed quantum state for a given problem Hamiltonian. For this purpose we propose a simple-to-implement class of quantum states motivated by adiabatic state preparation. We test its accuracy and determine the required circuit depth for a Hubbard model on ladders with up to 12 sites (24 spin orbitals), and for small molecules. We find that this ansatz converges faster than previously proposed schemes based on unitary coupled clusters. While the required number of measurements is astronomically large for quantum chemistry applications to molecules, applying the variational approach to the Hubbard model (and related models) is found to be far less demanding and potentially practical on small quantum computers. We also discuss another application of quantum state preparation using short quantum circuits, to prepare trial ground states of models faster than using adiabatic state preparation.

arXiv:1507.08969•Physical Review A•Oct 2, 2015•795 citations

Numerical simulations of noisy quantum circuits for computational chemistry

Jerimiah Wright, Meenambika Gowrishankar, Daniel Claudino +4 more

Abstract The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.

arXiv:2112.15540•Materials Theory•Sep 22, 2022•11 citations

Phenomenological theory of variational quantum ground-state preparation

Nikita Astrakhantsev, Guglielmo Mazzola, Ivano Tavernelli +1 more

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits that may offer an advantage compared to classical trial states used, for instance, in quantum Monte Carlo or tensor network calculations. While, traditionally, the main focus has been on developing better trial circuits, we show that the algorithm's success, if optimized within stochastic gradient descent (SGD) or quantum natural gradient descent (QNGD), crucially depends on other parameters such as the learning rate, the number ${N}_{s}$ of measurements to estimate the gradient components, and the Hamiltonian gap $\mathrm{\ensuremath{\Delta}}$. Within the standard SGD or QNGD, we first observe the existence of a finite ${N}_{s}$ value below which the optimization is impossible, and the energy variance resembles the behavior of the specific heat in second-order phase transitions. Second, when ${N}_{s}$ is above such threshold level, and learning is possible, we develop a phenomenological model that relates the fidelity of the state preparation with the optimization hyperparameters and $\mathrm{\ensuremath{\Delta}}$. More specifically, we observe that the computational resources scale as $1/{\mathrm{\ensuremath{\Delta}}}^{2}$, and we propose a symmetry enhancement of the variational ansatz as a way to increase the closing gap. We test our understanding on several instances of two-dimensional frustrated quantum magnets, which are believed to be the most promising candidates for near-term quantum advantage through variational quantum simulations.

arXiv:2205.06278•Physical Review Research•Sep 28, 2023•22 citations
Variational algorithms are promising candidates to be implemented on near-term quantum computers. In our work, we investigate the variational Hamiltonian ansatz (VHA), where a parametrized trial state of the quantum mechanical wave function is optimized to obtain the ground-state energy. In the VHA, the trial state is given by a noninteracting reference state modified by unitary rotations using generators that are part of the Hamiltonian describing the system. The lowest energy is obtained by optimizing the angles of those unitary rotations. A standard procedure to optimize the variational parameters is to use gradient-based algorithms. However, shot noise and the intrinsic noise of the quantum device affect the evaluation of the required gradients. We study how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and the noise of the quantum computer. To this end, we simulate a simple quantum circuit, as well as the two-site and six-site Hubbard models.
Abstract A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the—ideally short—fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g. unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.
Abstract One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct symmetry broken ground state of an interacting electron system is one of the central challenges. To help finding the correct broken symmetries in the thermodynamic limit methods that allow to determine the groundstate of large but finite interacting electron systems are very useful. The variational Hamiltonian ansatz (VHA), a variational hybrid quantum-classical algorithm especially suited for finding the ground state of a solid state system, will in general not prepare a broken symmetry state unless the initial state is chosen to exhibit the correct symmetry. In this work, we discuss three variations of the VHA designed to find the symmetry-breaking groundstate of a finite system close to a transition point between different orders. As a test case we use the two-dimensional Hubbard model where we break the symmetry explicitly by means of external fields coupling to the Hamiltonian and calculate the response to these fields. For the calculation we simulate a gate-based quantum computer and also consider the effects of dephasing noise on the algorithms. We find that two of the three algorithms are in good agreement with the exact solution for the considered parameter range. The third algorithm agrees with the exact solution only for a part of the parameter regime, but is more robust with respect to dephasing compared to the other two algorithms.
The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimize the energy of the constructed quantum state for a given problem Hamiltonian. For this purpose we propose a simple-to-implement class of quantum states motivated by adiabatic state preparation. We test its accuracy and determine the required circuit depth for a Hubbard model on ladders with up to 12 sites (24 spin orbitals), and for small molecules. We find that this ansatz converges faster than previously proposed schemes based on unitary coupled clusters. While the required number of measurements is astronomically large for quantum chemistry applications to molecules, applying the variational approach to the Hubbard model (and related models) is found to be far less demanding and potentially practical on small quantum computers. We also discuss another application of quantum state preparation using short quantum circuits, to prepare trial ground states of models faster than using adiabatic state preparation.
Abstract The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits that may offer an advantage compared to classical trial states used, for instance, in quantum Monte Carlo or tensor network calculations. While, traditionally, the main focus has been on developing better trial circuits, we show that the algorithm's success, if optimized within stochastic gradient descent (SGD) or quantum natural gradient descent (QNGD), crucially depends on other parameters such as the learning rate, the number Ns{N}_{s}Ns​ of measurements to estimate the gradient components, and the Hamiltonian gap $\mathrm{\ensuremath{\Delta}}$. Within the standard SGD or QNGD, we first observe the existence of a finite Ns{N}_{s}Ns​ value below which the optimization is impossible, and the energy variance resembles the behavior of the specific heat in second-order phase transitions. Second, when Ns{N}_{s}Ns​ is above such threshold level, and learning is possible, we develop a phenomenological model that relates the fidelity of the state preparation with the optimization hyperparameters and $\mathrm{\ensuremath{\Delta}}$. More specifically, we observe that the computational resources scale as $1/{\mathrm{\ensuremath{\Delta}}}^{2}$, and we propose a symmetry enhancement of the variational ansatz as a way to increase the closing gap. We test our understanding on several instances of two-dimensional frustrated quantum magnets, which are believed to be the most promising candidates for near-term quantum advantage through variational quantum simulations.