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

Certification failure in variational-principle observables

Ganga Singh Manchanda

quant-phSubmitted Oct 2, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Algorithms which prepare states via the variational principle assume that closeness in energy implies closeness in state; we formalise how this assumption can fail by showing that a ground-state energy estimate converged to within $ε$ of the true value is compatible with observable expectation values in error by up to $\sqrt{2εχ_O}$ at leading order, where $χ_O$ is the static susceptibility of the observable. As a result, the observable error can be orders of magnitude larger than the energy error, a mechanism we call non-linear error amplification, and because a variational algorithm cannot guarantee the correctness of these properties from energy alone, energy does not necessarily certify an observable. In light of our findings, we examine three algorithms: the variational quantum eigensolver on the transverse-field Ising chain, the density-matrix renormalisation group on a pair of weakly coupled hydrogen chains, and Krylov quantum diagonalisation on lithium fluoride. In each case we demonstrate that a well-converged energy can leave observables uncertified.

AI Summary

The paper asks what an energy-converged variational state guarantees about observables other than energy. It defines the certification radius $\delta_O(\mathcal M_\epsilon)$ as the largest observable error among all states with energy at most $E_0+\epsilon$, assuming a nondegenerate ground state and a bounded observable. Upper and constructive lower bounds establish $\delta_O=\sqrt{2\epsilon\chi_O}+\mathcal O(\epsilon)$ as $\epsilon\to0$ at fixed positive gap, where $\chi_O=2\sum_{n>0}|O_{0n}|^2/(E_n-E_0)$ is the static susceptibility. The finite-resolution upper bound separates an excited-population contribution, linear in $\epsilon$, from a ground–excited coherence contribution involving denominators $E_n-E_0+\epsilon$. The lower bound follows by displacing the ground state along its linear-response direction. Conserved observables lose the coherence contribution; symmetry-restricted state preparation can remove dangerous transitions. A target observable error $\delta_*$ consequently requires, at leading order, $\epsilon\lesssim\delta_*^2/(2\chi_O)$. Classical numerical demonstrations cover VQE on a 12-site Ising chain, DMRG on two separating hydrogen chains, and noisy Krylov diagonalisation of LiF. Reported examples include spin contamination $\langle S^2\rangle=1$ at $0.34\,\mathrm{m}E_h$ energy error and a 16-debye dipole error at $1.4\,\mathrm{m}E_h$. Symmetry-preserving or detuned comparisons avoid these failures. The radius is a worst-case compatibility statement, not a prediction that optimisation attains that error. The susceptibility asymptotic applies at small resolution relative to the relevant gap; finite-resolution bounds are capped when gaps become unresolved. Numerical figures select the largest observable error among near-best-energy runs, and the analysis assumes an energy-error certificate relative to the true ground energy.

Little sign of AI-generated textOverclaims

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 4 figures

Related papers

Variational microcanonical estimator

Klée Pollock, Peter P. Orth, Thomas Iadecola

We propose a variational quantum algorithm for estimating microcanonical expectation values in models obeying the eigenstate thermalization hypothesis. Using a relaxed criterion for convergence of the variational optimization loop, the algorithm generates weakly entangled superpositions of eigenstates at a given target energy density. An ensemble of these variational states is then used to estimate microcanonical averages of local operators, with an error whose dominant contribution decreases initially as a power law in the size of the ensemble and is ultimately limited by a small bias. We apply the algorithm to the one-dimensional mixed-field Ising model, where it converges for ansatz circuits of depth roughly linear in system size. The most accurate thermal estimates are produced for intermediate energy densities. In our error analysis, we find connections with recent works investigating the underpinnings of the eigenstate thermalization hypothesis. In particular, the failure of energy-basis matrix elements of local operators to behave as independent random variables is a potential source of error that the algorithm can overcome by averaging over an ensemble of variational states.

arXiv:2301.04129•Physical Review Research•Sep 28, 2023•3 citations

Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits

Eliott N. Rosenberg, Paul Ginsparg, Peter L. McMahon

Abstract Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. We compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM’s quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y -rotations on all qubits.

arXiv:2106.01264•Quantum Science and Technology•Nov 18, 2021•25 citations

Ground and Excited States from Ensemble Variational Principles

Lexin Ding, Cheng-Lin Hong, Christian Schilling

The extension of the Rayleigh-Ritz variational principle to ensemble states ρw≡∑kwk|Ψk⟩⟨Ψk| with fixed weights wk lies ultimately at the heart of several recent methodological developments for targeting excitation energies by variational means. Prominent examples are density and density matrix functional theory, Monte Carlo sampling, state-average complete active space self-consistent field methods and variational quantum eigensolvers. In order to provide a sound basis for all these methods and to improve their current implementations, we prove the validity of the underlying critical hypothesis: Whenever the ensemble energy is well-converged, the same holds true for the ensemble state ρw as well as the individual eigenstates |Ψk⟩ and eigenenergies Ek . To be more specific, we derive linear bounds d−ΔEw≤ΔQ≤d+ΔEw on the errors ΔQ of these sought-after quantities. A subsequent analytical analysis and numerical illustration proves the tightness of our universal inequalities. Our results and particularly the explicit form of d±≡d±(Q)(w,E) provide valuable insights into the optimal choice of the auxiliary weights wk in practical applications.

