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

Phase estimation with randomized Hamiltonians

Ian Kivlichan, Christopher Granade, Nathan Wiebe

Published Jul 23, 2019• 18 citations
arXivHTMLPDF

Abstract

Iterative phase estimation has long been used in quantum computing to estimate Hamiltonian eigenvalues. This is done by applying many repetitions of the same fundamental simulation circuit to an initial state, and using statistical inference to glean estimates of the eigenvalues from the resulting data. Here, we show a generalization of this framework where each of the steps in the simulation uses a different Hamiltonian. This allows the precision of the Hamiltonian to be changed as the phase estimation precision increases. Additionally, through the use of importance sampling, we can exploit knowledge about the ground state to decide how frequently each Hamiltonian term should appear in the evolution, and minimize the variance of our estimate. We rigorously show, if the Hamiltonian is gapped and the sample variance in the ground state expectation values of the Hamiltonian terms sufficiently small, that this process has a negligible impact on the resultant estimate and the success probability for phase estimation. We demonstrate this process numerically for two chemical Hamiltonians, and observe substantial reductions in the number of terms in the Hamiltonian; in one case, we even observe a reduction in the number of qubits needed for the simulation. Our results are agnostic to the particular simulation algorithm, and we expect these methods to be applicable to a range of approaches.

DOI
10.48550/arxiv.1907.10070

Related papers

Randomized Quantum Algorithm for Statistical Phase Estimation

Kianna Wan, Mario Berta, Earl T. Campbell

Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyze a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent of the number of terms L in the Hamiltonian. Second, unlike previous L-independent approaches, such as those based on qDRIFT, all algorithmic errors in our method can be suppressed by collecting more data samples, without increasing the circuit depth.

arXiv:2110.12071•Physical Review Letters•Jul 13, 2022•121 citations

Resource-efficient quantum phase estimation by randomization

Youle Wang

Abstract Quantum phase estimation (QPE) is a fundamental tool in quantum computing, facilitating efficient simulations of complex problems in quantum chemistry and materials science. While most phase estimation algorithms are deterministic, recent advancements indicate that incorporating randomness can enhance performance. This study introduces a framework for randomized QPE that merges the benefits of randomized compilation with phase estimation algorithms based on quantum signal processing. Our proposed algorithms effectively reduce circuit depths by eliminating the need for precise Hamiltonian time evolution, making them advantageous for digital quantum computers estimating the eigenvalue and eigenvector properties of Hamiltonians. Notably, our findings show that the quantum stochastic drift protocol (qDRIFT)-based randomized algorithm surpasses the original phase estimation with qDRIFT, especially in scaling inverse failure probabilities. We also establish that a circuit depth of O ( log ⁡ ( M ) ) suffices for estimating M distinct observables. The protocol is executed through multiple iterations of the randomized algorithms combined with classical shadow techniques. Overall, our framework retains many advantages of the randomized compilation technique, making it a compelling solution for challenges in quantum chemistry.

Quantum Science and Technology•May 30, 2025•2 citations

Quantum expectation-value estimation by computational basis sampling

Masaya Kohda, Ryosuke Imai, Keita Kanno +3 more

Measuring expectation values of observables is an essential ingredient in variational quantum algorithms. A practical obstacle is the necessity of a large number of measurements for statistical convergence to meet requirements of precision, such as chemical accuracy in the application to quantum chemistry computations. Here we propose an algorithm to estimate the expectation value based on its approximate expression as a weighted sum of classically tractable matrix elements with some modulation, where the weight and modulation factors are evaluated by sampling appropriately prepared quantum states in the computational basis on quantum computers. Each of those states is prepared by applying a unitary transformation consisting of at most $N$ CNOT gates, where $N$ is the number of qubits, to a target quantum state whose expectation value is evaluated. Our algorithm is expected to require fewer measurements than conventional methods for a required statistical precision of the expectation value when the target quantum state is concentrated in particular computational basis states. We provide numerical comparisons of our method with existing ones for measuring electronic ground-state energies (expectation values of electronic Hamiltonians for the lowest-energy states) of various small molecules. Numerical results show that our method can reduce the numbers of measurements to obtain the ground-state energies for a targeted precision by several orders of magnitudes for molecules whose ground states are concentrated. Our results provide another route to measure expectation values of observables, which could accelerate the variational quantum algorithms.

