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

Heisenberg-limited Bayesian multiphase estimation algorithm

Valentin Gebhart, Augusto Smerzi, Luca Pezzè

Published Oct 18, 2020• 2 citations
OpenAlex

Abstract

Quantum phase estimation (QPE) is ubiquitous in quantum technologies. It is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a single phase, one can envisage applications where the simultaneous estimation of multiple phases may bring substantial advantages, for instance in presence of spatial or temporal constraints. In this work, we study a Bayesian QPE algorithm for the parallel (simultaneous) estimation of multiple arbitrary phases. The algorithm allows the estimation of each phase, as well as any arbitrary linear combination, with Heisenberg-limited sensitivity with respect to the total number of quantum resources. The parallel estimation protocol gives access to correlations in the Bayesian multiphase distribution that allow to surpass the sensitivity of sequential single phase estimation strategies for optimal combinations of phases. Furthermore, the algorithm proves a certain noise resilience, and can be implemented using single photons and standard optical elements in currently accessible experiments.

Related papers

Bayesian Quantum Multiphase Estimation Algorithm

Valentin Gebhart, Augusto Smerzi, Luca Pezzè

Quantum phase estimation (QPE) is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a single phase, applications to the simultaneous estimation of several phases may bring substantial advantages; for instance, in the presence of spatial or temporal constraints. In this work, we study a Bayesian algorithm for the parallel (simultaneous) estimation of multiple arbitrary phases. The protocol gives access to correlations in the Bayesian multiphase distribution resulting in covariance matrix elements scaling as $O({N}_{T}^{\ensuremath{-}2})$, with respect to the total number of quantum resources ${N}_{T}$. The parallel estimation allows to surpass the sensitivity of sequential single-phase estimation strategies for optimal linear combinations of phases. Furthermore, the algorithm proves a certain noise resilience and can be implemented using single photons and standard optical elements in currently accessible experiments.

arXiv:2010.09075•Physical Review Applied•Jul 14, 2021•38 citations

Quantum multiphase estimation

Marco Barbieri, Ilaria Gianani, Aaron Z. Goldberg +1 more

Quantum phase estimation is fundamental to advancing quantum science and technology. While much of the research has concentrated on estimating a single phase, the simultaneous estimation of multiple phases can yield significantly enhanced sensitivities when using specially tailored input quantum states. This work reviews recent theoretical and experimental advancements in the parallel estimation of multiple arbitrary phases. We highlight strategies for constructing optimal measurement protocols and discuss the experimental platforms best suited for implementing these techniques.

arXiv:2502.07873•Contemporary Physics•Apr 2, 2024•3 citations

Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits

