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:2009.13140 · Bulletin of the American Physical Society

Quantum computed moments correction to variational estimates

Harish J. Vallury, Jones, Michael A., Charles D. Hill, Lloyd C. L. Hollenberg

Published Sep 28, 2020• 0 citations
arXivHTMLPDF

Abstract

The variational principle of quantum mechanics is the backbone of hybrid quantum computing for a range of applications. However, as the problem size grows, quantum logic errors and the effect of barren plateaus overwhelm the quality of the results. There is now a clear focus on strategies that require fewer quantum circuit steps and are robust to device errors. Here we present an approach in which problem complexity is transferred to dynamic quantities computed on the quantum processor - Hamiltonian moments, $\langle H^n\rangle$. From these quantum computed moments, estimates of the ground-state energy are obtained using the "infinum" theorem from Lanczos cumulant expansions which manifestly correct the associated variational calculation. With system dynamics encoded in the moments the burden on the trial-state quantum circuit depth is eased. The method is introduced and demonstrated on 2D quantum magnetism models on lattices up to 5 $\times$ 5 (25 qubits) implemented on IBM Quantum superconducting qubit devices. Moments were quantum computed to fourth order with respect to a parameterised antiferromagnetic trial-state. A comprehensive comparison with benchmark variational calculations was performed, including over an ensemble of random coupling instances. The results showed that the infinum estimate consistently outperformed the benchmark variational approach for the same trial-state. These initial investigations suggest that the quantum computed moments approach has a high degree of stability against trial-state variation, quantum gate errors and shot noise, all of which bodes well for further investigation and applications of the approach.

DOI
10.48550/arxiv.2009.13140

Related papers

Moments-Based Corrections to Variational Quantum Computation

Michael A. Jones

Quantum Computing offers the potential to efficiently solve problems for which there are no known, efficient classical solutions such as factoring of semi-prime numbers and simulation of quantum- mechanical systems. This work considers a novel moments-based adaptation of the Variational Quantum Eigensolver (VQE), one of the leading candidates for demonstrating quantum supremacy. The method for improving the estimated ground state energy of a quantum system, obtained using the Variational Quantum Eigensolver, is presented and tested for Heisenberg model systems using IBM’s superconducting quantum devices. The method is based on the application of a Lanczos expansion technique based on the computation of Hamiltonian moments and is found to offer better accuracy than conventional VQE for most cases considered, allowing for a simpler trial state and offsetting the effects of noise.

•Jan 1, 2020•1 citation

Noise-robust ground state energy estimates from deep quantum circuits

Harish J. Vallury, Michael A. Jones, Gregory A. L. White +3 more

In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to 500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.

arXiv:2211.08780•Quantum•Sep 11, 2023•8 citations

Ground-state-energy calculation for the water molecule on a superconducting quantum processor

Michael A. Jones, Harish J. Vallury, Lloyd C. L. Hollenberg

The accurate computation of properties of large molecular systems is classically infeasible and is one of the applications in which it is hoped that quantum computers will demonstrate an advantage over classical devices. However, due to the limitations of present-day quantum hardware, variational-hybrid algorithms introduced to tackle these problems struggle to meet the accuracy and precision requirements of chemical applications. Here, we apply the quantum computed moments (QCM) approach combined with a variety of noise-mitigation techniques to an eight qubit and spin-orbital representation of the water molecule (${\text{H}}_{2}\text{O}$). A noise-stable improvement on the variational result for a four-excitation trial state (circuit depth 25, 22 cz gates) was obtained, with the ground-state energy computed to be within $1.0\ifmmode\pm\else\textpm\fi{}0.8$ mHa of exact diagonalization in the 14 spin-orbital basis. Thus, the QCM approach, despite an increased number of measurements and noisy quantum hardware (cz error rates c.0.3% corresponding to expected error rates on the trial-state circuit of order 7%), is able to determine the ground-state energy of a nontrivial molecular system at the required accuracy (c.0.05%). To the best of our knowledge, these results are the largest calculations performed on a physical quantum computer to date to achieve millihartree agreement with exact diagonalization, and a promising indicator of how such hybrid approaches might scale to problems of interest in the low-error and fault-tolerant regimes as quantum computers develop.

arXiv:2311.02533•Physical Review Applied•Jun 7, 2024•9 citations

Chemistry beyond the Hartree–Fock energy via quantum computed moments

Michael A. Jones, Harish J. Vallury, Charles D. Hill +1 more

Quantum computers hold promise to circumvent the limitations of conventional computing for difficult molecular problems. However, the accumulation of quantum logic errors on real devices represents a major challenge, particularly in the pursuit of chemical accuracy requiring the inclusion of electronic correlation effects. In this work we implement the quantum computed moments (QCM) approach for hydrogen chain molecular systems up to H[Formula: see text]. On a superconducting quantum processor, Hamiltonian moments, [Formula: see text] are computed with respect to the Hartree-Fock state, which are then employed in Lanczos expansion theory to determine an estimate for the ground-state energy which incorporates electronic correlations and manifestly improves on the direct energy measurement. Post-processing purification of the raw QCM data takes the estimate below the Hartree-Fock energy to within 99.9% of the exact electronic ground-state energy for the largest system studied, H[Formula: see text]. Calculated dissociation curves indicate precision at about 10mH for this system and as low as 0.1mH for molecular hydrogen, H[Formula: see text], over a range of bond lengths. In the context of stringent precision requirements for chemical problems, these results provide strong evidence for the error suppression capability of the QCM method, particularly when coupled with post-processing error mitigation. While calculations based on the Hartree-Fock state are tractable to classical computation, these results represent a first step towards implementing the QCM method in a quantum chemical trial circuit. Greater emphasis on more efficient representations of the Hamiltonian and classical preprocessing steps may enable the solution of larger systems on near-term quantum processors.