arXiv:2112.07416•Physical Review Research•Sep 2, 2022•38 citations

Optimized Randomized Hamiltonian Simulation via Average-Error Analysis

Hayata Morisaki, Keisuke Fujii

Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed $R_z$ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.

quant-pharXiv:2609.36694•Sep 30, 2026•0 citations

Quantum simulation of Hamiltonian eigenstates

Riccardo Manenti, Mário Motta

Abstract In this chapter, we present quantum algorithms to approximate Hamiltonian eigenstates. We start discussing the quantum phase estimation algorithms, an important subroutine that allows us to approximate eigenpairs of a Hamiltonian operator given an initial guess and a quantum circuit implementing the time evolution operator. We then present the adiabatic state preparation, a technique to transform the ground state of a Hamiltonian into the ground state of another Hamiltonian. We describe two important heuristic methods, the quantum approximate optimization algorithm, and the variational quantum eigensolver. The second part of the chapter discusses concrete applications in the field of quantum chemistry. After introducing the Born-Oppenheimer Hamiltonian in second quantization and the Hartree-Fock method, we illustrate how a chemical problem can be mapped onto a quantum computer. We conclude the chapter with the simulation of the hydrogen molecule in a minimal basis with the iterative phase estimation algorithm.

Oxford University Press eBooks•Aug 25, 2023•0 citations

Statistical Quantum Phase Estimation: Extensions and Practical Considerations

Amit Surana, Brandon Allen

We present several refinements and extensions of the statistical quantum phase estimation (SQPE) framework to address some of its key practical limitations, improving its applicability to realistic cases. Recently, a family of statistical approaches for QPE have been proposed where each run uses only a few ancillae and shorter circuits than standard QPE and thus is better suited for early fault-tolerant quantum computers that are qubit-and depth-limited. SQPE method within that family estimates the cumulative distribution function (CDF) associated with spectral density of the Hamiltonian for a given trial state by using its Fourier approximation and then identifies the first jump discontinuity of the CDF to determine the ground state energy (GSE) of the Hamiltonian. It relies on random compilation procedure based on linear combination of unitaries (LCU) decomposition of the Hamiltonian assuming positive Pauli weights and requires a good estimate of lower bound on the overlap between the trial and true ground state, both of which may be difficult to achieve in practice. We address these limitations by generalizing the random compilation procedure for negative Pauli weights and employing a changepoint detection method for determining GSE which does not rely on an estimate of this overlap. We also show that by exploiting symmetry of the Fourier series one can reduce number of circuit runs/samples by a factor of 2x while keeping the GSE estimation accuracy the same. We illustrate these new developments numerically via a quantum simulator in Qiskit.