Alicja Dutkiewicz, Barbara M. Terhal, Thomas E. O apos Brien

Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices.The maximum rate at which these eigenvalues may be learned, –known as the Heisenberg limit–, is constrained by bounds on the circuit complexity required to simulate an arbitrary Hamiltonian. Single-control qubit variants of quantum phase estimation that do not require coherence between experiments have garnered interest in recent years due to lower circuit depth and minimal qubit overhead. In this work we show that these methods can achieve the Heisenberg limit, a l s o when one is unable to prepare eigenstates of the system. Given a quantum subroutine which provides samples of a `phase function' g ( k ) = ∑ j A j e i ϕ j k with unknown eigenphases ϕ j and overlaps A j at quantum cost O ( k ) , we show how to estimate the phases { ϕ j } with (root-mean-square) error δ for total quantum cost T = O ( δ − 1 ) . Our scheme combines the idea of Heisenberg-limited multi-order quantum phase estimation for a single eigenvalue phase [Higgins et al (2009) and Kimmel et al (2015)] with subroutines with so-called dense quantum phase estimation which uses classical processing via time-series analysis for the QEEP problem [Somma (2019)] or the matrix pencil method. For our algorithm which adaptively fixes the choice for k in g ( k ) we prove Heisenberg-limited scaling when we use the time-series/QEEP subroutine. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.

arXiv:2107.04605•Quantum•Oct 6, 2022•33 citations

Bayesian phase difference estimation based on single-photon projective measurement

Xu-Hao 旭豪 Yu 余, Ying 颖 Wei 韦, Ran 然 Yang 杨 +7 more

Abstract The estimation of quantum phase differences plays an important role in quantum simulation and quantum computation, yet existing quantum phase estimation algorithms face critical limitations in noisy intermediate-scale quantum (NISQ) devices due to their excessive depth and circuit complexity. We demonstrate a high-precision phase difference estimation protocol based on the Bayesian phase difference estimation algorithm and single-photon projective measurement. The iterative framework of the algorithm, combined with the independence from controlled unitary operations, inherently mitigates circuit depth and complexity limitations. Through an experimental realization on the photonic system, we demonstrate high-precision estimation of diverse phase differences, showing root-mean-square errors (RMSE) below the standard quantum limit O ( 1 / N ) and reaching the Heisenberg scaling O ( 1 / N ) after a certain number of iterations. Our scheme provides a critical advantage in quantum resource-constrained scenarios, and advances practical implementations of quantum information tasks under realistic hardware constraints.

Chinese Physics B•May 29, 2025•2 citations

Heisenberg-limited quantum phase estimation of multiple eigenvalues with up to two control qubits

Alicja Dutkiewicz, Barbara M. Terhal, Thomas E. O’Brien

Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices. The maximum rate at which these eigenvalues may be learned, --known as the Heisenberg limit--, is constrained by bounds on the circuit depth required to simulate an arbitrary Hamiltonian. Single-control qubit variants of quantum phase estimation have garnered interest in recent years due to lower circuit depth and minimal qubit overhead. In this work we show that these methods can achieve the Heisenberg limit, {\em also} when one is unable to prepare eigenstates of the system. Given a quantum subroutine which provides samples of a `phase function' $g(k)=\sum_j A_j e^{i \phi_j k}$ with unknown eigenvalue phases $\phi_j$ and probabilities $A_j$ at quantum cost $O(k)$, we show how to estimate the phases $\{\phi_j\}$ with accuracy (root-mean-square) error $\delta$ for total quantum cost $T=O(\delta^{-1})$. Our scheme combines the idea of Heisenberg-limited multi-order quantum phase estimation for a single eigenvalue phase \cite{Higgins09Demonstrating,Kimmel15Robust} with subroutines with so-called dense quantum phase estimation which uses classical processing via time-series analysis for the QEEP problem \cite{Somma19Quantum} or the matrix pencil method. For our algorithm which adaptively fixes the choice for $k$ in $g(k)$ we prove Heisenberg-limited scaling when we use the time-series/QEEP subroutine. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.