arXiv:2401.12104•Quantum•Nov 14, 2024•26 citations

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

Leo Joon Il Moon, Mandar M. Sohoni, Michael A. Shimizu +4 more

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.

arXiv:2403.11995•Quantum Science and Technology•Mar 16, 2026•1 citation

Quantum Phase Transitions in the Transverse-Field Ising Model: A Comparative Study of Exact, Variational, and Hardware-Based Approaches

Rudraksh Sharma

The quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the one-dimensional transverse field Ising model through a combined perspective that includes exact diagonalisation, variational quantum eigensolver (VQE) simulations, and simulations on realistic physical quantum devices. We focus on a lattice of four spins, where we calculate the ground-state energies, magnetic order parameters and correlation functions at uniformly applied conditions, which is repeated by all systems. Precise diagonalisation provides both a benchmark, which is symmetry-conserving, and a depth-two, physics inspired variational approximation, which provides simulations accessible to hardware. The circuits that have been optimised identically are then placed on the IQM Garnet quantum processor, using a resource-efficient batched protocol. We find that the ground-state energies of shallow variational circuits are reliably captured by the circuit over the entire parameter space; the magnetic arrangement parameters and observables sensitive to correlation signal significantly more noise. The error analysis of quantitative analysis reveals a strong broadening of critical crossover on hardware, which is consistent with the noise attenuation of long-range correlations. These findings highlight the current capabilities as well as the fundamental limitations of noisy intermediate-scale quantum systems in modelling quantum critical phenomena as a benchmark to future enhancements in obtaining quantum hardware and quantum algorithms development.

quant-pharXiv:2601.17515•Jan 27, 2026•0 citations

Certified variational quantum algorithms for eigenstate preparation

Andrey Kardashin, Alexey Uvarov, Dmitry I. Yudin +1 more

Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available numerical methods, in particular those based on variational Monte Carlo simulations, become exponentially more challenging with increasing system size. Recently quantum algorithms implemented as variational models have been proposed to accelerate such simulations. The variational ansatz states are characterized by a polynomial number of parameters devised in a way to minimize the expectation value of a given Hamiltonian, which is emulated by local measurements. In this study, we develop a means to certify the termination of variational algorithms. We demonstrate our approach by applying it to three models: the transverse field Ising model, the model of one-dimensional spinless fermions with competing interactions, and the Schwinger model of quantum electrodynamics. By means of comparison, we observe that our approach shows better performance near critical points in these models. We hence take a further step to improve the applicability and to certify the results of variational quantum simulators.

