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:2403.11995 · Quantum Science and Technology

Hamiltonian-reconstruction distance as a success metric for the variational quantum eigensolver

Leo Joon Il Moon, Mandar M. Sohoni, Michael A. Shimizu, Praveen Viswanathan, Kevin Zhang, Eun-Ah Kim, Peter L. McMahon

Published Mar 16, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract The variational quantum eigensolver (VQE) is a hybrid quantum–classical algorithm for quantum simulation that can be run on near-term quantum hardware. A challenge in VQE—as well as any other heuristic algorithm for finding ground states of Hamiltonians—is to know how close the algorithm’s output solution is to the true ground state, when we do not know what the true ground state or ground-state energy is. This is especially important in iterative algorithms such as VQE, where we need to decide when to stop iterating. Stopping when the current solution energy no longer changes rapidly from one iteration to the next is a common choice but in many situations can lead to stopping too early and outputting an incorrect result. Recent developments in Hamiltonian reconstruction—the inference of a Hamiltonian given an eigenstate—give a tool that can be used to assess the quality of a variational solution to a Hamiltonian-eigensolving problem: a metric quantifying the distance between the problem Hamiltonian and the reconstructed Hamiltonian can give an indication of whether the variational solution is an eigenstate, which can (as a special case) indicate if the variational solution is not the ground state. Crucially, computing the Hamiltonian-reconstruction (HR) distance does not rely on knowing the true ground state or ground-state energy. We propose and study using the HR distance as a metric for assessing the success of VQE eigensolving. In numerical simulations and in demonstrations on a cloud-based trapped-ion quantum computer, we show that for examples of both one-dimensional transverse-field-Ising (11 qubits) and two-dimensional J 1 – J 2 transverse-field-Ising (6 qubits) spin problems, the HR distance gives a helpful indication of whether VQE has yet found the ground state or not. Our demonstrations included cases where the energy plateaus as a function of the VQE iteration, which could have resulted in erroneous early stopping of the VQE algorithm, but where the HR distance correctly suggests to continue iterating. We find that HR distance has a useful correlation with the fidelity (i.e. state overlap) between the VQE solution and the true ground state, and with the energy difference between VQE solution’s energy and the true ground-state energy. Our work suggests that HR distance may be a useful tool for assessing success in VQE, including on noisy quantum processors in practice.

DOI
10.1088/2058-9565/ae528d

Related papers

Dual variational quantum eigensolver: A quantum algorithm to lower bound the ground-state energy

Hanna Westerheim, Jingxuan Chen, Zoë Holmes +6 more

The variational quantum eigensolver (VQE) is a hybrid quantum-classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As quantum computers become more powerful and go beyond the reach of classical brute-force simulation, it is important to assess the quality of solutions produced by them. Here we propose a dual variational quantum eigensolver (dual-VQE) that produces a lower-bound estimate of the ground-state energy. As such, VQE and dual-VQE can serve as quality checks on their solutions; in the ideal case, the VQE upper bound and the dual-VQE lower bound form an interval containing the true optimal value of the ground-state energy. The idea behind dual-VQE is to employ semidefinite programming duality to rewrite the ground-state optimization problem as a constrained maximization problem, which itself can be bounded from below by an unconstrained optimization problem to be solved by a variational quantum algorithm. When using a convex combination ansatz in conjunction with a classical generative model, the quantum computational resources needed to evaluate the objective function of dual-VQE are no greater than those needed for that of VQE. We also show that the problem is well suited for classical pretraining using matrix product states and these methods help warm-start the optimization. We simulated the performance of dual-VQE on the transverse-field Ising model with and without pretraining and found that, for the example considered, while dual-VQE training is slower and noisier than VQE, it approaches the true value with an error of order $10^{-2}$.

arXiv:2312.03083•Physical Review A•Feb 18, 2026•3 citations

Variational quantum eigensolver for frustrated quantum systems

Alexey Uvarov, Jacob Biamonte, Dmitry I. Yudin

Hybrid quantum-classical algorithms have been proposed as a potentially viable application of quantum computers. A particular example---the variational quantum eigensolver, or VQE---is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian, which makes it appealing for the needs of quantum chemistry. Experimental realizations have been reported in recent years and theoretical estimates of its efficiency are a subject of intense effort. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions with competing nearest- and next-nearest-neighbor interactions. We find that recovering the VQE solution allows one to obtain the correlation function of the ground state consistent with the exact result. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits. Our results are consistent with the current knowledge about the barren plateaus in quantum optimization.

arXiv:2005.00544•Physical review. B./Physical review. B•Aug 4, 2020•61 citations