•Jul 9, 2021•0 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
Quantum phase estimation (QPE) is ubiquitous in quantum technologies. It is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a single phase, one can envisage applications where the simultaneous estimation of multiple phases may bring substantial advantages, for instance in presence of spatial or temporal constraints. In this work, we study a Bayesian QPE algorithm for the parallel (simultaneous) estimation of multiple arbitrary phases. The algorithm allows the estimation of each phase, as well as any arbitrary linear combination, with Heisenberg-limited sensitivity with respect to the total number of quantum resources. The parallel estimation protocol gives access to correlations in the Bayesian multiphase distribution that allow to surpass the sensitivity of sequential single phase estimation strategies for optimal combinations of phases. Furthermore, the algorithm proves a certain noise resilience, and can be implemented using single photons and standard optical elements in currently accessible experiments.
Quantum phase estimation (QPE) is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a single phase, applications to the simultaneous estimation of several phases may bring substantial advantages; for instance, in the presence of spatial or temporal constraints. In this work, we study a Bayesian algorithm for the parallel (simultaneous) estimation of multiple arbitrary phases. The protocol gives access to correlations in the Bayesian multiphase distribution resulting in covariance matrix elements scaling as $O({N}_{T}^{\ensuremath{-}2})$, with respect to the total number of quantum resources NT{N}_{T}NT​. The parallel estimation allows to surpass the sensitivity of sequential single-phase estimation strategies for optimal linear combinations of phases. Furthermore, the algorithm proves a certain noise resilience and can be implemented using single photons and standard optical elements in currently accessible experiments.
Quantum phase estimation is fundamental to advancing quantum science and technology. While much of the research has concentrated on estimating a single phase, the simultaneous estimation of multiple phases can yield significantly enhanced sensitivities when using specially tailored input quantum states. This work reviews recent theoretical and experimental advancements in the parallel estimation of multiple arbitrary phases. We highlight strategies for constructing optimal measurement protocols and discuss the experimental platforms best suited for implementing these techniques.
Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices.The maximum rate at which these eigenvalues may be learned, –known as the Heisenberg limit–, is constrained by bounds on the circuit complexity required to simulate an arbitrary Hamiltonian. Single-control qubit variants of quantum phase estimation that do not require coherence between experiments have garnered interest in recent years due to lower circuit depth and minimal qubit overhead. In this work we show that these methods can achieve the Heisenberg limit, a l s o when one is unable to prepare eigenstates of the system. Given a quantum subroutine which provides samples of a `phase function' g ( k ) = ∑ j A j e i ϕ j k with unknown eigenphases ϕ j and overlaps A j at quantum cost O ( k ) , we show how to estimate the phases { ϕ j } with (root-mean-square) error δ for total quantum cost T = O ( δ − 1 ) . Our scheme combines the idea of Heisenberg-limited multi-order quantum phase estimation for a single eigenvalue phase [Higgins et al (2009) and Kimmel et al (2015)] with subroutines with so-called dense quantum phase estimation which uses classical processing via time-series analysis for the QEEP problem [Somma (2019)] or the matrix pencil method. For our algorithm which adaptively fixes the choice for k in g ( k ) we prove Heisenberg-limited scaling when we use the time-series/QEEP subroutine. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.
Abstract The estimation of quantum phase differences plays an important role in quantum simulation and quantum computation, yet existing quantum phase estimation algorithms face critical limitations in noisy intermediate-scale quantum (NISQ) devices due to their excessive depth and circuit complexity. We demonstrate a high-precision phase difference estimation protocol based on the Bayesian phase difference estimation algorithm and single-photon projective measurement. The iterative framework of the algorithm, combined with the independence from controlled unitary operations, inherently mitigates circuit depth and complexity limitations. Through an experimental realization on the photonic system, we demonstrate high-precision estimation of diverse phase differences, showing root-mean-square errors (RMSE) below the standard quantum limit O ( 1 / N ) and reaching the Heisenberg scaling O ( 1 / N ) after a certain number of iterations. Our scheme provides a critical advantage in quantum resource-constrained scenarios, and advances practical implementations of quantum information tasks under realistic hardware constraints.
Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices. The maximum rate at which these eigenvalues may be learned, --known as the Heisenberg limit--, is constrained by bounds on the circuit depth required to simulate an arbitrary Hamiltonian. Single-control qubit variants of quantum phase estimation have garnered interest in recent years due to lower circuit depth and minimal qubit overhead. In this work we show that these methods can achieve the Heisenberg limit, {\em also} when one is unable to prepare eigenstates of the system. Given a quantum subroutine which provides samples of a `phase function' g(k)=∑jAjeiϕjkg(k)=\sum_j A_j e^{i \phi_j k}g(k)=∑j​Aj​eiϕj​k with unknown eigenvalue phases ϕj\phi_jϕj​ and probabilities AjA_jAj​ at quantum cost O(k)O(k)O(k), we show how to estimate the phases {ϕj}\{\phi_j\}{ϕj​} with accuracy (root-mean-square) error δ\deltaδ for total quantum cost T=O(δ−1)T=O(\delta^{-1})T=O(δ−1). Our scheme combines the idea of Heisenberg-limited multi-order quantum phase estimation for a single eigenvalue phase \cite{Higgins09Demonstrating,Kimmel15Robust} with subroutines with so-called dense quantum phase estimation which uses classical processing via time-series analysis for the QEEP problem \cite{Somma19Quantum} or the matrix pencil method. For our algorithm which adaptively fixes the choice for kkk in g(k)g(k)g(k) we prove Heisenberg-limited scaling when we use the time-series/QEEP subroutine. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.
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.