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:2010.09075 · Physical Review Applied

Bayesian Quantum Multiphase Estimation Algorithm

Valentin Gebhart, Augusto Smerzi, Luca Pezzè

Published Jul 14, 2021• 43 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevapplied.16.014035

Related papers

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•4 citations

Adaptive Bayesian quantum algorithm for phase estimation

Joseph G. Smith, C. H. W. Barnes, David R. M. Arvidsson-Shukur

Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or entanglement to sample the unitary N tot times, the variance of the estimates can scale as O ( 1 / N tot 2 ) , compared to the best “classical” strategy with O ( 1 / N tot ) . The original algorithm for quantum phase estimation cannot be implemented on near-term hardware as it requires large-scale entangled probes and fault-tolerant quantum computing. Therefore, alternative algorithms have been introduced that rely on coherence and statistical inference. These algorithms produce quantum-boosted phase estimates without interprobe entanglement. This family of phase-estimation algorithms have, until now, never exhibited the possibility of achieving optimal scaling O ( 1 / N tot 2 ) . Moreover, previous works have not considered the effect of noise on these algorithms. Here, we present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound. The optimality of our algorithm stems from its adaptive nature: Each step is determined, iteratively, using a Bayesian protocol that analizes the results of previous steps. Published by the American Physical Society 2024

arXiv:2303.01517•Physical Review A•Apr 11, 2024•29 citations

Toward Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach

Alok Shukla, Prakash Vedula

ABSTRACT Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large number of coherent qubits and deep circuits, pose significant challenges for current Noisy Intermediate Scale Quantum (NISQ) devices. In this work, we introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm, a novel method designed to address the limitations of standard QPE. AWQPE utilizes small, independent blocks of control qubits to estimate multiple phase bits simultaneously within a “window,” thereby significantly reducing the number of coherent qubits required to achieve a desired precision. These independent blocks are amenable to parallelization and, when combined with a robust least‐significant‐bit (LSB) to most‐significant‐bit (MSB) ambiguity resolution mechanism, enhance the algorithm's accuracy while mitigating the risk of error propagation. Our numerical simulations demonstrate AWQPE's accuracy and improved robustness relative to standard QPE under representative noise models, showcasing a favorable balance between resource efficiency and computational speed. This makes AWQPE particularly well‐suited for near‐term quantum platforms.

arXiv:2507.22460•Advanced Quantum Technologies•Mar 1, 2026•8 citations

Demonstrating Bayesian quantum phase estimation with quantum error detection

Kentaro Yamamoto, Samuel Duffield, Yuta Kikuchi +1 more

Quantum phase estimation (QPE) serves as a building block of many different quantum algorithms and finds important applications in computational chemistry problems. Despite the rapid development of quantum hardware, experimental demonstration of QPE for chemistry problems remains challenging due to its large circuit depth and the lack of quantum resources to protect the hardware from noise with fully fault-tolerant protocols. In the present work, we take a step towards fault-tolerant quantum computing by demonstrating a QPE algorithm on a Quantinuum trapped-ion computer. We employ a Bayesian approach to QPE and introduce a routine for optimal parameter selection, which we combine with a [[ n + 2 , n , 2 ]] quantum error detection code carefully tailored to the hardware capabilities. As a simple quantum chemistry example, we take a hydrogen molecule represented by a two-qubit Hamiltonian and estimate its ground state energy using our QPE protocol. In the experiment, we use the quantum circuits containing as many as 920 physical two-qubit gates to estimate the ground state energy within 6 × 10 − 3 hartree of the exact value. Published by the American Physical Society 2024

arXiv:2306.16608•Physical Review Research•Feb 29, 2024•54 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

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
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(NT\ensuremath−2)O({N}_{T}^{\ensuremath{-}2})O(NT\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 algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or entanglement to sample the unitary N tot times, the variance of the estimates can scale as O ( 1 / N tot 2 ) , compared to the best “classical” strategy with O ( 1 / N tot ) . The original algorithm for quantum phase estimation cannot be implemented on near-term hardware as it requires large-scale entangled probes and fault-tolerant quantum computing. Therefore, alternative algorithms have been introduced that rely on coherence and statistical inference. These algorithms produce quantum-boosted phase estimates without interprobe entanglement. This family of phase-estimation algorithms have, until now, never exhibited the possibility of achieving optimal scaling O ( 1 / N tot 2 ) . Moreover, previous works have not considered the effect of noise on these algorithms. Here, we present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound. The optimality of our algorithm stems from its adaptive nature: Each step is determined, iteratively, using a Bayesian protocol that analizes the results of previous steps. Published by the American Physical Society 2024
ABSTRACT Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large number of coherent qubits and deep circuits, pose significant challenges for current Noisy Intermediate Scale Quantum (NISQ) devices. In this work, we introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm, a novel method designed to address the limitations of standard QPE. AWQPE utilizes small, independent blocks of control qubits to estimate multiple phase bits simultaneously within a “window,” thereby significantly reducing the number of coherent qubits required to achieve a desired precision. These independent blocks are amenable to parallelization and, when combined with a robust least‐significant‐bit (LSB) to most‐significant‐bit (MSB) ambiguity resolution mechanism, enhance the algorithm's accuracy while mitigating the risk of error propagation. Our numerical simulations demonstrate AWQPE's accuracy and improved robustness relative to standard QPE under representative noise models, showcasing a favorable balance between resource efficiency and computational speed. This makes AWQPE particularly well‐suited for near‐term quantum platforms.
Quantum phase estimation (QPE) serves as a building block of many different quantum algorithms and finds important applications in computational chemistry problems. Despite the rapid development of quantum hardware, experimental demonstration of QPE for chemistry problems remains challenging due to its large circuit depth and the lack of quantum resources to protect the hardware from noise with fully fault-tolerant protocols. In the present work, we take a step towards fault-tolerant quantum computing by demonstrating a QPE algorithm on a Quantinuum trapped-ion computer. We employ a Bayesian approach to QPE and introduce a routine for optimal parameter selection, which we combine with a [[ n + 2 , n , 2 ]] quantum error detection code carefully tailored to the hardware capabilities. As a simple quantum chemistry example, we take a hydrogen molecule represented by a two-qubit Hamiltonian and estimate its ground state energy using our QPE protocol. In the experiment, we use the quantum circuits containing as many as 920 physical two-qubit gates to estimate the ground state energy within 6 × 10 − 3 hartree of the exact value. Published by the American Physical Society 2024
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.
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.