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

Analog Quantum Phase Estimation with Single-Mode Readout

Wei‐Chen Lin, Chiao-Hsuan Wang

Published Jun 18, 2025• 2 citations
arXivHTMLPDF

Abstract

Eigenvalue estimation is a central problem for demonstrating quantum advantage, yet its implementation on digital quantum computers remains limited by circuit depth and operational overhead. We present an analog quantum phase estimation (aQPE) protocol that extracts the eigenenergies of a target Hamiltonian via continuous time evolution and single-mode cavity measurement. By encoding eigenvalue information as conditional cavity phase-space rotations, the scheme avoids deep quantum circuits and entangling gates, while enabling readout through established cavity tomography techniques. We further illustrate the feasibility of this approach by engineering a Hamiltonian that implements aQPE of the XY model, whose ground-state energy problem is QMA-complete, within a physical architecture compatible with existing circuit quantum electrodynamics technology. Our results provide a resource-efficient and scalable framework for implementing quantum phase estimation in near-term quantum platforms.

DOI
10.48550/arxiv.2506.15668

Related papers

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

Hardware-native quantum phase estimation with circuit QED

Changchun Zhong

Quantum phase estimation is a cornerstone algorithm for determining eigenvalues of unitary operators with Heisenberg-limited precision. Conventional implementations rely on digital controlled-unitary operations together with phase-extraction circuits, which generally results in substantial circuit depth and hardware overhead. Here, we propose a hardware-native alternative that replaces digital controlled-unitary operations by analog bosonic interactions, naturally available in circuit quantum electrodynamics. The protocol extracts the phase through a sequence of binary threshold tests. A bosonic mode serves as an efficient quantum memory where the binary digits of the phase are encoded into the direction of phase-space rotations. These digits are then read out sequentially via high-fidelity homodyne measurements. We show that the protocol preserves Heisenberg scaling in estimation precision while simultaneously providing exponentially suppressed failure probability. By exploiting bosonic degrees of freedom and analog dispersive interactions, the scheme provides a hardware-efficient realization of quantum phase estimation and establishes a natural route toward implementing high-precision phase estimation on circuit quantum electrodynamics platforms.

quant-pharXiv:2606.22071•Jun 23, 2026•0 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

Phase Estimation with Compressed Controlled Time Evolution

Erenay Karacan

Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal in time $t$ scaling for circuit depth $\mathcal{O}(t \text{ polylog}(t N/ε))$, while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6$\times$6 triangular lattice and delivers ground state energy errors below 1% (with $\pm$ 1.5% variation, calculated with a hardware noise aware pipeline) on a 4$\times$4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.

quant-pharXiv:2511.21225•Physical Review A•Nov 27, 2025•2 citations

Control Free Quantum Phase Estimation for Efficient Eigenphase and Energy Estimation without Quantum Fourier Transform

Yalla Jnan Devi Satya Prasad

Quantum phase estimation (QPE) is fundamental to quantum algorithms for eigenvalue problems, chemistry simulation, and number-theoretic applications. However, canonical QPE implementations employ controlled unitary operations and quantum Fourier transform, incurring substantial circuit depth and control overhead that severely limit applicability on nearterm quantum hardware. This work develops a novel class of control-free phase estimation algorithms that eliminate both controlled unitaries and QFT by leveraging signal processing principles. Our approach applies uncontrolled powers of the unitary U = e −iHτ to an eigenstate or eigenstate-rich state, measures in multiple bases to capture interference patterns, and reconstructs eigenphases via classical post-processing techniques including Prony's method, compressed sensing, and harmonic inversion. We establish that for eigenstates or states with sparse eigendecomposition, our algorithms achieve phase estimation precision ϵ using Õ(1/ϵ) applications of U , matching standard QPE query complexity up to logarithmic factors while dramatically reducing circuit depth and eliminating control overhead. We provide detailed error analysis characterizing robustness to measurement noise, finite sampling, and state preparation errors. Applications to electronic structure estimation in small molecules and variational quantum eigensolvers demonstrate the practical viability of control-free QPE on both NISQ and early fault-tolerant quantum computers. Our results suggest that signal-processing-based phase estimation may offer more efficient implementations of quantum algorithms on realistic hardware.

•Feb 5, 2026•0 citations

Estimating ground-state properties in quantum simulators with global control

Cristian Tabares, Dominik S. Wild, J. Ignacio Cirac +3 more

Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time evolution under a target Hamiltonian. This avoids the need for controlled operations that are typically required in conventional quantum phase estimation and extends the algorithm applicability to analog simulators. Our method extracts energy differences from measurements of the Loschmidt echo over an initial ground-state approximation, combines them with direct energy measurements, and solves a set of equations to infer the individual eigenenergies. We benchmark this protocol on free-fermion systems, showing orders-of-magnitude precision gains over direct energy measurements on the initial state, with accuracy improving rapidly with initial-state fidelity and persisting for hundreds of modes. We further demonstrate applicability to the 2D Ising and Fermi-Hubbard models and show that the approach extends naturally to other observables such as order parameters. Finally, we analyze the effect of experimental imperfections and propose error-mitigation strategies. These results establish a practical route to compute physically relevant quantities with high precision using globally controlled quantum simulators.

