Infinite quantum signal processing

by   Yulong Dong, et al.

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2× 2, parameterized by (d+1) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d→∞. While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ^1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ^1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ^1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d. This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d→∞.


page 1

page 2

page 3

page 4


Stable factorization for phase factors of quantum signal processing

This note proposes a new factorization algorithm for computing the phase...

On the energy landscape of symmetric quantum signal processing

Symmetric quantum signal processing provides a parameterized representat...

Robust iterative method for symmetric quantum signal processing in all parameter regimes

This paper addresses the problem of solving nonlinear systems in the con...

Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing

Leveraging quantum effects in metrology such as entanglement and coheren...

Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis

This paper deals with the problem of numerically computing the roots of ...

An Improved Classical Singular Value Transformation for Quantum Machine Learning

Quantum machine learning (QML) has shown great potential to produce larg...

Linear Classifiers Under Infinite Imbalance

We study the behavior of linear discriminant functions for binary classi...

Please sign up or login with your details

Forgot password? Click here to reset