Hamiltonian Singular Value Transformation

• HSVT is a Hamiltonian-based framework that extends QSVT by performing polynomial transformations on singular values using accessible Hamiltonian operations.
• It alternates evolution under Hamiltonians and Pauli-Z operations to isolate the off-diagonal block, effectively reducing the dynamics to two-level systems.
• This approach enables key quantum algorithms, including matrix multiplication, differential equation solving, and inverse block encoding, with efficient time evolution sequences.

Hamiltonian singular value transformation (HSVT) is the extension of quantum singular value transformation (QSVT) from the setting of a matrix embedded as a block of a unitary to the setting of a matrix embedded as a block of a Hamiltonian. In this formulation, polynomial transformations of the singular values are implemented by alternating the application of accessible Hamiltonians for chosen intervals, in a purely Hamiltonian context; the same framework also yields inverse block encoding and leads to procedures for matrix multiplication and for solving differential equations on quantum information processors (Lloyd et al., 2021). The underlying singular-value-transformation paradigm comes from QSVT, which applies polynomial transformations to the singular values of a block of a unitary and subsumes optimal Hamiltonian simulation and related matrix algorithms (Gilyén et al., 2018).

1. Formal setting and spectral reduction

The basic HSVT setting assumes the ability to apply a Hamiltonian

$$H=\begin{pmatrix} \ast & A\ A^\dagger & \ast \end{pmatrix},$$

where the $\ast$ blocks are arbitrary, the main off-diagonal blocks are $A$ and $A^\dagger$, and $A^\dagger A \leq I$ (Lloyd et al., 2021). The construction also assumes the Pauli-$Z$-type Hamiltonian

$$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$

By alternating application of $\pm H$ and $\pm Z$, as in echo/refocusing sequences, the diagonal elements of $H$ can be averaged out, leaving an effective Hamiltonian with only off-diagonal blocks (Lloyd et al., 2021).

A closely related spectral picture appears in the quantum polar decomposition algorithm, which uses the block Hamiltonian

$\ast$0

acting on the direct sum $\ast$1 (Lloyd et al., 2020). If

$\ast$2

then the eigenvectors of this block Hamiltonian are combinations of left and right singular vectors,

$\ast$3

with eigenvalues $\ast$4 (Lloyd et al., 2020). This structure is the spectral mechanism by which transformations on singular values are converted into Hamiltonian dynamics.

2. Alternating-Hamiltonian implementation

Within a two-dimensional subspace corresponding to a singular value $\ast$5 of $\ast$6, the effective Hamiltonian acts as

$\ast$7

where $\ast$8 is the Pauli-$\ast$9 matrix (Lloyd et al., 2021). HSVT therefore reduces to controlled motion on a family of two-level systems indexed by singular values.

The central construction alternates evolution under $A$0 and under $A$1, possibly conjugated by phase shifts $A$2, through sequences such as

$A$3

where

$A$4

described as a Hamiltonian with axis in the $A$5-plane (Lloyd et al., 2021). Through this sequence one can generate, for each subspace indexed by $A$6, polynomial transformations of the form $A$7 and $A$8, namely polynomials of the cosines and sines of $A$9 times evolution intervals (Lloyd et al., 2021).

This is the Hamiltonian analogue of QSVT: instead of alternating a block-encoded unitary with phase gates, it alternates accessible Hamiltonians for selected time intervals. The 2021 formulation explicitly identifies this as an example of the Quantum Alternating Operator Ansatz and as a generalized QAOA construction (Lloyd et al., 2021).

3. Resultant unitary and inverse block encoding

The general transformation achievable by HSVT has the form

$A^\dagger$0

where $A^\dagger$1 is a polynomial function of the singular values of $A^\dagger$2 with the same singular vectors, constructed from Chebyshev polynomial expansions as in QSVT (Lloyd et al., 2021). In this sense, HSVT inherits the function-calculus role of QSVT while replacing circuit-level block-encoding access by Hamiltonian access.

A special case is obtained by setting $A^\dagger$3, which yields

$A^\dagger$4

This is called inverse block encoding: given a Hamiltonian with $A^\dagger$5 as a block, one deterministically implements a unitary with $A^\dagger$6 as a block (Lloyd et al., 2021). The paper characterizes this as a “Hamiltonian-to-unitary” conversion and treats it as pivotal for subsequent algorithms.

The main procedures introduced around HSVT can be summarized as follows.

Procedure	Input requirement	Output or effect
HSVT	Hamiltonian $A^\dagger$7 with block $A^\dagger$8	Unitary block with any $A^\dagger$9 function of singular values
Inverse block encoding	As above, set $A^\dagger A \leq I$0	Unitary with block $A^\dagger A \leq I$1
Matrix multiplication/state prep.	State $A^\dagger A \leq I$2, Hamiltonian $A^\dagger A \leq I$3	State proportional to $A^\dagger A \leq I$4
Differential equation solver	$A^\dagger A \leq I$5, initial state	State $A^\dagger A \leq I$6
Matrix inversion/history states	As above	State proportional to $A^\dagger A \leq I$7

4. Algorithmic procedures and applications

For matrix multiplication, inverse block encoding acts on an input state $A^\dagger A \leq I$8 as

