Posted

Lin Lin (Oct 02 2025).
Abstract: Quantum signal processing (QSP) provides a representation of scalar polynomials of degree dd as products of matrices in SU(2)\mathrm{SU}(2), parameterized by (d+1)(d+1) real numbers known as phase factors. QSP is the mathematical foundation of quantum singular value transformation (QSVT), which is often regarded as one of the most important quantum algorithms of the past decade, with a wide range of applications in scientific computing, from Hamiltonian simulation to solving linear systems of equations and eigenvalue problems. In this article we survey recent advances in the mathematical and numerical analysis of QSP. In particular, we focus on its generalization beyond polynomials, the computational complexity of algorithms for phase factor evaluation, and the numerical stability of such algorithms. The resolution to some of these problems relies on an unexpected interplay between QSP, nonlinear Fourier analysis on SU(2)\mathrm{SU}(2), fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!