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

Oxford University Press eBooks

Quantum signal processing and the quantum singular value transformation

Steven Herbert

Published Dec 8, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1093/9780191964381.003.0014

Related papers

Quantum Signal Processing and Quantum Singular Value Transformation on U ( N )

Xi Lu, Yuan Liu, Hongwei Lin

Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum algorithms. We propose a framework of quantum signal processing and quantum singular value transformation on U ( N ) , which realizes multiple polynomials simultaneously from a block-encoded input, as a generalization of those on U ( 2 ) in the original frameworks. We provide a comprehensive characterization of achievable polynomial matrices and give recursive algorithms to construct the quantum circuits that realize desired polynomial transformations. As three example applications, we propose a framework to realize bi-variate polynomial functions, demonstrate N -interval decision achieving O ( d ) query complexity with a log 2 ⁡ N improvement over iterative U ( 2 ) -QSP requiring O ( d log 2 ⁡ N ) queries, and present a quantum amplitude estimation algorithm achieving the Heisenberg limit without adaptive measurements.

arXiv:2408.01439•Quantum•Mar 27, 2026•9 citations

Quantum phase processing and its applications in estimating phase and entropies

Youle Wang, Lei Zhang, Zhan Yu +1 more

Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates and make quantum algorithms fundamentally different from their classical counterparts. Based on this unique principle of quantum computing, we develop an algorithmic toolbox, quantum phase processing, that can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator. The quantum phase processing circuit is constructed simply, consisting of single-qubit rotations and controlled unitaries, typically using only one ancilla qubit. Besides the capability of phase transformation, quantum phase processing in particular can extract the eigeninformation of quantum systems by simply measuring the ancilla qubit, making it naturally compatible with indirect measurement. Quantum phase processing complements another powerful framework known as quantum singular value transformation and leads to more intuitive and efficient quantum algorithms for solving problems that are particularly phase related. As a notable application, we propose a quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far. We further exploit the power of our method by investigating a plethora of applications in Hamiltonian simulation, entanglement spectroscopy, and quantum entropy estimation, demonstrating improvements or optimality for almost all cases.

arXiv:2209.14278•Physical Review A•Dec 13, 2023•50 citations

Quantum Computing: Foundations and Practice

Steven Herbert

Abstract The discovery of physical systems that exhibit what we now call quantum mechanical behaviour was unquestionably one of the most astonishing events of modern physics. No less remarkable was the realisation that quantum mechanics presents a much more powerful paradigm for computation and information processing than its classical counterpart. But this power is somewhat subtle, and only by building up a rigorous model of quantum computation from the fundamental physics can it be fully understood and analysed. Developing and then using the quantum circuit model as a suitable representation of quantum mechanics, this textbook presents a canon of the most important quantum algorithms. Starting with historically important query algorithms, ‘classic’ results such as Grover’s and Shor’s algorithm are then covered, followed by more recent breakthroughs including the quantum algorithm for solving linear systems (HHL) and the quantum singular value transformation. The thread that runs through the book is the hunt for quantum advantage, in all of its manifestations, and to this end the final chapter moves from the idealised setting of closed quantum systems, to address real ‘noisy’ open quantum systems. Quantum error correction is introduced, culminating in the seminal result, the threshold theorem, which roughly says that the idealised performance predicted by the analysis of quantum mechanics as a model of computation can actually be realised on real-world quantum computers.

•Dec 8, 2025•0 citations

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.

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

Grand Unification of Quantum Algorithms

John M. Martyn, Zane M. Rossi, Andrew K. Tan +1 more

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.

arXiv:2105.02859•PRX Quantum•Dec 3, 2021•500 citations

Quantum Algorithms Relevant to Machine Learning

Hamid D. Ismail

This chapter introduces the principal quantum algorithms that form the computational foundation of quantum machine learning (QML). It presents the Quantum Fourier Transform and quantum phase estimation as the core spectral tools for extracting eigenvalue and phase information and then examines Grover’s algorithm, amplitude amplification, and amplitude estimation as search- and probability-based primitives relevant to optimization, expectation estimation, and probabilistic inference. This chapter also develops phase kickback as a unifying mechanism for transferring information into measurable relative phases, highlighting its role in phase oracles, eigenvalue estimation, and phase-based data encoding. This chapter further discusses the Harrow–Hassidim–Lloyd (HHL) algorithm for quantum linear systems and places it in the broader setting of modern quantum linear algebra, including block encoding, quantum singular value transformation, and improved Hamiltonian-simulation techniques. These methods are connected to machine learning tasks such as regression, kernel methods, dimensionality reduction, and graph-based learning. Throughout, the discussion emphasizes that these algorithms function as reusable primitives within hybrid quantum-classical pipelines rather than as standalone learning systems and that their practical value depends critically on assumptions about state preparation, matrix access, conditioning, and measurement overhead.

