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

Universal Quantum Algorithm

Avatar Tulsi

Published Nov 10, 2016• 1 citation
arXivHTMLPDF

Abstract

Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated using quantum phase estimation. We present a universal quantum algorithm which explains these two algorithms as special cases. An interesting result is that we do not need quantum fourier transform to do quantum phase estimation.

DOI
10.48550/arxiv.1611.03472

Related papers

Quantum phase estimation and quantum amplitude estimation

Steven Herbert

Abstract This chapter introduces and analyses two of the most important quantum algorithmic primitives that are used in myriad applications, namely quantum phase estimation and quantum amplitude estimation (QAE). Quantum phase estimation (in the presentation covered in this chapter) uses the quantum Fourier transform, itself an extremely important quantum subroutine. In its original presentation, QAE combines quantum amplitude amplification (a generalisation of the circuit used in Grover’s algorithm) and quantum phase estimation to estimate the amplitude of a quantum state. However, more recent approaches achieve amplitude estimation without phase estimation, which is potentially practically advantageous. This chapter covers both, as well as some important applications of QAE such as quantum Monte Carlo integration and quantum counting.

•Dec 8, 2025•0 citations

Amplitude estimation without phase estimation

Yohichi Suzuki, Shumpei Uno, Rudy Raymond +3 more

Abstract This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.

arXiv:1904.10246•Quantum Information Processing•Jan 9, 2020•249 citations

Chapter 3: Quantum Fourier transform and phase estimation

Giacomo Nannicini

In this chapter we present two fundamental building blocks for quantum algorithms: the quantum Fourier transform, and one of its direct applications known as phase estimation. Both building blocks are used extensively in the rest of this book.

Society for Industrial and Applied Mathematics eBooks•Dec 17, 2025•0 citations

Quantum phase estimation with arbitrary constant-precision phase shift operators

AhmadiHamed, ChiangChen-Fu

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained...

Quantum Information and Computation•Sep 1, 2012•0 citations

Quantum Fourier transform

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter covers the quantum Fourier transform, which is an essential quantum algorithmic primitive that efficiently applies a discrete Fourier transform to the amplitudes of a quantum state. It features prominently in quantum phase estimation and Shor’s algorithm for factoring and computing discrete logarithms.

Cambridge University Press eBooks•Apr 24, 2025•0 citations

Adaptive quantum phase estimation can be better than non-adaptive

Noah Linden, Ronald de Wolf

Quantum phase estimation is one of the most important tools in quantum algorithms. It can be made non-adaptive (meaning all applications of the unitary $U_φ$ happen simultaneously) without using more applications of $U_φ$, albeit at the expense of using many more qubits. It is also known that there is no advantage for adaptive algorithms in the case where the phase that needs to be estimated is arbitrary or is uniformly random. Here we give examples of a special case of phase estimation, with a promise on the values that the unknown phase can take, where adaptive methods are provably better than non-adaptive methods by a factor of nearly 2 in the number of uses of $U_φ$. We also prove some upper bounds on the maximum advantage that adaptive algorithms for phase estimation can achieve over non-adaptive ones.

quant-pharXiv:2511.05372•Nov 10, 2025•0 citations
Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated using quantum phase estimation. We present a universal quantum algorithm which explains these two algorithms as special cases. An interesting result is that we do not need quantum fourier transform to do quantum phase estimation.
Abstract This chapter introduces and analyses two of the most important quantum algorithmic primitives that are used in myriad applications, namely quantum phase estimation and quantum amplitude estimation (QAE). Quantum phase estimation (in the presentation covered in this chapter) uses the quantum Fourier transform, itself an extremely important quantum subroutine. In its original presentation, QAE combines quantum amplitude amplification (a generalisation of the circuit used in Grover’s algorithm) and quantum phase estimation to estimate the amplitude of a quantum state. However, more recent approaches achieve amplitude estimation without phase estimation, which is potentially practically advantageous. This chapter covers both, as well as some important applications of QAE such as quantum Monte Carlo integration and quantum counting.
Abstract This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.
Quantum phase estimation is one of the most important tools in quantum algorithms. It can be made non-adaptive (meaning all applications of the unitary UφU_φUφ​ happen simultaneously) without using more applications of UφU_φUφ​, albeit at the expense of using many more qubits. It is also known that there is no advantage for adaptive algorithms in the case where the phase that needs to be estimated is arbitrary or is uniformly random. Here we give examples of a special case of phase estimation, with a promise on the values that the unknown phase can take, where adaptive methods are provably better than non-adaptive methods by a factor of nearly 2 in the number of uses of UφU_φUφ​. We also prove some upper bounds on the maximum advantage that adaptive algorithms for phase estimation can achieve over non-adaptive ones.