Variational denoising for variational quantum eigensolver

Quoc Hoan Tran, Shinji Kikuchi, Hirotaka Oshima

The variational quantum eigensolver (VQE) is a hybrid algorithm that has the potential to provide a quantum advantage in practical chemistry problems that are currently intractable on classical computers. VQE trains parameterized quantum circuits using a classical optimizer to approximate the eigenvalues and eigenstates of a given Hamiltonian. However, VQE faces challenges in task-specific design and machine-specific architecture, particularly when running on noisy quantum devices. This can have a negative impact on its trainability, accuracy, and efficiency, resulting in noisy quantum data. We propose variational denoising, an unsupervised learning method that employs a parameterized quantum neural network to improve the solution of VQE by learning from noisy VQE outputs. Our approach can significantly decrease energy estimation errors and increase fidelities with ground states compared to noisy input data for the H2 , LiH, and BeH2 molecular Hamiltonians and the transverse field Ising model. Surprisingly, it only requires noisy data for training. Variational denoising can be integrated into quantum hardware, increasing its versatility as an end-to-end quantum processing for quantum data. Published by the American Physical Society 2024

arXiv:2304.00549•Physical Review Research•May 17, 2024•4 citations

VQE as Initial State Preparation for QPE on Heisenberg Spin-Glass Hamiltonians

Elijah Pelofske, Stephan Eidenbenz

Quantum Phase Estimation (QPE) is the quantum algorithmic workhorse for computing ground state energies of quantum Hamiltonians with quantum computers. Ground state energy calculation of physical systems is perhaps the most promising use case for quantum computing in terms of scientific and commercial value with a plausible path to outperformance of classical alternatives. This path, however, hinges on the availability of initial states for QPE with significant overlap with the true ground state. Using extensive (classical) numerical computations, we study whether the NISQ-era algorithm VQE (Variational Quantum Eigensolver) could be used to efficiently prepare high-overlap states of disordered fully-connected anisotropic Heisenberg spin glass quantum Hamiltonians with up to $15$ qubits. We find that (i) -- consistent with widely held, but rarely numerically illustrated beliefs -- VQE is generally unable to efficiently converge to the ground state for our Hamiltonians, which is a well-known issue with VQE due to a variety of factors including vanishing gradients and local minima; (ii) low energy states do not necessarily have large ground-state overlap, but there is typically a correlation between the two measures; (iii) adding more than three layers to the VQE ansatz neither improves overlap nor the energies found; and (iv) the best-found overlap scaling as a function of the Hamiltonian system size is not strongly exponentially decreasing, suggesting potential for VQE to be a heuristic state preparation algorithm for QPE.

quant-pharXiv:2606.15061•Jun 16, 2026•0 citations

Ground-State Energy Estimation on Current Quantum Hardware through the Variational Quantum Eigensolver: A Practical Study

Nacer Eddine Belaloui, Abdellah Tounsi, Abdelmouheymen Rabah Khamadja +4 more

molecule, emphasizing practical implementation and performance on current quantum hardware. Our research presents a comparative study of HEA and UCCSD ansätze on noiseless and noisy simulations and implements VQE on recent IBM quantum computer noise models and a real quantum computer, IBM Fez, providing a fully functional code employing Qiskit 1.2. Our experiments confirm UCCSD's reliability in ideal conditions, while the HEA demonstrates greater robustness to hardware noise, achieving chemical accuracy on state-vector simulation (SVS). The results reveal that achieving ground-state energy within chemical accuracy is feasible without error mitigation during VQE convergence. We demonstrate that current quantum devices effectively optimize circuit parameters despite misestimating simulated energies. The SVS-evaluated energies provide a more accurate representation of the solution quality compared to QPU-estimated energy values, indicating that VQE converges to the correct ground state despite quantum noise. Our study also applies noise mitigation as a postprocessing technique, using zero-noise extrapolation (ZNE) on a real quantum computer. The detailed methodologies presented in this study, including Hamiltonian construction and Fermionic-to-qubit transformations, facilitate flexible adaptation of the VQE approach for various algorithm variants and across different levels of algorithmic implementation.

Journal of Chemical Theory and Computation•Jun 29, 2025•11 citations

Improved Variational Quantum Eigensolver Via Quasidynamical Evolution

Manpreet Singh Jattana, Fengping Jin, Hans A. De Raedt +1 more