CRC Press eBooks•Nov 4, 2026•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.
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum algorithms. We propose a framework of quantum signal processing and quantum singular value transformation on U ( N ) , which realizes multiple polynomials simultaneously from a block-encoded input, as a generalization of those on U ( 2 ) in the original frameworks. We provide a comprehensive characterization of achievable polynomial matrices and give recursive algorithms to construct the quantum circuits that realize desired polynomial transformations. As three example applications, we propose a framework to realize bi-variate polynomial functions, demonstrate N -interval decision achieving O ( d ) query complexity with a log 2 ⁡ N improvement over iterative U ( 2 ) -QSP requiring O ( d log 2 ⁡ N ) queries, and present a quantum amplitude estimation algorithm achieving the Heisenberg limit without adaptive measurements.
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates and make quantum algorithms fundamentally different from their classical counterparts. Based on this unique principle of quantum computing, we develop an algorithmic toolbox, quantum phase processing, that can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator. The quantum phase processing circuit is constructed simply, consisting of single-qubit rotations and controlled unitaries, typically using only one ancilla qubit. Besides the capability of phase transformation, quantum phase processing in particular can extract the eigeninformation of quantum systems by simply measuring the ancilla qubit, making it naturally compatible with indirect measurement. Quantum phase processing complements another powerful framework known as quantum singular value transformation and leads to more intuitive and efficient quantum algorithms for solving problems that are particularly phase related. As a notable application, we propose a quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far. We further exploit the power of our method by investigating a plethora of applications in Hamiltonian simulation, entanglement spectroscopy, and quantum entropy estimation, demonstrating improvements or optimality for almost all cases.
Abstract The discovery of physical systems that exhibit what we now call quantum mechanical behaviour was unquestionably one of the most astonishing events of modern physics. No less remarkable was the realisation that quantum mechanics presents a much more powerful paradigm for computation and information processing than its classical counterpart. But this power is somewhat subtle, and only by building up a rigorous model of quantum computation from the fundamental physics can it be fully understood and analysed. Developing and then using the quantum circuit model as a suitable representation of quantum mechanics, this textbook presents a canon of the most important quantum algorithms. Starting with historically important query algorithms, ‘classic’ results such as Grover’s and Shor’s algorithm are then covered, followed by more recent breakthroughs including the quantum algorithm for solving linear systems (HHL) and the quantum singular value transformation. The thread that runs through the book is the hunt for quantum advantage, in all of its manifestations, and to this end the final chapter moves from the idealised setting of closed quantum systems, to address real ‘noisy’ open quantum systems. Quantum error correction is introduced, culminating in the seminal result, the threshold theorem, which roughly says that the idealised performance predicted by the analysis of quantum mechanics as a model of computation can actually be realised on real-world quantum computers.
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.
This chapter introduces the principal quantum algorithms that form the computational foundation of quantum machine learning (QML). It presents the Quantum Fourier Transform and quantum phase estimation as the core spectral tools for extracting eigenvalue and phase information and then examines Grover’s algorithm, amplitude amplification, and amplitude estimation as search- and probability-based primitives relevant to optimization, expectation estimation, and probabilistic inference. This chapter also develops phase kickback as a unifying mechanism for transferring information into measurable relative phases, highlighting its role in phase oracles, eigenvalue estimation, and phase-based data encoding. This chapter further discusses the Harrow–Hassidim–Lloyd (HHL) algorithm for quantum linear systems and places it in the broader setting of modern quantum linear algebra, including block encoding, quantum singular value transformation, and improved Hamiltonian-simulation techniques. These methods are connected to machine learning tasks such as regression, kernel methods, dimensionality reduction, and graph-based learning. Throughout, the discussion emphasizes that these algorithms function as reusable primitives within hybrid quantum-classical pipelines rather than as standalone learning systems and that their practical value depends critically on assumptions about state preparation, matrix access, conditioning, and measurement overhead.