pith. sign in

arxiv: 1907.10070 · v1 · pith:V2H5SL4Cnew · submitted 2019-07-23 · 🪐 quant-ph

Phase estimation with randomized Hamiltonians

Pith reviewed 2026-05-24 17:18 UTC · model grok-4.3

classification 🪐 quant-ph
keywords phase estimationrandomized Hamiltoniansimportance samplingquantum simulationchemical Hamiltoniansground statevariance reductioniterative phase estimation
0
0 comments X

The pith

Iterative phase estimation can use a different Hamiltonian at each step, chosen by importance sampling on ground-state expectations, to reduce the number of terms while keeping the estimate accurate if the system is gapped.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that randomizing which Hamiltonian is used during each iteration of phase estimation allows the precision to be adjusted dynamically and exploits ground-state knowledge to minimize variance through importance sampling. This leads to fewer terms in the Hamiltonian expansion for chemical systems. A rigorous bound shows that under a gapped Hamiltonian and low sample variance in term expectations, the randomization has negligible effect on the eigenvalue estimate and success probability. Numerical tests on two chemical Hamiltonians confirm large reductions in terms and sometimes qubits required.

Core claim

By applying a different Hamiltonian in each step of the simulation circuit and selecting terms via importance sampling based on ground state expectations, the variance of the phase estimate is minimized, and if the Hamiltonian is gapped with sufficiently small sample variance, the process negligibly affects the estimate and success probability of phase estimation.

What carries the argument

Randomized Hamiltonians selected by importance sampling in iterative phase estimation, which varies the simulation Hamiltonian across repetitions to exploit ground-state term expectations.

If this is right

  • Substantial reductions in the number of Hamiltonian terms for simulating chemical systems.
  • Possible reduction in the number of qubits needed for the simulation in some cases.
  • The method applies to any simulation algorithm used within phase estimation.
  • The impact on estimate accuracy remains negligible when the gap condition and variance condition hold.
  • Precision of the Hamiltonian can be changed as phase estimation precision increases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the variance condition holds for many molecular Hamiltonians, this could lower resource requirements for quantum chemistry simulations on near-term devices.
  • Testing the approach on larger systems could reveal whether qubit reductions generalize beyond the two examples.
  • The agnosticism to the simulator suggests it could integrate with future improved simulation methods.
  • The technique might combine with other variance-reduction methods in quantum algorithms, though this is not tested in the work.

Load-bearing premise

The Hamiltonian is gapped and the sample variance in the ground state expectation values of the Hamiltonian terms is sufficiently small.

What would settle it

Running the randomized phase estimation on a gapped Hamiltonian where the sample variance of term expectations is large and observing a substantial degradation in the eigenvalue estimate accuracy or success probability compared to the non-randomized case.

Figures

Figures reproduced from arXiv: 1907.10070 by Christopher E. Granade, Ian D. Kivlichan, Nathan Wiebe.

