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• 500 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.

Oxford University Press eBooks•Dec 8, 2025•0 citations

Improved quantum algorithms for eigenvalue 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•Physical Review Applied•Apr 6, 2026•13 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

From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications

Tal Gurfinkel, Kaushika De Silva, Anuradha Mahasinghe +9 more

Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.

quant-pharXiv:2609.09977•Sep 10, 2026•0 citations

Quantum computing and quantum search algorithms

Zijian Diao, Goong Chen

•Jan 1, 2001•0 citations
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.
Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.