Mathematical and numerical analysis of quantum signal processing
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911187573145600 |
|---|---|
| author | Lin, Lin |
| author_facet | Lin, Lin |
| contents | Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(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 $\mathrm{SU}(2)$, fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00443 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Mathematical and numerical analysis of quantum signal processing Lin, Lin Quantum Physics Numerical Analysis Classical Analysis and ODEs 68Q12, 81P68, 65T99, 65F05, 42C99 Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(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 $\mathrm{SU}(2)$, fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure. |
| title | Mathematical and numerical analysis of quantum signal processing |
| topic | Quantum Physics Numerical Analysis Classical Analysis and ODEs 68Q12, 81P68, 65T99, 65F05, 42C99 |
| url | https://arxiv.org/abs/2510.00443 |