Figure 1
Figure 1. Figure 1: FIG. 1. Quantum circuit for performing iterative phase estimation. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2 [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript generalizes iterative phase estimation to allow a different Hamiltonian at each simulation step, with importance sampling used to select terms based on ground-state expectations in order to minimize variance. It asserts a rigorous guarantee that, when the Hamiltonian is gapped and the sample variance of the ground-state term expectations is sufficiently small, the randomization has negligible effect on the phase estimate and success probability. Numerical results are reported for two chemical Hamiltonians, showing substantial reductions in the number of terms and, in one case, a reduction in the number of qubits required. The method is presented as agnostic to the underlying simulation algorithm.

Significance. If the stated conditional guarantee can be verified, the approach offers a practical route to lowering the effective cost of Hamiltonian simulation within phase estimation by sparsifying the operator via importance sampling, while preserving accuracy under explicit assumptions on the gap and variance. The numerical demonstrations of term and qubit reduction on chemical systems provide concrete evidence of potential resource savings, and the algorithm-agnostic framing increases the result's reach. Credit is due for explicitly conditioning the claim on measurable properties of the ground state rather than hiding dependencies.

major comments (1)
  1. [Abstract / proof section] Abstract and main text: the central rigorous claim—that the randomization has negligible impact on the estimate and success probability—is asserted under the gapped-Hamiltonian and low sample-variance conditions, yet the full derivation, explicit error bounds, and the precise translation from variance to success-probability degradation are not supplied; without this derivation the load-bearing guarantee cannot be assessed.
minor comments (2)
  1. [Abstract] The abstract refers to 'two chemical Hamiltonians' without naming them or citing the specific systems; this information should be added for reproducibility.
  2. [Numerical experiments] Numerical results mention 'substantial reductions' and 'one case' of qubit reduction; the precise term counts, qubit counts, and the selection criterion used for the importance-sampling probabilities should be tabulated for both Hamiltonians.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying the need for greater explicitness in the central rigorous claim. We address the single major comment below.

read point-by-point responses
  1. Referee: [Abstract / proof section] Abstract and main text: the central rigorous claim—that the randomization has negligible impact on the estimate and success probability—is asserted under the gapped-Hamiltonian and low sample-variance conditions, yet the full derivation, explicit error bounds, and the precise translation from variance to success-probability degradation are not supplied; without this derivation the load-bearing guarantee cannot be assessed.

    Authors: We agree that the manuscript asserts the guarantee under the gapped-Hamiltonian and low-variance conditions but does not supply the full derivation, explicit error bounds, or the precise mapping from sample variance to degradation in success probability. This omission prevents independent verification of the claim. In the revised manuscript we will insert a dedicated proof section (or appendix) that derives the error bounds from first principles, shows how the variance threshold controls the deviation in the phase estimate, and quantifies the resulting effect on success probability. The added material will be self-contained and will make the conditional guarantee fully assessable. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents a conditional rigorous guarantee: if the Hamiltonian is gapped and the sample variance in ground-state term expectations is sufficiently small, then randomized importance sampling has negligible effect on the phase estimate and success probability. These conditions are external domain assumptions, not quantities defined or fitted by the method. No derivation step reduces by construction to its own inputs, no self-citation is load-bearing for the central claim, and no ansatz or uniqueness theorem is smuggled in. Numerical results on chemical Hamiltonians supply independent empirical support for term (and qubit) reduction. The argument is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on two domain assumptions about the Hamiltonian; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption The Hamiltonian is gapped
    Invoked as the first condition under which the rigorous guarantee holds.
  • domain assumption Sample variance in the ground state expectation values of the Hamiltonian terms is sufficiently small
    Invoked as the second condition required for negligible impact on the phase estimate.

pith-pipeline@v0.9.0 · 5741 in / 1233 out tokens · 25091 ms · 2026-05-24T17:18:08.678801+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

31 extracted references · 31 canonical work pages · 2 internal anchors

  1. [1]

    Aspuru-Guzik, A

    A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Science 309, 1704 (2005)

  2. [2]

    McArdle, S

    S. McArdle, S. Endo, A. Aspuru-Guzik, S. Benjamin, and X. Yuan, arXiv preprint arXiv:1808.10402 (2018)

  3. [3]

    Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. Johnson, M. Kieferov´ a, I. D. Kivlichan, T. Menke, B. Peropadre, N. P. Sawaya, et al. , arXiv preprint arXiv:1812.09976 (2018)

  4. [4]

    Babbush, N

    R. Babbush, N. Wiebe, J. McClean, J. McClain, H. Neven, and G. K.-L. Chan, Phys. Rev. X 8, 011044 (2018)

  5. [5]

    S. P. Jordan, K. S. M. Lee, and J. Preskill, Science 336, 1130 (2012)

  6. [6]

    Helgaker, P

    T. Helgaker, P. Jorgensen, and J. Olsen, Molecular Electronic-Structure Theory (John Wiley & Sons, 2014)

  7. [7]

    J. A. Pople, Rev. Mod. Phys. 71, 1267 (1999)

  8. [8]

    I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, W. Sun, Z. Jiang, N. Rubin, A. Fowler, A. Aspuru-Guzik, et al. , arXiv preprint arXiv:1902.10673 (2019)

  9. [9]

    A. M. Childs, A. Ostrander, and Y. Su, arXiv preprint arXiv:1805.08385 (2018)

  10. [10]

    Campbell, arXiv preprint arXiv:1811.08017 (2018)

    E. Campbell, arXiv preprint arXiv:1811.08017 (2018)

  11. [11]

    Giovannetti, S

    V. Giovannetti, S. Lloyd, and L. Maccone, Science 306, 1330 (2004)

  12. [12]

    B. L. Higgins, D. W. Berry, S. D. Bartlett, H. M. Wiseman, and G. J. Pryde, Nature 450, 393 (2007)

  13. [13]

    D. W. Berry, B. L. Higgins, S. D. Bartlett, M. W. Mitchell, G. J. Pryde, and H. M. Wiseman, Phys. Rev. A 80, 052114 (2009)

  14. [14]

    A. Y. Kitaev, arXiv preprint arXiv:9511026 (1995)

  15. [15]

    Kimmel, G

    S. Kimmel, G. H. Low, and T. J. Yoder, Phys. Rev. A 92, 062315 (2015)

  16. [16]

    K. M. Svore, M. B. Hastings, and M. Freedman, Quantum Information & Computation 14, 306 (2014)

  17. [17]

    Wiebe and C

    N. Wiebe and C. Granade, Phys. Rev. Lett. 117, 010503 (2016)

  18. [18]

    Paesani, A

    S. Paesani, A. A. Gentile, R. Santagati, J. Wang, N. Wiebe, D. P. Tew, J. L. O’Brien, and M. G. Thompson, Phys. Rev. Lett. 118, 100503 (2017)

  19. [19]

    Wecker, B

    D. Wecker, B. Bauer, B. K. Clark, M. B. Hastings, and M. Troyer, Phys. Rev. A 90, 022305 (2014)

  20. [20]

    Poulin, M

    D. Poulin, M. B. Hastings, D. Wecker, N. Wiebe, A. C. Doherty, and M. Troyer, Quantum Info. Comput. 15, 361 (2015)

  21. [21]

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Phys. Rev. Lett. 114, 090502 (2015)

  22. [22]

    G. H. Low and I. L. Chuang, arXiv preprint arXiv:1610.06546 (2016)

  23. [23]

    Peruzzo, J

    A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, Nature Communications 5, 1 (2014)

  24. [24]

    J. R. McClean, I. D. Kivlichan, K. J. Sung, D. S. Steiger, Y. Cao, C. Dai, E. S. Fried, C. Gidney, B. Gimby, P. Gokhale, T. H¨ aner, T. Hardikar, V. Havl´ ıˇ cek, C. Huang, J. Izaac, Z. Jiang, X. Liu, M. Neeley, T. O’Brien, I. Ozfidan, M. D. Radin, J. Romero, N. Rubin, N. P. D. Sawaya, K. Setia, S. Sim, K. Sung, M. Steudtner, Q. Sun, W. Sun, F. Zhang, and ...

  25. [25]

    J. M. Turney, A. C. Simmonett, R. M. Parrish, E. G. Hohenstein, F. A. Evangelista, J. T. Fermann, B. J. Mintz, L. A. Burns, J. J. Wilke, M. L. Abrams, N. J. Russ, M. L. Leininger, C. L. Janssen, E. T. Seidl, W. D. Allen, H. F. Schaefer, R. A. King, E. F. Valeev, C. D. Sherrill, and T. D. Crawford, Wiley Interdisciplinary Reviews: Computational Molecular S...

  26. [26]

    Let the Hamiltonian be a sum of L simulable Hamiltonians Hℓ, H = ∑L ℓ=1 Hℓ

    Subsampling Hamiltonians We first consider the case where terms are sampled uniformly from the Hamiltonian. Let the Hamiltonian be a sum of L simulable Hamiltonians Hℓ, H = ∑L ℓ=1 Hℓ. Throughout we consider an eigenstate|ψ⟩ of H and its corresponding eigenenergy E. From the original, we can construct a new Hamiltonian Hest = L m m∑ i=1 Hℓi (A1) by uniforml...

  27. [27]

    (C2) We would like to determine the maximum possible change in the posterior mean under this shifted likelihood

    Shifts in the joint likelihood The random Hamiltonians for each experiment lead to a random shift in the joint likelihood of a series of outcomes P′(⃗ o|φ; ⃗M ,⃗θ) = P (⃗ o|φ; ⃗M ,⃗θ) + δ(φ). (C2) We would like to determine the maximum possible change in the posterior mean under this shifted likelihood. We will work under the assumption that the mean shif...

  28. [28]

    Shift in the posterior mean We make use of the assumption that |¯δ|≤ P (⃗ o)/2 to bound the shift in the posterior mean. Lemma 6. Assuming in addition to the assumptions of Lemma 5 that |¯δ|≤ P (⃗ o)/2, the difference between the the posterior mean that one would see with the ideal likelihood function and the perturbed likelihood function is at most |¯φ− ¯...

  29. [29]

    Theorem 7

    Acceptable shifts in the phase The final question we are interested in is what the bound on the shift in the posterior mean is in terms of shifts in the phase. Theorem 7. If the assumptions of Lemma 6 hold, for all j and x∈ [−π, π) P (oj|θ; x, θj) = 1+(−1)oj cos(Mj(θj−x)) 2 , for each of the N experiments we have that the eigenphases {φ′ j : j = 1 , . . . ...

  30. [30]

    Let us say the jth experiment has Mj repetitions

    F ailure probability of the algorithm For phase estimation, we can reduce the variance of the estimate in the phase by randomizing within the repetitions for each experiment. Let us say the jth experiment has Mj repetitions. Within each repetition, we randomly generate a new Hamiltonian Hk. Each Hamiltonian Hk has a slightly different ground state and ener...

  31. [31]

    Phase shifts due to Hamiltonian errors We can generalize the analysis of the difference in the phase by determining the difference between the desired (adiabatic) unitary and the true one. Evolving under M random Hamiltonians in sequence, the unitary applied for each new Hamiltonian Hk is Uk = exp(−iHk∆t) = ∑ ℓ |ψk ℓ⟩⟨ ψk ℓ| e−iEk ℓ ∆t, (D10) while the adia...