Quantum signal processing and QSVT
Grover’s search, Hamiltonian simulation, matrix inversion and phase estimation were discovered separately, over twenty years. In 2019 András Gilyén, Yuan Su, Guang Hao Low and Nathan Wiebe showed they are all one algorithm with different settings: choose a polynomial, and a sequence of simple phase rotations applies that polynomial to the singular values of a matrix. The framework, the quantum singular value transformation, has become the common language of quantum algorithms.
On the plate: a sequence of phase angles and the polynomial it produces.
Quantum signal processing
Take a single-qubit “signal” rotation that encodes a number :
Interleave it with phase rotations : . The top-left entry is a polynomial of degree . Low and Chuang proved in 2016–17 that, with appropriate phases, can be essentially any polynomial of definite parity with on . All phases zero give the Chebyshev polynomial . Established
Shape a polynomial
Choose the degree 3 and a phase pattern: , , , or set a common phase 0.00 added to the middle phases. The plate computes the 2 × 2 product exactly and plots and . Finding phases for a target polynomial, such as a step function for search or for inversion, is a classical preprocessing problem with efficient, stable algorithms.
Block encodings and QSVT
To act on a matrix rather than a number, embed it in the top-left block of a larger unitary, a block encoding, , built for instance by linear combinations of unitaries (Chapter 118). Alternating , and phase rotations on the ancilla then applies to every singular value of at once. That is the QSVT. Its special cases: close to a step function gives search and amplitude amplification; gives Hamiltonian simulation with optimal cost; on the relevant range gives matrix inversion (Chapter 120); and phase estimation can be phrased the same way. John Martyn and colleagues called it a “grand unification” in 2021.
What you now have
Quantum signal processing and the polynomials it produces, Chebyshev polynomials from zero phases, block encodings, the quantum singular value transformation, and how search, simulation and inversion are special cases.
· · ·
Three questions to carry with you.
And one to work out. With all phases zero and , . What is ?
Sources: G. H. Low and I. L. Chuang, Phys. Rev. Lett. 118, 010501 (2017). A. Gilyén, Y. Su, G. H. Low and N. Wiebe, Proc. 51st ACM STOC, 193 (2019). J. M. Martyn, Z. M. Rossi, A. K. Tan and I. L. Chuang, PRX Quantum 2, 040203 (2021). L. Lin, arXiv:2201.08309. Checked by code: QSP with zero phases equals T_d(x) to 10⁻¹⁶ for d = 1, 2, 3, 5; the plate computes the full 2 × 2 product.