quant-pharXiv:2605.18876•May 19, 2026•0 citations
Iterative phase estimation has long been used in quantum computing to estimate Hamiltonian eigenvalues. This is done by applying many repetitions of the same fundamental simulation circuit to an initial state, and using statistical inference to glean estimates of the eigenvalues from the resulting data. Here, we show a generalization of this framework where each of the steps in the simulation uses a different Hamiltonian. This allows the precision of the Hamiltonian to be changed as the phase estimation precision increases. Additionally, through the use of importance sampling, we can exploit knowledge about the ground state to decide how frequently each Hamiltonian term should appear in the evolution, and minimize the variance of our estimate. We rigorously show, if the Hamiltonian is gapped and the sample variance in the ground state expectation values of the Hamiltonian terms sufficiently small, that this process has a negligible impact on the resultant estimate and the success probability for phase estimation. We demonstrate this process numerically for two chemical Hamiltonians, and observe substantial reductions in the number of terms in the Hamiltonian; in one case, we even observe a reduction in the number of qubits needed for the simulation. Our results are agnostic to the particular simulation algorithm, and we expect these methods to be applicable to a range of approaches.
Abstract Quantum phase estimation (QPE) is a fundamental tool in quantum computing, facilitating efficient simulations of complex problems in quantum chemistry and materials science. While most phase estimation algorithms are deterministic, recent advancements indicate that incorporating randomness can enhance performance. This study introduces a framework for randomized QPE that merges the benefits of randomized compilation with phase estimation algorithms based on quantum signal processing. Our proposed algorithms effectively reduce circuit depths by eliminating the need for precise Hamiltonian time evolution, making them advantageous for digital quantum computers estimating the eigenvalue and eigenvector properties of Hamiltonians. Notably, our findings show that the quantum stochastic drift protocol (qDRIFT)-based randomized algorithm surpasses the original phase estimation with qDRIFT, especially in scaling inverse failure probabilities. We also establish that a circuit depth of O ( log ⁡ ( M ) ) suffices for estimating M distinct observables. The protocol is executed through multiple iterations of the randomized algorithms combined with classical shadow techniques. Overall, our framework retains many advantages of the randomized compilation technique, making it a compelling solution for challenges in quantum chemistry.
Measuring expectation values of observables is an essential ingredient in variational quantum algorithms. A practical obstacle is the necessity of a large number of measurements for statistical convergence to meet requirements of precision, such as chemical accuracy in the application to quantum chemistry computations. Here we propose an algorithm to estimate the expectation value based on its approximate expression as a weighted sum of classically tractable matrix elements with some modulation, where the weight and modulation factors are evaluated by sampling appropriately prepared quantum states in the computational basis on quantum computers. Each of those states is prepared by applying a unitary transformation consisting of at most NNN CNOT gates, where NNN is the number of qubits, to a target quantum state whose expectation value is evaluated. Our algorithm is expected to require fewer measurements than conventional methods for a required statistical precision of the expectation value when the target quantum state is concentrated in particular computational basis states. We provide numerical comparisons of our method with existing ones for measuring electronic ground-state energies (expectation values of electronic Hamiltonians for the lowest-energy states) of various small molecules. Numerical results show that our method can reduce the numbers of measurements to obtain the ground-state energies for a targeted precision by several orders of magnitudes for molecules whose ground states are concentrated. Our results provide another route to measure expectation values of observables, which could accelerate the variational quantum algorithms.
Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed RzR_zRz​ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.
Abstract In this chapter, we present quantum algorithms to approximate Hamiltonian eigenstates. We start discussing the quantum phase estimation algorithms, an important subroutine that allows us to approximate eigenpairs of a Hamiltonian operator given an initial guess and a quantum circuit implementing the time evolution operator. We then present the adiabatic state preparation, a technique to transform the ground state of a Hamiltonian into the ground state of another Hamiltonian. We describe two important heuristic methods, the quantum approximate optimization algorithm, and the variational quantum eigensolver. The second part of the chapter discusses concrete applications in the field of quantum chemistry. After introducing the Born-Oppenheimer Hamiltonian in second quantization and the Hartree-Fock method, we illustrate how a chemical problem can be mapped onto a quantum computer. We conclude the chapter with the simulation of the hydrogen molecule in a minimal basis with the iterative phase estimation algorithm.
We present several refinements and extensions of the statistical quantum phase estimation (SQPE) framework to address some of its key practical limitations, improving its applicability to realistic cases. Recently, a family of statistical approaches for QPE have been proposed where each run uses only a few ancillae and shorter circuits than standard QPE and thus is better suited for early fault-tolerant quantum computers that are qubit-and depth-limited. SQPE method within that family estimates the cumulative distribution function (CDF) associated with spectral density of the Hamiltonian for a given trial state by using its Fourier approximation and then identifies the first jump discontinuity of the CDF to determine the ground state energy (GSE) of the Hamiltonian. It relies on random compilation procedure based on linear combination of unitaries (LCU) decomposition of the Hamiltonian assuming positive Pauli weights and requires a good estimate of lower bound on the overlap between the trial and true ground state, both of which may be difficult to achieve in practice. We address these limitations by generalizing the random compilation procedure for negative Pauli weights and employing a changepoint detection method for determining GSE which does not rely on an estimate of this overlap. We also show that by exploiting symmetry of the Fourier series one can reduce number of circuit runs/samples by a factor of 2x while keeping the GSE estimation accuracy the same. We illustrate these new developments numerically via a quantum simulator in Qiskit.