Stable factorization for phase factors of quantum signal processing

Abstract

This paper proposes a new factorization algorithm for computing the phase factors of quantum signal processing. The proposed algorithm avoids root finding of high degree polynomials by using a key step of Prony's method and is numerically stable in the double precision arithmetics. Experimental results are reported for Hamiltonian simulation, eigenstate filtering, matrix inversion, and Fermi-Dirac operator.

References in corpus (1)

• Lecture Notes on Quantum Algorithms for Scientific Computation

Cited by in corpus (16)

• Time-marching based quantum solvers for time-dependent linear differential equations
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• On efficient quantum block encoding of pseudo-differential operators
• Infinite quantum signal processing
• Toward Mixed Analog-Digital Quantum Signal Processing: Quantum AD/DA Conversion and the Fourier Transform
• Halving the Cost of Quantum Algorithms with Randomization
• Complementary polynomials in quantum signal processing
• Infinite quantum signal processing for arbitrary Szegő functions
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Encoding of linear kinetic plasma problems in quantum circuits via data compression
• Heisenberg-limited adaptive gradient estimation for multiple observables
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• Parallel Quantum Signal Processing Via Polynomial Factorization
• Two exact quantum signal processing results
• Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$
• An adversary bound for quantum signal processing