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

by   Yulong Dong, et al.

This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton's method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function αcos(1000 x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α=0.9, and the number of iterations only increases to 18 iterations when α=1-10^-9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product states the structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method's efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.


page 1

page 2

page 3

page 4


Newton's Method in Three Precisions

We describe a three precision variant of Newton's method for nonlinear e...

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of d...

On the energy landscape of symmetric quantum signal processing

Symmetric quantum signal processing provides a parameterized representat...

Stable factorization for phase factors of quantum signal processing

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

A New Refinement-Free Preconditioner for the Symmetric Formulation in Electroencephalography

Widely employed for the accurate solution of the electroencephalography ...

A Fast Hierarchically Preconditioned Eigensolver Based On Multiresolution Matrix Decomposition

In this paper we propose a new iterative method to hierarchically comput...

Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing

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

Please sign up or login with your details

Forgot password? Click here to reset