$A^\dagger A \leq I$9

so measurement of the second register yields $Z$0 (Lloyd et al., 2021). The same presentation states that amplitude amplification can quadratically speed up successful state preparation (Lloyd et al., 2021).

For first-order linear ordinary differential equations

$Z$1

the construction sets $Z$2 and iterates the inverse-block-encoding procedure (Lloyd et al., 2021). The resulting state has the form

$Z$3

which approximates the Euler forward solution, and measurement yields the evolved state $Z$4 (Lloyd et al., 2021). The same formulation states that this is valid for dissipative systems with $Z$5, as required by $Z$6 (Lloyd et al., 2021).

By additional manipulation, the method also enables probabilistic quantum matrix inversion and obtains the “history state” for ODE solutions as required in quantum simulation algorithms (Lloyd et al., 2021). These applications are significant because they are presented as purely Hamiltonian procedures rather than gate-decomposition-first implementations.

5. Relation to QAOA, polar decomposition, and recursive constructions

HSVT is explicitly described as generalized QAOA: instead of variationally optimizing a fixed-cost and mixer Hamiltonian, it alternates application of two or more accessible Hamiltonians for selected time intervals (Lloyd et al., 2021). The same source states that, as with QAOA, the Lie algebra generated by the set of accessible Hamiltonians can densely span the full space of unitaries, providing both universality and flexibility for variational optimization (Lloyd et al., 2021).

An earlier Hamiltonian-level route to singular-value manipulation is the quantum polar decomposition algorithm. It shows that access to

$Z$7

translates into deterministic implementation of the unitary or isometry $Z$8 through the sign function, and of $Z$9 for the positive part $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$0 through functions of $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$1; the same work states that it can perform a Hamiltonian version of QSVT (Lloyd et al., 2020). This places HSVT in direct continuity with polar decomposition, pretty good measurements, the quantum Procrustes problem, and positive-part constructions (Lloyd et al., 2020).

A later development is recursive QET/QSVT, which organizes complicated matrix functions by recursively composing low-degree transformations with analytically chosen parameters (Mizuta et al., 2023). For the matrix sign function, an analytically obtained parameter set composed of only $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$2 different values is sufficient for executing QET with an arbitrarily small error $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$3 (Mizuta et al., 2023). The same framework generalizes to singular-value transformations, with the recursion

$$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$4

converging to $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$5, the unitary part of the polar decomposition (Mizuta et al., 2023). This suggests an analytic route to HSVT-style parameter synthesis in regimes where high-degree phase finding is numerically unstable.

6. Scope, complexity, and adjacent frameworks

The 2021 HSVT formulation emphasizes a purely Hamiltonian implementation that avoids the need for deep quantum circuits or explicit logical gate decomposition and is accessible to systems controlled via time-dependent semiclassical fields, including analog and near-term quantum devices (Lloyd et al., 2021). It also states that the number of alternations required is

$$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$6

for error $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$7, matching or improving upon circuit-based quantum algorithms (Lloyd et al., 2021).

For Hermitian Hamiltonian simulation, later QSVT-based analyses state that QSVT achieves the minimum simulation time and that, within that framework, oblivious amplitude amplification gives query complexity $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$8, whereas fixed-point amplitude amplification gives $$Z=\begin{pmatrix} I & 0\ 0 & -I \end{pmatrix}.$$9 (Toyoizumi et al., 2023). Block-encoding-free variants developed later eliminate block encoding, need only a single ancilla qubit, and use direct Hamiltonian simulation with circuit depth

$\pm H$0

(Chakraborty et al., 3 Apr 2025). Randomized QSVT methods similarly avoid block encodings, use only a single ancilla qubit, and achieve gate complexity independent of the number of Hamiltonian terms, with quadratic dependence on the degree of the target polynomial (Wang et al., 8 Oct 2025). These developments are not HSVT in the narrow 2021 sense, but they continue the broader shift toward Hamiltonian-native singular-value manipulation.

A recurring misconception is that singular-value transformation already covers arbitrary eigenvalue transformation. Later work distinguishes the two: eigenvalue transformations are distinct, especially for non-normal matrices, and are stated to be beyond the reach of the QSVT framework (An et al., 2024, Jiang et al., 17 Jan 2026). Laplace-transform-based and contour-integral-based methods therefore target functions such as $\pm H$1, $\pm H$2, and general holomorphic $\pm H$3 for dissipative or non-normal matrices, whereas HSVT remains a singular-value framework (An et al., 2024, Jiang et al., 17 Jan 2026).

Another boundary concerns classical simulability. For sparse matrices, low-degree polynomial QSVT can be classically simulated efficiently with arbitrarily small constant precision, and the same paper states that the dequantization technique applies also to Hamiltonian singular value transformation when the function is an even low-degree polynomial, the Hamiltonian is sparse, and access to a guiding vector is samplable (Gharibian et al., 2021). In the same source, inverse-polynomial precision becomes BQP-complete (Gharibian et al., 2021). This does not diminish HSVT’s algorithmic role; it clarifies that the regime of claimed quantum advantage is sensitive to precision, access model, and the degree of the transformed polynomial.