arXiv:2006.13222•Physical Review A•Nov 9, 2020•16 citations
Algorithms which prepare states via the variational principle assume that closeness in energy implies closeness in state; we formalise how this assumption can fail by showing that a ground-state energy estimate converged to within εεε of the true value is compatible with observable expectation values in error by up to 2εχO\sqrt{2εχ_O}2εχO​​ at leading order, where χOχ_OχO​ is the static susceptibility of the observable. As a result, the observable error can be orders of magnitude larger than the energy error, a mechanism we call non-linear error amplification, and because a variational algorithm cannot guarantee the correctness of these properties from energy alone, energy does not necessarily certify an observable. In light of our findings, we examine three algorithms: the variational quantum eigensolver on the transverse-field Ising chain, the density-matrix renormalisation group on a pair of weakly coupled hydrogen chains, and Krylov quantum diagonalisation on lithium fluoride. In each case we demonstrate that a well-converged energy can leave observables uncertified.
The paper asks what an energy-converged variational state guarantees about observables other than energy. It defines the certification radius δO(Mϵ)\delta_O(\mathcal M_\epsilon)δO​(Mϵ​) as the largest observable error among all states with energy at most E0+ϵE_0+\epsilonE0​+ϵ, assuming a nondegenerate ground state and a bounded observable.
Upper and constructive lower bounds establish δO=2ϵχO+O(ϵ)\delta_O=\sqrt{2\epsilon\chi_O}+\mathcal O(\epsilon)δO​=2ϵχO​​+O(ϵ) as ϵ→0\epsilon\to0ϵ→0 at fixed positive gap, where χO=2∑n>0∣O0n∣2/(En−E0)\chi_O=2\sum_{n>0}|O_{0n}|^2/(E_n-E_0)χO​=2∑n>0​∣O0n​∣2/(En​−E0​) is the static susceptibility. The finite-resolution upper bound separates an excited-population contribution, linear in ϵ\epsilonϵ, from a ground–excited coherence contribution involving denominators En−E0+ϵE_n-E_0+\epsilonEn​−E0​+ϵ. The lower bound follows by displacing the ground state along its linear-response direction. Conserved observables lose the coherence contribution; symmetry-restricted state preparation can remove dangerous transitions. A target observable error δ∗\delta_*δ∗​ consequently requires, at leading order, ϵ≲δ∗2/(2χO)\epsilon\lesssim\delta_*^2/(2\chi_O)ϵ≲δ∗2​/(2χO​).
Classical numerical demonstrations cover VQE on a 12-site Ising chain, DMRG on two separating hydrogen chains, and noisy Krylov diagonalisation of LiF. Reported examples include spin contamination ⟨S2⟩=1\langle S^2\rangle=1⟨S2⟩=1 at 0.34 mEh0.34\,\mathrm{m}E_h0.34mEh​ energy error and a 16-debye dipole error at 1.4 mEh1.4\,\mathrm{m}E_h1.4mEh​. Symmetry-preserving or detuned comparisons avoid these failures.
The radius is a worst-case compatibility statement, not a prediction that optimisation attains that error. The susceptibility asymptotic applies at small resolution relative to the relevant gap; finite-resolution bounds are capped when gaps become unresolved. Numerical figures select the largest observable error among near-best-energy runs, and the analysis assumes an energy-error certificate relative to the true ground energy.
We propose a variational quantum algorithm for estimating microcanonical expectation values in models obeying the eigenstate thermalization hypothesis. Using a relaxed criterion for convergence of the variational optimization loop, the algorithm generates weakly entangled superpositions of eigenstates at a given target energy density. An ensemble of these variational states is then used to estimate microcanonical averages of local operators, with an error whose dominant contribution decreases initially as a power law in the size of the ensemble and is ultimately limited by a small bias. We apply the algorithm to the one-dimensional mixed-field Ising model, where it converges for ansatz circuits of depth roughly linear in system size. The most accurate thermal estimates are produced for intermediate energy densities. In our error analysis, we find connections with recent works investigating the underpinnings of the eigenstate thermalization hypothesis. In particular, the failure of energy-basis matrix elements of local operators to behave as independent random variables is a potential source of error that the algorithm can overcome by averaging over an ensemble of variational states.
Abstract Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. We compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM’s quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y -rotations on all qubits.
The extension of the Rayleigh-Ritz variational principle to ensemble states ρw≡∑kwk|Ψk⟩⟨Ψk| with fixed weights wk lies ultimately at the heart of several recent methodological developments for targeting excitation energies by variational means. Prominent examples are density and density matrix functional theory, Monte Carlo sampling, state-average complete active space self-consistent field methods and variational quantum eigensolvers. In order to provide a sound basis for all these methods and to improve their current implementations, we prove the validity of the underlying critical hypothesis: Whenever the ensemble energy is well-converged, the same holds true for the ensemble state ρw as well as the individual eigenstates |Ψk⟩ and eigenenergies Ek . To be more specific, we derive linear bounds d−ΔEw≤ΔQ≤d+ΔEw on the errors ΔQ of these sought-after quantities. A subsequent analytical analysis and numerical illustration proves the tightness of our universal inequalities. Our results and particularly the explicit form of d±≡d±(Q)(w,E) provide valuable insights into the optimal choice of the auxiliary weights wk in practical applications.
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 quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the one-dimensional transverse field Ising model through a combined perspective that includes exact diagonalisation, variational quantum eigensolver (VQE) simulations, and simulations on realistic physical quantum devices. We focus on a lattice of four spins, where we calculate the ground-state energies, magnetic order parameters and correlation functions at uniformly applied conditions, which is repeated by all systems. Precise diagonalisation provides both a benchmark, which is symmetry-conserving, and a depth-two, physics inspired variational approximation, which provides simulations accessible to hardware. The circuits that have been optimised identically are then placed on the IQM Garnet quantum processor, using a resource-efficient batched protocol. We find that the ground-state energies of shallow variational circuits are reliably captured by the circuit over the entire parameter space; the magnetic arrangement parameters and observables sensitive to correlation signal significantly more noise. The error analysis of quantitative analysis reveals a strong broadening of critical crossover on hardware, which is consistent with the noise attenuation of long-range correlations. These findings highlight the current capabilities as well as the fundamental limitations of noisy intermediate-scale quantum systems in modelling quantum critical phenomena as a benchmark to future enhancements in obtaining quantum hardware and quantum algorithms development.
Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available numerical methods, in particular those based on variational Monte Carlo simulations, become exponentially more challenging with increasing system size. Recently quantum algorithms implemented as variational models have been proposed to accelerate such simulations. The variational ansatz states are characterized by a polynomial number of parameters devised in a way to minimize the expectation value of a given Hamiltonian, which is emulated by local measurements. In this study, we develop a means to certify the termination of variational algorithms. We demonstrate our approach by applying it to three models: the transverse field Ising model, the model of one-dimensional spinless fermions with competing interactions, and the Schwinger model of quantum electrodynamics. By means of comparison, we observe that our approach shows better performance near critical points in these models. We hence take a further step to improve the applicability and to certify the results of variational quantum simulators.