quant-pharXiv:2511.04434•Nov 7, 2025•3 citations
Eigenvalue estimation is a central problem for demonstrating quantum advantage, yet its implementation on digital quantum computers remains limited by circuit depth and operational overhead. We present an analog quantum phase estimation (aQPE) protocol that extracts the eigenenergies of a target Hamiltonian via continuous time evolution and single-mode cavity measurement. By encoding eigenvalue information as conditional cavity phase-space rotations, the scheme avoids deep quantum circuits and entangling gates, while enabling readout through established cavity tomography techniques. We further illustrate the feasibility of this approach by engineering a Hamiltonian that implements aQPE of the XY model, whose ground-state energy problem is QMA-complete, within a physical architecture compatible with existing circuit quantum electrodynamics technology. Our results provide a resource-efficient and scalable framework for implementing quantum phase estimation in near-term quantum platforms.
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.
Quantum phase estimation is a cornerstone algorithm for determining eigenvalues of unitary operators with Heisenberg-limited precision. Conventional implementations rely on digital controlled-unitary operations together with phase-extraction circuits, which generally results in substantial circuit depth and hardware overhead. Here, we propose a hardware-native alternative that replaces digital controlled-unitary operations by analog bosonic interactions, naturally available in circuit quantum electrodynamics. The protocol extracts the phase through a sequence of binary threshold tests. A bosonic mode serves as an efficient quantum memory where the binary digits of the phase are encoded into the direction of phase-space rotations. These digits are then read out sequentially via high-fidelity homodyne measurements. We show that the protocol preserves Heisenberg scaling in estimation precision while simultaneously providing exponentially suppressed failure probability. By exploiting bosonic degrees of freedom and analog dispersive interactions, the scheme provides a hardware-efficient realization of quantum phase estimation and establishes a natural route toward implementing high-precision phase estimation on circuit quantum electrodynamics platforms.
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.
Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal in time ttt scaling for circuit depth O(t polylog(tN/ε))\mathcal{O}(t \text{ polylog}(t N/ε))O(t polylog(tN/ε)), while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6$\times$6 triangular lattice and delivers ground state energy errors below 1% (with ±\pm± 1.5% variation, calculated with a hardware noise aware pipeline) on a 4$\times$4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.
Quantum phase estimation (QPE) is fundamental to quantum algorithms for eigenvalue problems, chemistry simulation, and number-theoretic applications. However, canonical QPE implementations employ controlled unitary operations and quantum Fourier transform, incurring substantial circuit depth and control overhead that severely limit applicability on nearterm quantum hardware. This work develops a novel class of control-free phase estimation algorithms that eliminate both controlled unitaries and QFT by leveraging signal processing principles. Our approach applies uncontrolled powers of the unitary U = e −iHτ to an eigenstate or eigenstate-rich state, measures in multiple bases to capture interference patterns, and reconstructs eigenphases via classical post-processing techniques including Prony's method, compressed sensing, and harmonic inversion. We establish that for eigenstates or states with sparse eigendecomposition, our algorithms achieve phase estimation precision ϵ using Õ(1/ϵ) applications of U , matching standard QPE query complexity up to logarithmic factors while dramatically reducing circuit depth and eliminating control overhead. We provide detailed error analysis characterizing robustness to measurement noise, finite sampling, and state preparation errors. Applications to electronic structure estimation in small molecules and variational quantum eigensolvers demonstrate the practical viability of control-free QPE on both NISQ and early fault-tolerant quantum computers. Our results suggest that signal-processing-based phase estimation may offer more efficient implementations of quantum algorithms on realistic hardware.
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time evolution under a target Hamiltonian. This avoids the need for controlled operations that are typically required in conventional quantum phase estimation and extends the algorithm applicability to analog simulators. Our method extracts energy differences from measurements of the Loschmidt echo over an initial ground-state approximation, combines them with direct energy measurements, and solves a set of equations to infer the individual eigenenergies. We benchmark this protocol on free-fermion systems, showing orders-of-magnitude precision gains over direct energy measurements on the initial state, with accuracy improving rapidly with initial-state fidelity and persisting for hundreds of modes. We further demonstrate applicability to the 2D Ising and Fermi-Hubbard models and show that the approach extends naturally to other observables such as order parameters. Finally, we analyze the effect of experimental imperfections and propose error-mitigation strategies. These results establish a practical route to compute physically relevant quantities with high precision using globally controlled quantum simulators.