Quantum Eigenvalue Transformations for Arbitrary Matrices
Xabier Guti\'errez, Lorenzo Laneve, Mikel Sanz

TL;DR
This paper extends quantum polynomial transformation techniques to arbitrary matrices by introducing n-regular block encodings, enabling eigenvalue transformations beyond Hermitian or unitary matrices.
Contribution
It proposes a new method to apply quantum eigenvalue transformations to any square matrix via n-regular block encodings, overcoming previous limitations.
Findings
Introduces n-regular block encoding concept.
Shows how to transform any block encoding into n-regular form.
Enables polynomial transformations on arbitrary matrices' eigenvalues.
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 -regular block encoding, namely, a block encoding whose -th power…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