arXiv:2111.08132•Scientific Reports•May 28, 2022•27 citations

Quantum computation, quantum chemistry and Hamiltonian moments

Michael Alexander Jones

While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.

•Jan 1, 2025•0 citations

Hybrid Quantum-Classical Algorithms for Quantum Computing Applications in Computational Physics

Julian Schuhmacher

Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.

•Jan 1, 2026•0 citations
The variational principle of quantum mechanics is the backbone of hybrid quantum computing for a range of applications. However, as the problem size grows, quantum logic errors and the effect of barren plateaus overwhelm the quality of the results. There is now a clear focus on strategies that require fewer quantum circuit steps and are robust to device errors. Here we present an approach in which problem complexity is transferred to dynamic quantities computed on the quantum processor - Hamiltonian moments, ⟨Hn⟩\langle H^n\rangle⟨Hn⟩. From these quantum computed moments, estimates of the ground-state energy are obtained using the "infinum" theorem from Lanczos cumulant expansions which manifestly correct the associated variational calculation. With system dynamics encoded in the moments the burden on the trial-state quantum circuit depth is eased. The method is introduced and demonstrated on 2D quantum magnetism models on lattices up to 5 ×\times× 5 (25 qubits) implemented on IBM Quantum superconducting qubit devices. Moments were quantum computed to fourth order with respect to a parameterised antiferromagnetic trial-state. A comprehensive comparison with benchmark variational calculations was performed, including over an ensemble of random coupling instances. The results showed that the infinum estimate consistently outperformed the benchmark variational approach for the same trial-state. These initial investigations suggest that the quantum computed moments approach has a high degree of stability against trial-state variation, quantum gate errors and shot noise, all of which bodes well for further investigation and applications of the approach.
Quantum Computing offers the potential to efficiently solve problems for which there are no known, efficient classical solutions such as factoring of semi-prime numbers and simulation of quantum- mechanical systems. This work considers a novel moments-based adaptation of the Variational Quantum Eigensolver (VQE), one of the leading candidates for demonstrating quantum supremacy. The method for improving the estimated ground state energy of a quantum system, obtained using the Variational Quantum Eigensolver, is presented and tested for Heisenberg model systems using IBM’s superconducting quantum devices. The method is based on the application of a Lanczos expansion technique based on the computation of Hamiltonian moments and is found to offer better accuracy than conventional VQE for most cases considered, allowing for a simpler trial state and offsetting the effects of noise.
In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to 500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.
The accurate computation of properties of large molecular systems is classically infeasible and is one of the applications in which it is hoped that quantum computers will demonstrate an advantage over classical devices. However, due to the limitations of present-day quantum hardware, variational-hybrid algorithms introduced to tackle these problems struggle to meet the accuracy and precision requirements of chemical applications. Here, we apply the quantum computed moments (QCM) approach combined with a variety of noise-mitigation techniques to an eight qubit and spin-orbital representation of the water molecule (H2O{\text{H}}_{2}\text{O}H2​O). A noise-stable improvement on the variational result for a four-excitation trial state (circuit depth 25, 22 cz gates) was obtained, with the ground-state energy computed to be within $1.0\ifmmode\pm\else\textpm\fi{}0.8$ mHa of exact diagonalization in the 14 spin-orbital basis. Thus, the QCM approach, despite an increased number of measurements and noisy quantum hardware (cz error rates c.0.3% corresponding to expected error rates on the trial-state circuit of order 7%), is able to determine the ground-state energy of a nontrivial molecular system at the required accuracy (c.0.05%). To the best of our knowledge, these results are the largest calculations performed on a physical quantum computer to date to achieve millihartree agreement with exact diagonalization, and a promising indicator of how such hybrid approaches might scale to problems of interest in the low-error and fault-tolerant regimes as quantum computers develop.
Quantum computers hold promise to circumvent the limitations of conventional computing for difficult molecular problems. However, the accumulation of quantum logic errors on real devices represents a major challenge, particularly in the pursuit of chemical accuracy requiring the inclusion of electronic correlation effects. In this work we implement the quantum computed moments (QCM) approach for hydrogen chain molecular systems up to H[Formula: see text]. On a superconducting quantum processor, Hamiltonian moments, [Formula: see text] are computed with respect to the Hartree-Fock state, which are then employed in Lanczos expansion theory to determine an estimate for the ground-state energy which incorporates electronic correlations and manifestly improves on the direct energy measurement. Post-processing purification of the raw QCM data takes the estimate below the Hartree-Fock energy to within 99.9% of the exact electronic ground-state energy for the largest system studied, H[Formula: see text]. Calculated dissociation curves indicate precision at about 10mH for this system and as low as 0.1mH for molecular hydrogen, H[Formula: see text], over a range of bond lengths. In the context of stringent precision requirements for chemical problems, these results provide strong evidence for the error suppression capability of the QCM method, particularly when coupled with post-processing error mitigation. While calculations based on the Hartree-Fock state are tractable to classical computation, these results represent a first step towards implementing the QCM method in a quantum chemical trial circuit. Greater emphasis on more efficient representations of the Hamiltonian and classical preprocessing steps may enable the solution of larger systems on near-term quantum processors.
While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.
Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.