aiqbench analysis
This research extends Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) frameworks to handle arbitrary non-Hermitian matrices by introducing $n$-regular block encodings. The proposed method enables polynomial transformations on the eigenvalues of non-diagonalizable matrices, addressing a critical limitation in current quantum algorithm design where previous techniques were restricted to unitary or Hermitian operators. By utilizing only $O(\log n)$ ancillary qubits for this construction, the work offers a scalable path toward implementing complex matrix functions essential for advanced quantum simulations and linear algebra applications.
Quantum Eigenvalue Transformations for Arbitrary Matrices
arXiv:2604.19688v2 Announce Type: replace 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 $k$-th power reproduces the $k$-th 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(\log n)$ ancillary qubits and operations. Finally, we show that this construction induces the desired transformation on the eigenvalues associated with the Jordan normal form of the matrix; for non-diagonalizable 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 $\lambda \mapsto P(\lambda)$.
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 $k$-th power reproduces the $k$-th 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(\log n)$ ancillary qubits and operations. Finally, we show that this construction induces the desired transformation on the eigenvalues associated with the Jordan normal form of the matrix; for non-diagonalizable 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 $\lambda \mapsto P(\lambda)$.
arXiv:2604.19688 [quant-ph]
(or arXiv:2604.19688v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.19688 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 341 words
Related coverage
Contour-integral and Fourier transform based multivariable quantum eigenvalue transformation for commuting matrices
arXiv · Sep 30, 2026
Quantum phase estimation with optimal confidence interval using three control qubits
Quantum Journal · Aug 19, 2026
Optimal Quantum Eigenvalue Transformation via Linear Combinations of Hermitian Matrices
arXiv · Jul 29, 2026
Adaptive identification of low-degree polynomials in quantum singular value transformation: application to nonlinear quantum properties estimation
arXiv · Jun 10, 2026