Block encodings of non-unitary matrix functions are central to quantum numerical linear algebra. Hamiltonian simulation is a natural input model for Hermitian matrices, but accurate block encodings often incur large subnormalization. We decouple the accuracy from the subnormalization by formulating the matrix-function block encoding as a Fourier-extension approximation problem, yielding a linear combination of unitaries for Hermitian matrix inputs. Fourier extensions approximate non-periodic functions by a Fourier series on a larger periodic domain, creating redundant coefficients that can be optimized for their absolute sum, and hence subnormalization. The coefficients may be chosen for optimal subnormalization with algebraic convergence, by tuning the subnormalization bound for increasing rates of exponential convergence, or by Sobolev-regularized fitting to accommodate more general spectral sets. Fourier-extension block encodings apply to eigenvalue transforms of Hermitian matrices, or to odd singular-value transforms of general matrices, including as a quantum linear systems algorithm.
Block encodings of non-unitary matrix functions are central to quantum numerical linear algebra. Hamiltonian simulation is a natural input model for Hermitian matrices, but accurate block encodings often incur large subnormalization. We decouple the accuracy from the subnormalization by formulating the matrix-function block encoding as a Fourier-extension approximation problem, yielding a linear combination of unitaries for Hermitian matrix inputs. Fourier extensions approximate non-periodic functions by a Fourier series on a larger periodic domain, creating redundant coefficients that can be optimized for their absolute sum, and hence subnormalization. The coefficients may be chosen for optimal subnormalization with algebraic convergence, by tuning the subnormalization bound for increasing rates of exponential convergence, or by Sobolev-regularized fitting to accommodate more general spectral sets. Fourier-extension block encodings apply to eigenvalue transforms of Hermitian matrices, or to odd singular-value transforms of general matrices, including as a quantum linear systems algorithm.
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.
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(logn) 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 λ↦P(λ).
Many problems in linear algebra-such as those arising from non-Hermitian physics, transcorrelated quantum chemistry and differential equations-can be solved on a quan-tum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum Singular Value Transformation (QSVT) framework is ill-suited to this task, as eigenvalues and singular values are different in general. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary polynomial transformations on eigenvalues of block-encoded non-normal operators, and a related Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra. QEVT has query complexity to the block encoding nearly recovering that of the QSVT for a Hermitian input, and QEVE achieves the Heisenberg-limited scaling for diagonalizable input matrices. As applications, we develop a linear differential equation solver with strictly linear time query complexity for average-case diagonalizable operators, as well as a ground state preparation algorithm that upgrades previous nearly optimal results for Hermitian Hamiltonians to diagonalizable matrices with real spectra. Underpinning our algorithms is an efficient method to prepare a quantum super-position of Faber polynomials, which generalize the nearly-best uniform approximation properties of Chebyshev polynomials to the complex plane. Of independent interest, we also develop techniques to generatenFourier coefficients with 0 (poly log (n)) gates compared to prior approaches with linear cost.
Quantum algorithms for basic numerical linear algebraic tasks have proven essential for translating diverse problems to a unified quantum computational context. Many of these tasks---e.g., applying a function to the spectrum of a matrix embedded in a unitary process (a so-called block encoding), or taking linear combinations of block encodings---are well-addressed by techniques like quantum singular value transformation or linear combination of unitaries. However, there exist useful matrix transforms whose realization is unclear or inefficient. In this work we construct improved quantum algorithms for some of these transforms, the simplest of which is a polynomial function applied element-wise. We show the space required to compute quantum element-wise transforms (QEWTs) can be reduced exponentially in the degree of the applied function compared to prior work, and rectify errors in previous constructions. We prove novel space and query lower bounds for QEWTs, construct useful function families nearly saturating these bounds, and establish the hardness of QEWT dequantization. This represents the first sound theoretical treatment of QEWTs, and brings their resource requirements on par with other practical block encoding techniques. We present our algorithms alongside concrete applications to machine learning inference and signal processing.
Abstract. Many problems in linear algebra—such as those arising from non-Hermitian physics, transcorrelated quantum chemistry, and differential equations—can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum Singular Value Transformation (QSVT) framework is ill-suited for this task because eigenvalues and singular values are different in general. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary polynomial transformations on eigenvalues of block-encoded non-normal operators and a related Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra. QEVT has query complexity to the block encoding nearly recovering that of the QSVT for a Hermitian input, and QEVE achieves the Heisenberg-limited scaling for diagonalizable input matrices. As applications, we develop a linear differential equation solver with strictly linear time query complexity for average-case diagonalizable operators, as well as a ground state preparation algorithm that upgrades previous nearly optimal results for Hermitian Hamiltonians to diagonalizable matrices with real spectra. Underpinning our algorithms is an efficient method to prepare a quantum superposition of Faber polynomials, which generalize the nearly-best uniform approximation properties of Chebyshev polynomials to the complex plane. Of independent interest, we also develop techniques to generate [Formula: see text] Fourier coefficients with [Formula: see text] gates compared to prior approaches with linear cost.
Block encoding is the standard technique for accessing matrix data in quantum linear-algebra algorithms. Its implementation directly affects its subnormalization, which in turn controls the algorithm's success probability, simulation time, and downstream costs. Explicit construction of block encodings with provably optimal subnormalization exists for only a handful of operators, with bespoke calculations used in its design. In this work, we develop a framework to block encode translation-invariant finite-difference operators on a periodic grid. These operators are the finite-difference discretizations of the constant-coefficient partial differential equations that sit at the core of scientific computing. We show that the moment order of these stencils can be used to simultaneously determine the continuum operator approximated, the vanishing order of the Fourier symbol, and the cost of the block encoding. From there, we derive a closed-form optimality criterion as a function of the stencil coefficients, which certifies whether the construction attains the optimal subnormalization for an entire operator family, uniformly in grid size, and quantifies the gap when it does not. The framework subsumes optimal constructions for the Laplacian operator in the literature and can be used to certify new instances at higher even orders, including the biharmonic operator. Furthermore, we derive success-probability floors parameterized by spectral properties of the operator's symbol and find explicit constants for the block encoding of the advection-diffusion family for which no prior explicit spatial block encoding exists.