Finding Angles for Quantum Signal Processing with Machine Precision
Rui Chao, Dawei Ding, Andras Gilyen, Cupjin Huang, Mario Szegedy

TL;DR
This paper introduces a new algorithm for quantum signal processing that efficiently finds large sequences of angles using a halving method and capitalization, enabling practical applications like Hamiltonian simulation with standard hardware.
Contribution
The paper presents a novel algorithm with halving and capitalization techniques for finding angle sequences in quantum signal processing, achieving high efficiency and precision.
Findings
Able to find over 3000 angles within 5 minutes
Operates effectively in standard double precision arithmetic
Demonstrates strong performance in Hamiltonian simulation applications
Abstract
We describe an algorithm for finding angle sequences in quantum signal processing, with a novel component we call halving based on a new algebraic uniqueness theorem, and another we call capitalization. We present both theoretical and experimental results that demonstrate the performance of the new algorithm. In particular, these two algorithmic ideas allow us to find sequences of more than 3000 angles within 5 minutes for important applications such as Hamiltonian simulation, all in standard double precision arithmetic. This is native to almost all hardware.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Numerical Methods and Algorithms · Computability, Logic, AI Algorithms
