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:2105.02859 · PRX Quantum

Grand Unification of Quantum Algorithms

John M. Martyn, Zane M. Rossi, Andrew K. Tan, Isaac L. Chuang

Published Dec 3, 2021• 368 citations
arXivHTMLPDF

Abstract

This tutorial surveys the recently developed Quantum Singular Value Transformation and showcases how the three major quantum algorithms (search, factoring, and simulation) can be unified as instances of this transformation.
DOI
10.1103/prxquantum.2.040203

Related papers

A Real Quantum Improvement Research Quantum Computing Algorithms Defining Entanglement and Computation

V. Karthick, A. Gayathri

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Quantum signal processing and the quantum singular value transformation

Steven Herbert

Abstract The quantum algorithms presented in the previous chapters are underpinned by three fundamental features of quantum computation. First, it is possible to construct Grover iterates that amplify amplitude and concentrate probability mass on desired outcomes quadratically faster than their classical counterparts; second, quantum phase estimation is a subroutine that uses the quantum Fourier transform to interfere a quantum state such that wrong answers cancel out, leaving a state from which the solution to the problem can be extracted; and finally, using a digital quantum computer, Hamiltonian evolution can be simulated. Remarkably, these three phenomena can be seen to be instances of the same underlying computational effect: the quantum singular value transformation – a breakthrough that has been dubbed ‘the grand unification of quantum algorithms’, and which is introduced and analysed in this chapter.

•Dec 8, 2025•0 citations

Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent

Nhat A. Nghiem, Tzu-Chieh Wei

Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework, which provides a unifying description for many quantum algorithms. Initially introduced to simplify and optimize resource utilization in various problems, such as searching, amplitude estimation, and Hamiltonian simulation, it is reasonable to expect that the capabilities of QSVT extend beyond these applications and offer untapped potential for designing new quantum algorithms. In this article, we affirm this perspective by leveraging block encoding to substantially enhance two previously proposed quantum algorithms: largest eigenvalue estimation and quantum gradient descent. Unlike previous works that rely on sophisticated approaches, our findings demonstrate that even just elementary operations within the unitary block encoding framework can eliminate major scaling factors present in their original counterparts. This results in significantly more efficient quantum algorithms capable of tackling target computational problems with remarkable efficiency. Furthermore, we illustrate how our proposed method can be extended to other contexts, including matrix inversion and multiple eigenvalue estimation.

arXiv:2312.14786•Dec 22, 2023•0 citations

Analysis of Classical Base Sort and Search Algorithms vs. Quantum Computing Sort and Search Algorithms in the Emerging Revolutionary Computer Science Field

Thushan Amarasinghege

•Jan 1, 2025•0 citations

Amplitude Amplification Algorithms

Mithilesh Kumar, Yusuf Tahir, Daiya, Varun

This survey traces the evolution of quantum amplitude amplification from its geometric origins in Grover’s algorithm to its algebraic formulation within the Quantum Singular Value Transformation (QSVT) framework. We develop a unified mathematical formalism intended to reduce the historical fragmentation of these algorithms. By establishing a consistent notational foundation early on, framing unstructured search as rotation within an invariant two-dimensional subspace, and following the progression through oblivious, fixed-point, and distributed amplification schemes, we aim to clarify how these methods can be interpreted within the broader language of singular-value polynomial synthesis. We additionally introduce a variational template for amplitude amplification based on parameterized phase rotations, connecting amplification primitives to hybrid quantum-classical algorithms suitable for near-term quantum architectures. To support the pedagogical objectives of this survey, we provide a companion website hosting interactive visualizations and implementation details at QuantumAmplitudeAmplification.

•May 6, 2026•0 citations

A Survey of Quantum Algorithms for Computer Science

Ajay H. Kumar, Amar Jeet Singh, Sanjay Kumar

Communications in computer and information science•Jan 1, 2025•1 citation
Abstract The quantum algorithms presented in the previous chapters are underpinned by three fundamental features of quantum computation. First, it is possible to construct Grover iterates that amplify amplitude and concentrate probability mass on desired outcomes quadratically faster than their classical counterparts; second, quantum phase estimation is a subroutine that uses the quantum Fourier transform to interfere a quantum state such that wrong answers cancel out, leaving a state from which the solution to the problem can be extracted; and finally, using a digital quantum computer, Hamiltonian evolution can be simulated. Remarkably, these three phenomena can be seen to be instances of the same underlying computational effect: the quantum singular value transformation – a breakthrough that has been dubbed ‘the grand unification of quantum algorithms’, and which is introduced and analysed in this chapter.
Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework, which provides a unifying description for many quantum algorithms. Initially introduced to simplify and optimize resource utilization in various problems, such as searching, amplitude estimation, and Hamiltonian simulation, it is reasonable to expect that the capabilities of QSVT extend beyond these applications and offer untapped potential for designing new quantum algorithms. In this article, we affirm this perspective by leveraging block encoding to substantially enhance two previously proposed quantum algorithms: largest eigenvalue estimation and quantum gradient descent. Unlike previous works that rely on sophisticated approaches, our findings demonstrate that even just elementary operations within the unitary block encoding framework can eliminate major scaling factors present in their original counterparts. This results in significantly more efficient quantum algorithms capable of tackling target computational problems with remarkable efficiency. Furthermore, we illustrate how our proposed method can be extended to other contexts, including matrix inversion and multiple eigenvalue estimation.
This survey traces the evolution of quantum amplitude amplification from its geometric origins in Grover’s algorithm to its algebraic formulation within the Quantum Singular Value Transformation (QSVT) framework. We develop a unified mathematical formalism intended to reduce the historical fragmentation of these algorithms. By establishing a consistent notational foundation early on, framing unstructured search as rotation within an invariant two-dimensional subspace, and following the progression through oblivious, fixed-point, and distributed amplification schemes, we aim to clarify how these methods can be interpreted within the broader language of singular-value polynomial synthesis. We additionally introduce a variational template for amplitude amplification based on parameterized phase rotations, connecting amplification primitives to hybrid quantum-classical algorithms suitable for near-term quantum architectures. To support the pedagogical objectives of this survey, we provide a companion website hosting interactive visualizations and implementation details at QuantumAmplitudeAmplification.