Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Quantum eigenvalue transformations for arbitrary matrices

Xabier Gutiérrez*

Lorenzo Laneve

Mikel Sanz

  • *Contact author: xabier.gutierrez@ehu.eus

Phys. Rev. Research 8, L042017 – Published 16 November, 2026

DOI: https://doi.org/10.1103/sm6w-5ttl

Abstract

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) provide an efficient framework for implementing polynomials of block-encoded matrices, and thus offer a systematic approach to quantum algorithm design. However, despite a number of recent advances, important limitations remain. In particular, QSP can only transform unitary matrices, by applying a polynomial to their eigenvalues, while QSVT is a singular value transformation and thus one can only obtain the polynomial of Hermitian matrices. As a consequence, these techniques do not directly apply to an arbitrary non-Hermitian matrix that is not diagonalizable. In this work, we propose a simple yet powerful method to extend these ideas to arbitrary square matrices by acting on their eigenvalues. To this end, we introduce the notion of an n-regular block encoding, namely, a block encoding whose kth power reproduces the kth power of the encoded matrix for every 0≤k≤n. We show that applying QSP to any unitary with this property is equivalent to applying a polynomial of degree at most n to the block-encoded matrix, independently of its internal structure. Moreover, we provide a simple construction that transforms any block encoding into an n-regular one using only O(logn) ancillary qubits and O(nlog(n/ε)) operations. Finally, we show that this construction induces the desired transformation on the eigenvalues associated with the Jordan normal form of the matrix; for nondiagonalizable matrices, this yields the full matrix function P(A), whose action on each Jordan block involves the derivatives of P, and not merely the map λ↦P(λ).

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (44)

  1. G. H. Low and I. L. Chuang, Optimal Hamiltonian simulation by quantum signal processing, Phys. Rev. Lett. 118, 010501 (2017).
  2. J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2, 040203 (2021).
  3. G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
  4. A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM J. Comput. 46, 1920 (2017).
  5. L. Lin and Y. Tong, Near-optimal ground state preparation, Quantum 4, 372 (2020).
  6. 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 (2022).
  7. S. McArdle, A. Gilyén, and M. Berta, Quantum state preparation without coherent arithmetic, Phys. Rev. Lett. 136, 240603 (2026).
  8. L. Laneve, Robust black-box quantum-state preparation via quantum signal processing, arXiv:2305.04705.
  9. G. H. Low, T. J. Yoder, and I. L. Chuang, Methodology of resonant equiangular composite quantum gates, Phys. Rev. X 6, 041067 (2016).
  10. 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 (ACM, 2019), pp. 193–204.
  11. D. Motlagh and N. Wiebe, Generalized quantum signal processing, PRX Quantum 5, 020368 (2024).
  12. M. Alexis, G. Mnatsakanyan, and C. Thiele, Quantum signal processing and nonlinear Fourier analysis, Rev. Mat. Complut. 37, 655 (2024).
  13. M. Alexis, L. Lin, G. Mnatsakanyan, C. Thiele, and J. Wang, Infinite quantum signal processing for arbitrary Szegö functions, Commun. Pure Appl. Math. 79, 123 (2026).
  14. L. Laneve, Generalized quantum signal processing and non-linear Fourier transform are equivalent, arXiv:2503.03026.
  15. H. Ni, R. Sarkar, L. Ying, and L. Lin, Inverse nonlinear fast Fourier transform on SU(2) with applications to quantum signal processing, arXiv:2505.12615.
  16. C. Sünderhauf, Generalized quantum singular value transformation, arXiv:2312.00723.
  17. G. H. Low and Y. Su, Quantum eigenvalue processing, SIAM J. Comput. 55, 135 (2026).
  18. D. An, J.-P. Liu, and L. Lin, Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost, Phys. Rev. Lett. 131, 150603 (2023).
  19. X. Huang and D. An, Fourier transform-based linear combination of Hamiltonian simulation, arXiv:2508.19596.
  20. G. H. Low and R. D. Somma, Optimal quantum simulation of linear non-unitary dynamics, arXiv:2508.19238.
  21. D. An, A. M. Childs, L. Lin, and L. Ying, Laplace transform–based quantum eigenvalue transformation via linear combination of Hamiltonian simulation, SIAM J. Comput. 55, 376 (2026).
  22. H. Ni and L. Ying, Quantum eigenvalue transformation via linear combination of Hamiltonian simulation: A Weyl calculus approach, arXiv:2606.29848.
  23. S. Jiang and D. An, Contour-integral based quantum eigenvalue transformation: Analysis and applications, arXiv:2601.11959.
  24. Y. Wang, Y. Liang, H. Chen, and J.-P. Liu, Optimal quantum eigenvalue transformation via linear combinations of Hermitian matrices, arXiv:2607.25812.
  25. A. M. Childs and N. Wiebe, Hamiltonian simulation using linear combinations of unitary operations, Quantum Inf. Comput. 12, 901 (2012).
  26. J.-P. Liu, H. O. Kolden, H. K. Krovi, N. F. Loureiro, K. Trivisa, and A. M. Childs, Efficient quantum algorithm for dissipative nonlinear differential equations, Proc. Natl. Acad. Sci. USA 118, e2026805118 (2021).
  27. H. Krovi, Improved quantum algorithms for linear and nonlinear differential equations, Quantum 7, 913 (2023).
  28. A. M. Childs, J.-P. Liu, and A. Ostrander, High-precision quantum algorithms for partial differential equations, Quantum 5, 574 (2021).
  29. H. Weimer, A. Kshetrimayum, and R. Orús, Simulation methods for open quantum many-body systems, Rev. Mod. Phys. 93, 015008 (2021).
  30. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for a proof of Lemma t4 (Appendix A).
  31. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for the example (Appendix B).
  32. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for the proof of Theorem t5 (Appendix C).
  33. G. H. Low and N. Wiebe, Hamiltonian simulation in the interaction picture, arXiv:1805.00675.
  34. D. Fang, L. Lin, and Y. Tong, Time-marching based quantum solvers for time-dependent linear differential equations, Quantum 7, 955 (2023).
  35. A. M. Dalzell, S. McArdle, M. Berta, P. Bienias, C.-F. Chen, A. Gilyén, C. T. Hann, M. J. Kastoryano, E. T. Khabiboulline, A. Kubica, G. Salton, S. Wang, and F. G. S. L. Brandão, Quantum Algorithms: A Survey of Applications and End-to-End Complexities (Cambridge University Press, Cambridge, 2025).
  36. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, Cambridge, 2010).
  37. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for an example of a polynomial transformation of a Jordan block (Appendix B).
  38. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for a comparison with other methods in the short-time regime (Appendix D), which includes Ref. [44].
  39. C. Wang, H.-Y. Liu, C. Xue, X.-N. Zhuang, M. Dou, Z.-Y. Chen, and G.-P. Guo, Quantum simulation of non-Hermitian special functions and dynamics via contour-based matrix decomposition, Quantum Sci. Technol. 11, 035027 (2026).
  40. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for an application to second-order wave dynamics (Appendix E).
  41. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for the proof of Theorem t7 (Appendix F).
  42. Lap-LCHS cannot in general be applied to nilpotent matrices. As a simple example, consider the Jordan block A+A†=X⪰0 such that all eigenvalues are 0 but A+A†=X⪰0.
  43. See Supplemental Material at http://link.aps.org/supplemental/10.1103/sm6w-5ttl for the domain manipulation through conformal maps (Appendix G).
  44. D. W. Berry, D. Motlagh, G. Pantaleoni, and N. Wiebe, Doubling the efficiency of Hamiltonian simulation via generalized quantum signal processing, Phys. Rev. A 110, 012612 (2024).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation