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:1703.03597 · Chemical Physics

Direct application of the phase estimation algorithm to find the eigenvalues of the Hamiltonians

Ammar Daskin, Sabre Kais

Published Jan 4, 2018• 13 citations
arXivHTMLPDF
DOI
10.1016/j.chemphys.2018.01.002

Related papers

Estimating eigenvalues for lattice hamiltonian models

Chris J. Hamer

Physics Letters B•Mar 1, 1979•27 citations

Adiabatic Quantum Phase Estimation

Alexander Schmidhuber, Seth Lloyd

Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $ε$ in Heisenberg-limited time $T=Θ(1/ε)$. Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware. Here, we present a simple adiabatic protocol for QPE that achieves (up to logarithmic factors) the optimal Heisenberg-limited scaling $T = O\left( \frac{1}ε \log\left(δ^{-1}\right)\right)$ in both the precision $ε$ and failure probability $δ$. By encoding eigenvalues in populations of computational basis states rather than complex phases, our approach is naturally robust against certain dephasing errors. The adiabatic protocol only requires the ability to couple a single ancilla qubit to the system Hamiltonian as well as pairwise couplings within the ancilla register.

quant-pharXiv:2605.22770•May 22, 2026•0 citations

Phase estimation of local Hamiltonians on NISQ hardware

Laura Clinton, Johannes Bausch, Joel Klassen +1 more

Abstract In this work we investigate a binned version of quantum phase estimation (QPE) set out by Somma (2019 New J. Phys. 21 123025) and known as the quantum eigenvalue estimation problem (QEEP). Specifically, we determine whether the circuit decomposition techniques we set out in previous work, Clinton et al (2021 Nat. Commun. 12 1–10), can improve the performance of QEEP in the noisy intermediate scale quantum (NISQ) regime. To this end we adopt a physically motivated abstraction of NISQ device capabilities as in Clinton et al (2021 Nat. Commun. 12 1–10). Within this framework, we find that our techniques reduce the threshold at which it becomes possible to perform the minimum two-bin instance of this algorithm by an order of magnitude. This is for the specific example of a two dimensional spin Fermi-Hubbard model. For example, we estimate that the depolarizing single qubit error rate required to implement a minimum two bin example of QEEP—with a 5 × 5 Fermi-Hubbard model and up to a precision of 10 % —can be reduced from 10−7 to 10−5. We explore possible modifications to this protocol and propose an application, which we dub randomized quantum eigenvalue estimation problem (rQEEP). rQEEP outputs estimates on the fraction of eigenvalues which lie within randomly chosen bins and upper bounds the total deviation of these estimates from the true values. One use case we envision for this algorithm is resolving density of states features of local Hamiltonians.

arXiv:2110.13584•New Journal of Physics•Mar 1, 2023•14 citations

A new method for finding the phase shifts for the Schrödinger equation

T. Tietz

Acta Physica Academiae Scientiarum Hungaricae•Oct 1, 1963•4 citations

On the general problem of quantum phase estimation

G.M D'Ariano, Chiara Macchiavello, M.F Sacchi

arXiv:quant-ph/9812034•Physics Letters A•Nov 1, 1998•75 citations

Effects of Trotter Error, Digitization Error, and Initial State Overlap on Tapered Quantum Phase Estimation for Minimum Eigenvalue Computation

Elijah Pelofske, Stephan Eidenbenz

We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to $\ell=10$ phase qubits of precision with $m=3$ additional phase-register error suppression qubits, on a $4$-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.

quant-pharXiv:2609.06249•Sep 8, 2026•0 citations
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision εεε in Heisenberg-limited time T=Θ(1/ε)T=Θ(1/ε)T=Θ(1/ε). Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware. Here, we present a simple adiabatic protocol for QPE that achieves (up to logarithmic factors) the optimal Heisenberg-limited scaling T=O(1εlog⁡(δ−1))T = O\left( \frac{1}ε \log\left(δ^{-1}\right)\right)T=O(ε1​log(δ−1)) in both the precision εεε and failure probability δδδ. By encoding eigenvalues in populations of computational basis states rather than complex phases, our approach is naturally robust against certain dephasing errors. The adiabatic protocol only requires the ability to couple a single ancilla qubit to the system Hamiltonian as well as pairwise couplings within the ancilla register.
Abstract In this work we investigate a binned version of quantum phase estimation (QPE) set out by Somma (2019 New J. Phys. 21 123025) and known as the quantum eigenvalue estimation problem (QEEP). Specifically, we determine whether the circuit decomposition techniques we set out in previous work, Clinton et al (2021 Nat. Commun. 12 1–10), can improve the performance of QEEP in the noisy intermediate scale quantum (NISQ) regime. To this end we adopt a physically motivated abstraction of NISQ device capabilities as in Clinton et al (2021 Nat. Commun. 12 1–10). Within this framework, we find that our techniques reduce the threshold at which it becomes possible to perform the minimum two-bin instance of this algorithm by an order of magnitude. This is for the specific example of a two dimensional spin Fermi-Hubbard model. For example, we estimate that the depolarizing single qubit error rate required to implement a minimum two bin example of QEEP—with a 5 × 5 Fermi-Hubbard model and up to a precision of 10 % —can be reduced from 10−7 to 10−5. We explore possible modifications to this protocol and propose an application, which we dub randomized quantum eigenvalue estimation problem (rQEEP). rQEEP outputs estimates on the fraction of eigenvalues which lie within randomly chosen bins and upper bounds the total deviation of these estimates from the true values. One use case we envision for this algorithm is resolving density of states features of local Hamiltonians.
We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to ℓ=10\ell=10ℓ=10 phase qubits of precision with m=3m=3m=3 additional phase-register error suppression qubits, on a 444-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.