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:2310.12683 · Revista Matemática Complutense

Quantum signal processing and nonlinear Fourier analysis

Michel Alexis, Gevorg Mnatsakanyan, Christoph M. Thiele

Published Jun 14, 2024• 14 citations
arXivHTMLPDF

Abstract

Abstract Elucidating a connection with nonlinear Fourier analysis (NLFA), we extend a well known algorithm in quantum signal processing (QSP) to represent measurable signals by square summable sequences. Each coefficient of the sequence is Lipschitz continuous as a function of the signal.
DOI
10.1007/s13163-024-00494-5

Related papers

Arbeitsgemeinschaft: Quantum Signal Processing and Nonlinear Fourier Analysis

A pivotal algorithm in quantum signal processing represents a real-valued function as a specific entry in a product of $SU(2)$ matrices, where an argument matrix alternates with a sequence of coefficient matrices. Recently, this framework has been identified as a nonlinear Fourier series, a concept studied across various mathematical disciplines. This Arbeitsgemeinschaft explored the intersection of quantum computing and harmonic analysis, emphasizing the potential of this connection.

•Jan 1, 2024•0 citations

Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent

Lorenzo Laneve

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research [Alexis et al. 2024] showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability. In this work we extend their result, showing that GQSP and the Non-Linear Fourier Transform over $SU(2)$ are the same object. This statement - proven by a simple argument - has a bunch of consequences: first, the Riemann-Hilbert-Weiss algorithm can be turned, with little modifications and no penalty in complexity, into a unified, provably stable algorithm for the computation of phase factors in any QSP variant, including GQSP. Secondly, we derive a uniqueness result for the existence of GQSP phase factors based on the bijectivity of the Non-Linear Fourier Transform. Furthermore, NLFA provides a complete theory of infinite generalized quantum signal processing, which characterizes the class of functions approximable by GQSP protocols.

arXiv:2503.03026•Mar 4, 2025•0 citations

An SU(2n)-valued nonlinear Fourier transform

Michel Alexis, Lars Becker, Diogo Oliveira e Silva +1 more

We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable sequences on the half-line, and construct an inverse for $SU(2n)$-valued functions whose diagonal $n \times n$ blocks are outer matrix functions. As an application, we relate this nonlinear Fourier transform with quantum signal processing over $U(2n)$ and multivariate quantum signal processing.

math.CACross-listedarXiv:2601.03987•Jan 8, 2026

Arbeitsgemeinschaft: Quantum Signal Processing and Nonlinear Fourier Analysis

András Gilyén, Lin Lin, Christoph M. Thiele

A pivotal algorithm in quantum signal processing represents a real-valued function as a specific entry in a product of SU(2) matrices, where an argument matrix alternates with a sequence of coefficient matrices. Recently, this framework has been identified as a nonlinear Fourier series, a concept studied across various mathematical disciplines. This Arbeitsgemeinschaft explored the intersection of quantum computing and harmonic analysis, emphasizing the potential of this connection.

Oberwolfach Reports•May 19, 2025•0 citations

Inverse nonlinear fast Fourier transform on SU(2) with applications to quantum signal processing

Hongkang Ni, Rahul Sarkar, Lexing Ying B +1 more

The nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on $\mathrm{SU}(1,1)$ has been widely studied, its $\mathrm{SU}(2)$ variant has only recently attracted attention due to emerging applications in quantum signal processing (QSP) and quantum singular value transformation (QSVT). In this paper, we investigate the inverse NLFT on $\mathrm{SU}(2)$ and establish the numerical stability of the layer stripping algorithm for the first time under suitable conditions. Furthermore, we develop a fast and numerically stable algorithm, called inverse nonlinear fast Fourier transform, for performing inverse NLFT with near-linear complexity. This algorithm is applicable to computing phase factors for both QSP and the generalized QSP (GQSP).

arXiv:2505.12615•May 19, 2025•0 citations

Mathematical and Numerical Analysis of Quantum Signal Processing

Lin Lin

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.

arXiv:2510.00443•Jul 1, 2026•0 citations
A pivotal algorithm in quantum signal processing represents a real-valued function as a specific entry in a product of SU(2)SU(2)SU(2) matrices, where an argument matrix alternates with a sequence of coefficient matrices. Recently, this framework has been identified as a nonlinear Fourier series, a concept studied across various mathematical disciplines. This Arbeitsgemeinschaft explored the intersection of quantum computing and harmonic analysis, emphasizing the potential of this connection.
Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research [Alexis et al. 2024] showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability. In this work we extend their result, showing that GQSP and the Non-Linear Fourier Transform over SU(2)SU(2)SU(2) are the same object. This statement - proven by a simple argument - has a bunch of consequences: first, the Riemann-Hilbert-Weiss algorithm can be turned, with little modifications and no penalty in complexity, into a unified, provably stable algorithm for the computation of phase factors in any QSP variant, including GQSP. Secondly, we derive a uniqueness result for the existence of GQSP phase factors based on the bijectivity of the Non-Linear Fourier Transform. Furthermore, NLFA provides a complete theory of infinite generalized quantum signal processing, which characterizes the class of functions approximable by GQSP protocols.
We define a nonlinear Fourier transform which maps sequences of contractive n×nn \times nn×n matrices to SU(2n)SU(2n)SU(2n)-valued functions on the circle T\mathbb{T}T. We characterize the image of finitely supported sequences and square-summable sequences on the half-line, and construct an inverse for SU(2n)SU(2n)SU(2n)-valued functions whose diagonal n×nn \times nn×n blocks are outer matrix functions. As an application, we relate this nonlinear Fourier transform with quantum signal processing over U(2n)U(2n)U(2n) and multivariate quantum signal processing.
The nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on SU(1,1)\mathrm{SU}(1,1)SU(1,1) has been widely studied, its SU(2)\mathrm{SU}(2)SU(2) variant has only recently attracted attention due to emerging applications in quantum signal processing (QSP) and quantum singular value transformation (QSVT). In this paper, we investigate the inverse NLFT on SU(2)\mathrm{SU}(2)SU(2) and establish the numerical stability of the layer stripping algorithm for the first time under suitable conditions. Furthermore, we develop a fast and numerically stable algorithm, called inverse nonlinear fast Fourier transform, for performing inverse NLFT with near-linear complexity. This algorithm is applicable to computing phase factors for both QSP and the generalized QSP (GQSP).
Quantum signal processing (QSP) provides a representation of scalar polynomials of degree ddd as products of matrices in SU(2)\mathrm{SU}(2)SU(2), parameterized by (d+1)(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)SU(2), fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure.