Efficient quantum phase estimation with adaptive entanglement-assisted Hadamard test
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: I'm Kai, and with me are Mira and Lev, guest researcher.
Mira: Today's paper: "Efficient quantum phase estimation with adaptive entanglement-assisted Hadamard test".
Kai: The adaptive entanglement-assisted Hadamard test (AEHT) is proposed as an efficient method for high-precision quantum phase estimation that overcomes the limitations of conventional fixed-amplification entanglement-assisted Hadamard tests by iteratively refining…
Mira: First, who's behind it and why it matters.
Paper summary: Kai: So, to recap the main point of this paper on "Efficient quantum phase estimation with adaptive entanglement-assisted Hadamard test," they propose an algorithm that iteratively refines the reference phase to get stronger amplification as each round goes.
Mira: That iterative refinement is what enables them to overcome the limitations of conventional entanglement-assisted Hadamard tests, which are inefficient in high-precision regimes because their feasible amplification is fundamentally limited by how accurate you can keep your initial reference phase.
Kai: Specifically, they address the problem that a coarse reference phase only allows for small amplification, so they introduce this adaptive approach to keep the shot counts under control even when aiming for high accuracy.
Mira: They also look at scenarios where the state preparation isn't perfect and there is an amplitude-induced bias that can persist with standard tests, and they show how the AEHT can suppress this bias by managing it round by round.
Lev: From a theoretical standpoint, they are using GHZ amplification to trade for fewer shot counts compared to fixed-m EHT, which is important because the shot count measure itself doesn't account for how many qubits you actually have available on the processor.
Kai: And they quantify this by showing that while fixed-m EHT scales as O(one/ϵ two) in terms of device restarts, the AEHT scheme keeps the per-round shot budget roughly constant, leading to a total restart count scaling only as O(one/ϵ) <ref:2610.01772#pg1>.
Mira: That shift from quadratic dependence on precision to linear dependence seems like a big practical win for anyone trying to run these kinds of experiments on current quantum hardware.
Kai: It means that instead of needing exponentially more coherence time or an astronomical number of shots, we can achieve high precision with this adaptive method by intelligently managing the amplification process.
Lev: The paper sets the stage by showing how to handle both the estimation error and the preparation error separately, which is a key step when you're trying to design protocols that work on noisy systems.
Kai: And they even show how large they can make those entangled states, going up to m equals one thousand two hundred fifty when aiming for an accuracy of epsilon equals ten to the power minus four. That shows the potential for this method.
Conclusion: Kai: So, wrapping up on "Efficient quantum phase estimation with adaptive entanglement-assisted Hadamard test," the main thing is that they gave us a smarter way to estimate phases using entanglement assistance.
Mira: The authors managed to decouple the preparation error from the statistical error and amplitude-induced bias, which was a crucial technical step in making this method viable for real noisy systems.
Kai: This means we can unlock the power of large entangled states that were previously out of reach because they couldn't handle a coarse reference phase.
Mira: The implication is that for near-term quantum processors, this method offers a hardware-aware path to precision phase estimation with substantially reduced device restart overhead compared to other known methods.
Kai: It’s about taking the complexity out of the estimation process by making it adaptive rather than just relying on a fixed setup.
Mira: So, the paper suggests that if you want high precision phase estimation on current hardware, focusing on dynamically improving your reference phase is a much more realistic strategy than using static methods.
Lev: For someone building hardware, this means they can design their protocol knowing they need to manage those iterative steps to get the best results with less overall system downtime.
Kai: And for the broader field, it demonstrates how you can leverage entanglement assistance in a way that scales much better with precision demands than what we saw in previous literature.
Mira: The AEHT offers a concrete way forward by showing how to handle preparation imperfections gracefully within the framework of quantum phase estimation without incurring an unmanageable bias floor.
Hengzhun Chen, Benchi Zhao, * and Yingzhou Li
School of Mathematical Sciences, Fudan University · QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong · Shanghai Key Laboratory for Contemporary Applied Mathematics
quant-ph
Submitted: 2026-10-01
Updated: 2026-10-01
Comments: 18 pages, 7 figures
Code: https://github.com/HengzhunChen/EntangleHT
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 87/100
The gist: The adaptive entanglement-assisted Hadamard test (AEHT) is proposed as an efficient method for high-precision quantum phase estimation that overcomes the limitations of conventional
Key concepts
- Quantum Phase Estimation (QPE)
- QPE is a core quantum algorithm used to estimate the phase of a unitary operation applied to a quantum state. It is crucial for many advanced quantum computations, but conventional methods require long coherence times that are highly sensitive to noise and precision demands.
- Entanglement-Assisted Hadamard Test (EHT)
- The EHT uses an entangled state, specifically an m-qubit GHZ state, to estimate a phase more efficiently than standard tests. This entanglement helps reduce the number of required measurements needed to achieve a desired level of accuracy.
- Device-Restart Count
- This metric measures the total number of times the quantum device needs to be restarted to complete a calculation, rather than just individual measurement shots. The AEHT aims to significantly lower this count compared to fixed methods, making it more practical for current quantum hardware.
Terminology
Summary
The adaptive entanglement-assisted Hadamard test (AEHT) is proposed as an efficient method for high-precision quantum phase estimation that overcomes the limitations of conventional fixed-amplification entanglement-assisted Hadamard tests by iteratively refining the reference phase to enable progressively stronger amplification, leading to a device-restart count scaling as O(1/ϵ) instead of O(1/ϵ 2) in the hardware-unconstrained regime.
Introduction and Motivation
Quantum phase estimation (QPE) is fundamental for many quantum algorithms, but conventional QPE demands coherence times that scale exponentially with desired precision and are highly sensitive to experimental noise. Standard Hadamard test (SHT) provides a practical alternative, requiring O(1/ϵ 2) shot counts to estimate a phase to accuracy ϵ. Entanglement-assisted Hadamard test (EHT) uses an m-qubit Greenberger-Horne-Zeilinger (GHZ) entangled state to reduce the required shot counts to O(1/(mϵ) 2). However, the feasibility of large GHZ states is limited because a coarse reference phase permits only a small amplification, preventing the direct use of large GHZ states even when sufficient hardware resources are available. The AEHT addresses this by iteratively refining the reference phase, enabling progressively stronger amplification as the iteration goes by.
Adaptive Entanglement-Assisted Hadamard Test (AEHT)
The AEHT starts from a coarse reference phase and uses a modestly sized GHZ state whose amplification is safe given the current uncertainty. The measurements sharpen the estimate, and this improved estimate becomes the reference for the next round. This process allows for progressively larger amplification as the reference improves, keeping required shot counts under control even at high precision. The algorithm is structured iteratively over T rounds to achieve a total accuracy of ϵ with a success probability of at least 1 − pfail.
Error Analysis and Bias Suppression
When the prepared state is imperfect, the measured overlap takes the form ρeiθψ ψ, where ρ = ⟨ψUψ⟩ is the amplitude. This introduces an amplitude-induced bias εbias which persists even if shot counts increase, unlike statistical error εstat which can be controlled. The AEHT separates the irreducible preparation error from the reducible algorithmic error by iteratively updating the reference phase and jointly optimizing amplification level and shot count. The protocol ensures that the amplitude-induced algorithmic bias is forced to remain within its prescribed round-wise bias budget, which is managed by choosing an amplification mt based on binary search over feasible values.
Device-Restart Count Comparison
The cost of quantum phase estimation is measured by the device-restart count rather than shot count, as this accounts for parallel execution capacity on a finite qubit budget. For fixed-m EHT, the restart count grows as O(1/ϵ 2). In contrast, the AEHT scheme keeps the perround shot budget roughly constant, leading to a total restart count that grows only as O(1/ϵ), up to doubly logarithmic factors. This demonstrates that the AEHT method achieves a superlinear reduction in device-restart count compared with fixed-m EHT in the high-precision regime.
Hardware Constraints and Robustness
The choice of amplification mt is constrained by both the reference error bound ∆t and the hardware capability, where mt = min mideal t, mhw. When saturation occurs at the hardware limit mhw, both schemes operate with a fixed bounded amplification, but AEHT still maintains a constant-factor advantage over fixed-m EHT in this regime. Numerical experiments confirm the effectiveness of the proposed AEHT compared with conventional methods under this measure, showing its robustness under representative circuit noise. The actual AEHT error follows its upper bound and produces an increasingly accurate phase estimate as the device-restart count increases, unlike conventional methods which exhibit a nonvanishing bias floor.
Conclusion
The proposed AEHT provides a hardware-aware route to precision phase estimation with substantially reduced devicerestart overhead on near-term quantum processors. The method unlocks the amplification power of large entangled states, and the maximum amplification of the AEHT method increases from m = 11 at target accuracy ϵ = 10−2 to m = 1250 at target accuracy ϵ = 10−4. The AEHT successfully separates the irreducible preparation error from the statistical error and amplitude-induced bias, which is key to its superior performance. The proposed method provides a hardware-aware route to precision phase estimation with substantially reduced devicerestart overhead on near-term quantum processors.
Improvements for AI systems
- Bold header: Adaptive Phase Estimation for High-Precision QPE
The AEHT algorithm iteratively refines the reference phase, enabling progressively stronger amplification as the iteration goes by,
which allows near-term quantum processors to estimate high-precision quantum phases more efficiently than conventional fixed-amplification EHT.
- Bold header: Bias Suppression in Imperfect State Preparation
By implementing the AEHT, the method suppresses this bias
arising from imperfect eigenstate preparation, ensuring that the estimation error continues to decrease round by round even when the amplitude is unknown and not exactly one.
- Bold header: Hardware-Aware Cost Metric for Quantum Algorithms
The transition from shot count to device-restart count quantifies realization cost better, showing that AEHT yields a restart count that grows only as O(1/ϵ), up to doubly logarithmic corrections
in the hardware unconstrained regime, offering a constant-factor advantage over a fixed-amplification method.
- Bold header: Robust Phase Estimation under Circuit Noise
The adaptive protocol demonstrates robustness against circuit noise by ensuring the amplitude-induced algorithmic bias is forced to remain within the prescribed round-wise bias budget,
preventing an error floor that plagues conventional fixed-amplification tests.
- Bold header: Optimal Amplification Selection Strategy
The paper introduces Algorithm 4 (MINRESTARTAMP) to select the amplification factor by minimizing packed restarts, choosing the feasible amplification with the smallest packed restart count
while respecting both branch and hardware constraints.
Abstract
The entanglement-assisted Hadamard test (EHT) is a practical method for estimating a quantum phase by amplifying the phase signal. However, the feasible amplification is fundamentally limited by the accuracy of the reference phase, such that the method is inefficient in the high-precision regime. In this work, we propose an algorithm, called adaptive entanglement-assisted Hadamard test (AEHT), that iteratively refines the reference phase, enabling progressively stronger amplification as the iteration goes by. We further consider the imperfect eigenstate preparation scenario, where a systematic bias is unavoidable when estimating the quantum phase with the conventional EHT. Such a bias can be suppressed by the proposed AEHT. Moreover, taking physical implementation into consideration, we adopt device-restart count to measure the cost of quantum phase estimation, rather than shot count. The numerical experiments confirm the effectiveness of the proposed AEHT compared with conventional methods under this measure. By unlocking the full amplification power of large entangled states, this work offers an efficient method to estimate high-precision quantum phase on near-term quantum processors.
Sources
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity