Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
Pierre-Antoine Bernard, Nathan Wiebe

TL;DR
This paper develops a new analytical framework for quantum signal processing using orthogonal polynomial theory, providing explicit formulas for angles and characterizing achievable polynomial bases.
Contribution
It introduces a novel method leveraging orthogonal and biorthogonal polynomial theory to explicitly determine quantum signal processing angles and characterize achievable polynomial bases.
Findings
Explicit formulas for quantum signal processing angles for Hermite, Jacobi, and Rogers-Szeg ext{"o} polynomial families.
Achieves $O( ext{log}(1/\epsilon))$ gate complexity for approximating smooth functions.
Characterizes polynomials achievable by $ ext{SU}(1,1)$-QSP in terms of roots.
Abstract
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial basis for block-encoding any polynomial of a unitary. We characterize the achievable polynomial bases in terms of their orthogonality or biorthogonality with respect to a linear functional admitting an integral representation. Explicit expressions for the quantum signal processing angles are derived for families of polynomial sequences, including Hermite, Jacobi, and Rogers-Szeg\H{o} polynomials. We show that rotation angles are required to encode a sequence of polynomials in these classes up to degree . We use this result to show that an -approximation of a smooth function can be block-encoded using gates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