The variational quantum eigensolver (VQE) is a hybrid quantum classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack of understanding involving several of its key aspects. There are problems with VQE that forbid a favorable scaling towards quantum advantage. In order to alleviate the problems, we propose and extensively test a quantum annealing inspired heuristic that supplements VQE. The improved VQE enables an efficient initial state-preparation mechanism, in a recursive manner, for a quasidynamical unitary evolution. We conduct an in-depth scaling analysis of finding the ground-state energies with increasing lattice sizes of the Heisenberg model, employing simulations of up to 40 qubits that manipulate the complete state vector. In addition to systematically finding the ground-state energy, we observe that it avoids barren plateaus, escapes local minima, and works with low-depth circuits. For the current devices, we further propose a benchmarking toolkit using a mean-field model and test it on IBM Q devices. Realistic gate execution times estimate a longer computational time to complete the same computation on a fully functional error-free quantum computer than on a quantum computer emulator implemented on a classical computer. However, our proposal can be expected to help accurate estimations of the ground-state energies beyond 50 qubits when the complete state vector can no longer be stored on a classical computer, thus enabling quantum advantage.

Physical Review Applied•Feb 16, 2023•16 citations
Abstract The variational quantum eigensolver (VQE) is a hybrid quantum–classical algorithm for quantum simulation that can be run on near-term quantum hardware. A challenge in VQE—as well as any other heuristic algorithm for finding ground states of Hamiltonians—is to know how close the algorithm’s output solution is to the true ground state, when we do not know what the true ground state or ground-state energy is. This is especially important in iterative algorithms such as VQE, where we need to decide when to stop iterating. Stopping when the current solution energy no longer changes rapidly from one iteration to the next is a common choice but in many situations can lead to stopping too early and outputting an incorrect result. Recent developments in Hamiltonian reconstruction—the inference of a Hamiltonian given an eigenstate—give a tool that can be used to assess the quality of a variational solution to a Hamiltonian-eigensolving problem: a metric quantifying the distance between the problem Hamiltonian and the reconstructed Hamiltonian can give an indication of whether the variational solution is an eigenstate, which can (as a special case) indicate if the variational solution is not the ground state. Crucially, computing the Hamiltonian-reconstruction (HR) distance does not rely on knowing the true ground state or ground-state energy. We propose and study using the HR distance as a metric for assessing the success of VQE eigensolving. In numerical simulations and in demonstrations on a cloud-based trapped-ion quantum computer, we show that for examples of both one-dimensional transverse-field-Ising (11 qubits) and two-dimensional J 1 – J 2 transverse-field-Ising (6 qubits) spin problems, the HR distance gives a helpful indication of whether VQE has yet found the ground state or not. Our demonstrations included cases where the energy plateaus as a function of the VQE iteration, which could have resulted in erroneous early stopping of the VQE algorithm, but where the HR distance correctly suggests to continue iterating. We find that HR distance has a useful correlation with the fidelity (i.e. state overlap) between the VQE solution and the true ground state, and with the energy difference between VQE solution’s energy and the true ground-state energy. Our work suggests that HR distance may be a useful tool for assessing success in VQE, including on noisy quantum processors in practice.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As quantum computers become more powerful and go beyond the reach of classical brute-force simulation, it is important to assess the quality of solutions produced by them. Here we propose a dual variational quantum eigensolver (dual-VQE) that produces a lower-bound estimate of the ground-state energy. As such, VQE and dual-VQE can serve as quality checks on their solutions; in the ideal case, the VQE upper bound and the dual-VQE lower bound form an interval containing the true optimal value of the ground-state energy. The idea behind dual-VQE is to employ semidefinite programming duality to rewrite the ground-state optimization problem as a constrained maximization problem, which itself can be bounded from below by an unconstrained optimization problem to be solved by a variational quantum algorithm. When using a convex combination ansatz in conjunction with a classical generative model, the quantum computational resources needed to evaluate the objective function of dual-VQE are no greater than those needed for that of VQE. We also show that the problem is well suited for classical pretraining using matrix product states and these methods help warm-start the optimization. We simulated the performance of dual-VQE on the transverse-field Ising model with and without pretraining and found that, for the example considered, while dual-VQE training is slower and noisier than VQE, it approaches the true value with an error of order 10−210^{-2}10−2.
Hybrid quantum-classical algorithms have been proposed as a potentially viable application of quantum computers. A particular example---the variational quantum eigensolver, or VQE---is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian, which makes it appealing for the needs of quantum chemistry. Experimental realizations have been reported in recent years and theoretical estimates of its efficiency are a subject of intense effort. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions with competing nearest- and next-nearest-neighbor interactions. We find that recovering the VQE solution allows one to obtain the correlation function of the ground state consistent with the exact result. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits. Our results are consistent with the current knowledge about the barren plateaus in quantum optimization.
The variational quantum eigensolver (VQE) is a hybrid algorithm that has the potential to provide a quantum advantage in practical chemistry problems that are currently intractable on classical computers. VQE trains parameterized quantum circuits using a classical optimizer to approximate the eigenvalues and eigenstates of a given Hamiltonian. However, VQE faces challenges in task-specific design and machine-specific architecture, particularly when running on noisy quantum devices. This can have a negative impact on its trainability, accuracy, and efficiency, resulting in noisy quantum data. We propose variational denoising, an unsupervised learning method that employs a parameterized quantum neural network to improve the solution of VQE by learning from noisy VQE outputs. Our approach can significantly decrease energy estimation errors and increase fidelities with ground states compared to noisy input data for the H2 , LiH, and BeH2 molecular Hamiltonians and the transverse field Ising model. Surprisingly, it only requires noisy data for training. Variational denoising can be integrated into quantum hardware, increasing its versatility as an end-to-end quantum processing for quantum data. Published by the American Physical Society 2024
Quantum Phase Estimation (QPE) is the quantum algorithmic workhorse for computing ground state energies of quantum Hamiltonians with quantum computers. Ground state energy calculation of physical systems is perhaps the most promising use case for quantum computing in terms of scientific and commercial value with a plausible path to outperformance of classical alternatives. This path, however, hinges on the availability of initial states for QPE with significant overlap with the true ground state. Using extensive (classical) numerical computations, we study whether the NISQ-era algorithm VQE (Variational Quantum Eigensolver) could be used to efficiently prepare high-overlap states of disordered fully-connected anisotropic Heisenberg spin glass quantum Hamiltonians with up to 151515 qubits. We find that (i) -- consistent with widely held, but rarely numerically illustrated beliefs -- VQE is generally unable to efficiently converge to the ground state for our Hamiltonians, which is a well-known issue with VQE due to a variety of factors including vanishing gradients and local minima; (ii) low energy states do not necessarily have large ground-state overlap, but there is typically a correlation between the two measures; (iii) adding more than three layers to the VQE ansatz neither improves overlap nor the energies found; and (iv) the best-found overlap scaling as a function of the Hamiltonian system size is not strongly exponentially decreasing, suggesting potential for VQE to be a heuristic state preparation algorithm for QPE.
molecule, emphasizing practical implementation and performance on current quantum hardware. Our research presents a comparative study of HEA and UCCSD ansätze on noiseless and noisy simulations and implements VQE on recent IBM quantum computer noise models and a real quantum computer, IBM Fez, providing a fully functional code employing Qiskit 1.2. Our experiments confirm UCCSD's reliability in ideal conditions, while the HEA demonstrates greater robustness to hardware noise, achieving chemical accuracy on state-vector simulation (SVS). The results reveal that achieving ground-state energy within chemical accuracy is feasible without error mitigation during VQE convergence. We demonstrate that current quantum devices effectively optimize circuit parameters despite misestimating simulated energies. The SVS-evaluated energies provide a more accurate representation of the solution quality compared to QPU-estimated energy values, indicating that VQE converges to the correct ground state despite quantum noise. Our study also applies noise mitigation as a postprocessing technique, using zero-noise extrapolation (ZNE) on a real quantum computer. The detailed methodologies presented in this study, including Hamiltonian construction and Fermionic-to-qubit transformations, facilitate flexible adaptation of the VQE approach for various algorithm variants and across different levels of algorithmic implementation.
The variational quantum eigensolver (VQE) is a hybrid quantum classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack of understanding involving several of its key aspects. There are problems with VQE that forbid a favorable scaling towards quantum advantage. In order to alleviate the problems, we propose and extensively test a quantum annealing inspired heuristic that supplements VQE. The improved VQE enables an efficient initial state-preparation mechanism, in a recursive manner, for a quasidynamical unitary evolution. We conduct an in-depth scaling analysis of finding the ground-state energies with increasing lattice sizes of the Heisenberg model, employing simulations of up to 40 qubits that manipulate the complete state vector. In addition to systematically finding the ground-state energy, we observe that it avoids barren plateaus, escapes local minima, and works with low-depth circuits. For the current devices, we further propose a benchmarking toolkit using a mean-field model and test it on IBM Q devices. Realistic gate execution times estimate a longer computational time to complete the same computation on a fully functional error-free quantum computer than on a quantum computer emulator implemented on a classical computer. However, our proposal can be expected to help accurate estimations of the ground-state energies beyond 50 qubits when the complete state vector can no longer be stored on a classical computer, thus enabling quantum advantage.