Infinite quantum signal processing
1Department of Mathematics, University of California, Berkeley, CA 94720, USA.
2Applied Mathematics and Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA
3Challenge Institute for Quantum Computation, University of California, Berkeley, CA 94720, USA
4Institute for Computational and Mathematical Engineering (ICME), Stanford University, Stanford, CA 94305, USA.
| Published: | 2024-12-10, volume 8, page 1558 |
| Eprint: | arXiv:2209.10162v3 |
| Doi: | https://doi.org/10.22331/q-2024-12-10-1558 |
| Citation: | Quantum 8, 1558 (2024). |
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
Quantum signal processing (QSP) represents a real scalar polynomial of degree $d$ using a product of unitary matrices of size $2\times 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\to \infty$. 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 $\ell^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 $\ell^1$ space. The algorithm uses only double precision arithmetic operations, and provably converges when the $\ell^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\to \infty$.
► BibTeX data
► References
[1] M. Alexis, L. Lin, G. Mnatsakanyan, C. Thiele, and W. Jiasu. Infinite quantum signal processing for arbitrary szegö functions. 2024. arXiv:2407.05634.
arXiv:2407.05634
[2] M. Alexis, G. Mnatsakanyan, and C. Thiele. Quantum signal processing and nonlinear fourier analysis. Revista Matemática Complutense, 37, 06 2024. doi:10.1007/s13163-024-00494-5.
https://doi.org/10.1007/s13163-024-00494-5
[3] R. Chao, D. Ding, A. Gilyén, C. Huang, and M. Szegedy. Finding Angles for Quantum Signal Processing with Machine Precision. 2020. arXiv:2003.02831.
arXiv:2003.02831
[4] A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su. Toward the first quantum simulation with quantum speedup. Proc. Nat. Acad. Sci., 115(38):9456–9461, 2018. doi:10.1073/pnas.1801723115.
https://doi.org/10.1073/pnas.1801723115
[5] Y. Dong and L. Lin. Random circuit block-encoded matrix and a proposal of quantum linpack benchmark. Phys. Rev. A, 103:062412, Jun 2021. doi:10.1103/PhysRevA.103.062412.
https://doi.org/10.1103/PhysRevA.103.062412
[6] Y. Dong, L. Lin, H. Ni, and J. Wang. Robust iterative method for symmetric quantum signal processing in all parameter regimes. SIAM J. Sci. Comput., 46:A2951–A2971, 2024. doi:10.1137/23M1598192.
https://doi.org/10.1137/23M1598192
[7] Y. Dong, L. Lin, and Y. Tong. Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices. PRX Quantum, 3:040305, Oct 2022. doi:10.1103/PRXQuantum.3.040305.
https://doi.org/10.1103/PRXQuantum.3.040305
[8] Y. Dong, X. Meng, K. B. Whaley, and L. Lin. Efficient phase factor evaluation in quantum signal processing. Phys. Rev. A, 103:042419, Apr 2021. doi:10.1103/PhysRevA.103.042419.
https://doi.org/10.1103/PhysRevA.103.042419
[9] Y. Dong, K. B. Whaley, and L. Lin. A quantum hamiltonian simulation benchmark. npj Quantum Information, 8, Nov 2022. doi:10.1038/s41534-022-00636-x.
https://doi.org/10.1038/s41534-022-00636-x
[10] D. Fang, L. Lin, and Y. Tong. Time-marching based quantum solvers for time-dependent linear differential equations. Quantum, 7:955, Mar. 2023. doi:10.22331/q-2023-03-20-955.
https://doi.org/10.22331/q-2023-03-20-955
[11] A. Gilyén, S. Lloyd, I. Marvian, Y. Quek, and M. M. Wilde. Quantum algorithm for petz recovery channels and pretty good measurements. Phys. Rev. Lett., 128:220502, Jun 2022. doi:10.1103/PhysRevLett.128.220502.
https://doi.org/10.1103/PhysRevLett.128.220502
[12] A. Gilyén, Y. Su, G. H. Low, and N. Wiebe. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019. doi:10.48550/arXiv.1806.01838.
https://doi.org/10.48550/arXiv.1806.01838
[13] J. Haah. Product decomposition of periodic functions in quantum signal processing. Quantum, 3:190, Oct. 2019. doi:10.22331/q-2019-10-07-190.
https://doi.org/10.22331/q-2019-10-07-190
[14] N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, second edition, 2002. doi:10.1137/1.9780898718027.
https://doi.org/10.1137/1.9780898718027
[15] S. Lang. Real and functional analysis, volume 142. Springer Science & Business Media, 2012. doi:10.1007/978-1-4612-0897-6.
https://doi.org/10.1007/978-1-4612-0897-6
[16] L. Lin and Y. Tong. Near-optimal ground state preparation. Quantum, 4:372, Dec. 2020. doi:10.22331/q-2020-12-14-372.
https://doi.org/10.22331/q-2020-12-14-372
[17] L. Lin and Y. Tong. Optimal quantum eigenstate filtering with application to solving quantum linear systems. Quantum, 4:361, Nov. 2020. doi:10.22331/q-2020-11-11-361.
https://doi.org/10.22331/q-2020-11-11-361
[18] G. H. Low and I. L. Chuang. Optimal hamiltonian simulation by quantum signal processing. Phys. Rev. Lett., 118:010501, Jan 2017. doi:10.1103/PhysRevLett.118.010501.
https://doi.org/10.1103/PhysRevLett.118.010501
[19] J. M. Martyn, Y. Liu, Z. E. Chin, and I. L. Chuang. Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation. The Journal of Chemical Physics, 158(2):024106, 01 2023. doi:10.1063/5.0124385.
https://doi.org/10.1063/5.0124385
[20] J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang. A grand unification of quantum algorithms. PRX Quantum, 2:040203, Dec 2021. doi:10.1103/PRXQuantum.2.040203.
https://doi.org/10.1103/PRXQuantum.2.040203
[21] D. Motlagh and N. Wiebe. Generalized quantum signal processing. PRX Quantum, 5:020368, Jun 2024. doi:10.1103/PRXQuantum.5.020368.
https://doi.org/10.1103/PRXQuantum.5.020368
[22] J. Nocedal and S. J. Wright. Numerical optimization. Springer Verlag, 1999. doi:10.1007/978-0-387-40065-5.
https://doi.org/10.1007/978-0-387-40065-5
[23] G. U. Ramos. Roundoff error analysis of the fast fourier transform. Mathematics of Computation, 25(116):757–768, 1971. doi:10.2307/2004342.
https://doi.org/10.2307/2004342
[24] L. N. Trefethen. Approximation theory and approximation practice, volume 164. SIAM, 2019. doi:10.1137/1.9781611975949.
https://doi.org/10.1137/1.9781611975949
[25] J. Wang, Y. Dong, and L. Lin. On the energy landscape of symmetric quantum signal processing. Quantum, 6:850, Nov. 2022. doi:10.22331/q-2022-11-03-850.
https://doi.org/10.22331/q-2022-11-03-850
[26] L. Ying. Stable factorization for phase factors of quantum signal processing. Quantum, 6:842, Oct. 2022. doi:10.22331/q-2022-10-20-842.
https://doi.org/10.22331/q-2022-10-20-842
Cited by
[1] Maria-Andreea Filip and Nathan Fitzpatrick, "Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion", Quantum Science and Technology 11 1, 015027 (2026).
[2] Hongkang Ni and Lexing Ying, "Fast Phase Factor Finding for Quantum Signal Processing", SIAM Journal on Scientific Computing 48 4, B651 (2026).
[3] Kevin J. Joven, Elin Ranjan Das, Joel Bierman, Aishwarya Majumdar, Masoud Hakimi Heris, and Yuan Liu, "Scalable quantum computational science: A perspective from block-encodings and polynomial transformations", APL Computational Physics 2 1, 010901 (2026).
[4] Nikita Guseynov and Nana Liu, "Efficient explicit circuit for quantum state preparation of piecewise continuous functions", Physical Review A 113 1, 012604 (2026).
[5] Lorenzo Laneve and Stefan Wolf, "On multivariate polynomials achievable with quantum signal processing", Quantum 9, 1641 (2025).
[6] Natt Luangsirapornchai, Peeranat Sanglaor, Apimuk Sornsaeng, Stéphane Bressan, Thiparat Chotibut, Kamonluk Suksen, and Prabhas Chongstitvatana, "Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators", IEEE Access 13, 52738 (2025).
[7] Lin Lin, Volume 7: Invited Lectures: Sections 15–20 57 (2026) ISBN:978-1-61197-872-8.
[8] Rei Sakuma, Kaito Wada, Shu Kanno, Kimberlee Keithley, Kenji Sugisaki, Takashi Abe, Hajime Nakamura, and Naoki Yamamoto, "Quantum-phase-estimation-based filtering: Performance analysis and application to low-energy spectral calculations", Physical Review A 113 1, 012602 (2026).
[9] Lorenzo Laneve, "An adversary bound for quantum signal processing", Quantum 10, 2025 (2026).
[10] Andreea-Iulia Lefterovici, Michael Perk, Debora Ramacciotti, Antonio F. Rotundo, Shawn E. Skelton, and Martin Steinbach, "Beyond Asymptotic Scaling: Comparing Functional Quantum Linear Solvers", IEEE Transactions on Quantum Engineering 7, 1 (2026).
[11] John M. Martyn, Zane M. Rossi, Kevin Z. Cheng, Yuan Liu, and Isaac L. Chuang, "Parallel Quantum Signal Processing Via Polynomial Factorization", Quantum 9, 1834 (2025).
[12] Zane M. Rossi, Jack L. Ceroni, and Isaac L. Chuang, "Modular quantum signal processing in many variables", Quantum 9, 1776 (2025).
[13] Sapthagiri Miriyala and Venkata Ramireddy Chirra, "From Quantum Algorithm Primitives to Design Patterns: A Unified Framework for NISQ and Fault‐Tolerant Regimes", Advanced Quantum Technologies 9 6, e70310 (2026).
[14] V. Karthikeyan and Y. Palin Visu, Artificial Intelligence and Robotics 121 (2026) ISBN:9783119145206.
[15] Zheng Zhang and Minzhong Luo, Proceedings of the 23rd ACM International Conference on Computing Frontiers 133 (2026) ISBN:9798400725685.
[16] Alexander M. Dalzell, Sam McArdle, Mario Berta, Przemyslaw Bienias, Chi-Fang Chen, András Gilyén, Connor T. Hann, Michael J. Kastoryano, Emil T. Khabiboulline, Aleksander Kubica, Grant Salton, Samson Wang, and Fernando G. S. L. Brandão, "Quantum algorithms: A survey of applications and end-to-end complexities", arXiv:2310.03011, (2023).
[17] Yulong Dong, Lin Lin, Hongkang Ni, and Jiasu Wang, "Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes", SIAM Journal on Scientific Computing 46 5, A2951 (2024).
[18] Shuntaro Yamamoto and Nobuyuki Yoshioka, "Robust Angle Finding for Generalized Quantum Signal Processing", arXiv:2402.03016, (2024).
[19] Daan Camps, Lin Lin, Roel Van Beeumen, and Chao Yang, "Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices", arXiv:2203.10236, (2022).
[20] Hongkang Ni and Lexing Ying, "Quantum wave packet transforms with compact frequency support", arXiv:2405.00929, (2024).
[21] Michel Alexis, Lin Lin, Gevorg Mnatsakanyan, Christoph Thiele, and Jiasu Wang, "Infinite quantum signal processing for arbitrary Szegő functions", arXiv:2407.05634, (2024).
[22] Jasmine Sinanan-Singh, Gabriel L. Mintzer, Isaac L. Chuang, and Yuan Liu, "Single-shot Quantum Signal Processing Interferometry", Quantum 8, 1427 (2024).
[23] Michel Alexis, Gevorg Mnatsakanyan, and Christoph Thiele, "One sided orthogonal polynomials and a pointwise convergence result for $SU(2)$-valued nonlinear Fourier series", arXiv:2507.05124, (2025).
[24] Junaid Aftab, Christoph Schwab, Haizhao Yang, and Jakob Zech, "Quantum Circuit Encodings of Polynomial Chaos Expansions", arXiv:2506.01811, (2025).
[25] Yulong Dong, Jonathan Gross, and Murphy Yuezhen Niu, "Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing", arXiv:2209.11207, (2022).
[26] Mark Steudtner, Sam Morley-Short, William Pol, Sukin Sim, Cristian L. Cortes, Matthias Loipersberger, Robert M. Parrish, Matthias Degroote, Nikolaj Moll, Raffaele Santagati, and Michael Streif, "Fault-tolerant quantum computation of molecular observables", Quantum 7, 1164 (2023).
[27] Zane M. Rossi and Isaac L. Chuang, "Semantic embedding for quantum algorithms", Journal of Mathematical Physics 64 12, 122202 (2023).
[28] S. E. Skelton, "Mostly Harmless Methods for QSP-Processing with Laurent Polynomials", arXiv:2408.04321, (2024).
[29] Zane M. Rossi, Victor M. Bastidas, William J. Munro, and Isaac L. Chuang, "Quantum signal processing with continuous variables", arXiv:2304.14383, (2023).
[30] Michel Alexis, Gevorg Mnatsakanyan, and Christoph Thiele, "Quantum signal processing and nonlinear Fourier analysis", arXiv:2310.12683, (2023).
[31] Niladri Gomes, Hokiat Lim, and Nathan Wiebe, "Multivariable QSP and Bosonic Quantum Simulation using Iterated Quantum Signal Processing", arXiv:2408.03254, (2024).
[32] Hongkang Ni and Lexing Ying, "Fast Phase Factor Finding for Quantum Signal Processing", arXiv:2410.06409, (2024).
[33] S. E. Skelton, "The Hitchhiker's Guide to QSP pre-processing", arXiv:2501.05977, (2025).
[34] Diyi Liu, Weijie Du, Lin Lin, James P. Vary, and Chao Yang, "An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian", arXiv:2402.11205, (2024).
[35] Haoya Li, Hongkang Ni, and Lexing Ying, "On efficient quantum block encoding of pseudo-differential operators", arXiv:2301.08908, (2023).
[36] Kiichiro Toyoizumi, Kaito Wada, Naoki Yamamoto, and Kazuo Hoshino, "Quantum conjugate gradient method using the positive-side quantum eigenvalue transformation", arXiv:2404.02713, (2024).
The above citations are from Crossref's cited-by service (last updated successfully 2026-08-10 23:27:56) and SAO/NASA ADS (last updated successfully 2026-08-10 23:27:57). The list may be incomplete as not all publishers provide suitable and complete citation data.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.