---
title: Krylov Time Reversal (KTR)
url: https://www.emergentmind.com/topics/krylov-time-reversal-ktr
type: topic
---

# Krylov Time Reversal (KTR)

Krylov Time Reversal (KTR) is a quantum diagonalization protocol designed to enable extremal spectral estimation of Hamiltonians on near-term quantum devices without the overhead of controlled-unitary operations or ancilla qubits. KTR exploits time-reversal symmetry in Hamiltonian evolution, allowing the extraction of real-valued Krylov matrix elements via shallow circuits consisting only of Pauli-string measurements. This renders the approach especially suitable for hardware-constrained architectures and models with appropriate symmetries [2507.22559].

## 1. Classical Krylov Subspace Diagonalization and Quantum Generalization

Quantum Krylov Diagonalization (KQD) computes extremal eigenvalues of a Hamiltonian $H$ by constructing a Krylov subspace from time-evolved versions of an initial state $\ket{v_0}$:
\[
\text{Span}\{\ket{v_0}, e^{-iHt_1}\ket{v_0}, \ldots, e^{-iHt_{m-1}}\ket{v_0}\}.
\]
Overlap matrices,
\[
B_{ij} = \braket{v(t_i)}{v(t_j)}, \quad A_{ij} = \bra{v(t_i)}H\ket{v(t_j)},
\]
are assembled and the spectral problem is reduced to solving the generalized eigenvalue equation
\[
A\mathbf{x} = \lambda B \mathbf{x}.
\]
Traditional quantum KQD requires accessing complex overlaps and transition matrix elements, typically via controlled-unitary Hadamard tests, which are challenging on NISQ devices due to circuit depth and control requirements [2507.22559].

## 2. Time-Reversal Symmetry and Algebraic Foundations of KTR

KTR removes the need for controlled circuits by exploiting a unitary time-reversal involution $T$:
\[
T^2=I, \qquad T^\dagger=T, \qquad \{T,H\}=0.
\]
For an initial state $\ket{v_0}$ satisfying $T\ket{v_0}=c\ket{v_0}$ with $c\in\{\pm1\}$, $T$ reverses the sign of $H$ under conjugation. This symmetry yields the following exact relations for overlaps between time-evolved Krylov states:
- **Gram overlaps (Lemma 2.1):** For any $t_a, t_b \in \mathbb{R}$, with $\tau=\frac{t_b-t_a}{2}$,
  \[
  \braket{v(t_a)}{v(t_b)} = c\bra{v(\tau)}T\ket{v(\tau)} \in \mathbb{R}.
  \]
- **Hamiltonian overlaps (Lemma 2.2):**
  \[
  \bra{v(t_a)}H\ket{v(t_b)} = i c \bra{v(\tau)}(iHT)\ket{v(\tau)} \in i\mathbb{R}.
  \]
Consequently, the entire Krylov matrix pencil is constructed from expectation values of Hermitian Pauli-strings at a single intermediate time. All elements of $B$ are real-symmetric (Toeplitz), and those of $A$ are imaginary-skew-Toeplitz [2507.22559].

## 3. Quantum-Circuit Implementation

The KTR protocol requires only shallow, control-free quantum circuits:

- **Preparation:** For a chosen initial state $\ket{v_0}$, produce $\ket{v(\tau)} = e^{-iH\tau}\ket{v_0}$ for each time-shift $\tau$ in the selected grid.
- **Measurement of $\langle T\rangle_\tau$:**
  1. Prepare $\ket{v(\tau)}$.
  2. Rotate each qubit into the eigenbasis of its associated Pauli in $T$ (e.g., $S^\dagger H$ if $T = \bigotimes Y$).
  3. Measure all qubits in the computational basis; the product of bits yields the eigenvalue $\pm 1$.
  4. Estimate expectation over multiple shots.
- **Measurement of $\langle iHT\rangle_\tau$:**
  1. For $H = \sum_k h_k P_k$, decompose $iHT = \sum_k h_k (i P_k T)$.
  2. For each Pauli-string $P_k$, execute basis rotations and measurement as above, weighting contributions by $h_k$.

No ancilla qubits or controlled unitaries are ever required. The circuit depth is typically half that of controlled-evolution Hadamard-test methods, plus a negligible overhead for basis rotations [2507.22559].

## 4. Krylov Subspace Construction and Generalized Eigenproblem

KTR's algorithmic pipeline mirrors standard KQD with modifications for overlap measurement:
1. Choose $\ket{v_0}$ so that $T\ket{v_0} = c\ket{v_0}$ and with high overlap with low-energy eigenstates of $H$.
2. Select a time-grid $\{t_1, \ldots, t_m\}$, frequently uniform.
3. For each $(i, j)$,
   \[
   B_{ij} = c\, \bra{v(\frac{t_j-t_i}{2})} T \ket{v(\frac{t_j-t_i}{2})}, \quad
   A_{ij} = ic\,\bra{v(\frac{t_j-t_i}{2})} i H T \ket{v(\frac{t_j-t_i}{2})}.
   \]
4. Assemble $B$ (real-symmetric) and $A$ (imaginary-skew-symmetric), and solve $A\mathbf{x} = \lambda B\mathbf{x}$.
5. The smallest eigenvalues $\lambda$ approximate extremal eigenvalues of $H$.

Explicit orthonormalization—e.g., via a Lanczos-type recurrence—can be performed, but most implementations favor direct diagonalization of the $m \times m$ matrix pencil for efficiency. All matrix elements required are observable expectation values amenable to batching and post-processing [2507.22559].

## 5. Empirical Benchmarks and Spectral Estimation

Numerical validation is provided via MPS-based simulation on paradigmatic models:

- **Transverse-Field Ising Model (TFIM):** For $n=64$ qubits, with $H(\gamma) = -\sum X_i X_{i+1} - \gamma \sum Z_i$ and $T = (Y \otimes X)^{\otimes n/2}$. Using $m=128$ Krylov vectors and initial-state blockings $s=2,4$, the KTR protocol attains relative errors in the ground-state energy below $10^{-4}$ at small $\gamma$. Circuit depth is halved, and no ancillas are used.
- **$\mathbb{Z}_2$ Gauge-Higgs Model:** For $n=64$ qubits, with $H(\mu, g) = -\sum Z_{\ell-1} Z_\ell Z_{\ell+1} - \mu\sum X_v - g\sum X_\ell$, and $T = Y^{\otimes n}$. With $m=80$ Krylov vectors and initial blocking $s=2$, relative errors $\sim 10^{-3}$ in the gauge-sector ground energy are observed. Spectral estimates align with full-KQD and DMRG benchmarks, while circuit and measurement resource requirements are greatly reduced [2507.22559].

## 6. Protocol Constraints, Advantages, and Prospective Extensions

**Advantages:**
- Eliminates controlled unitaries and ancillas.
- Circuit depth is reduced by a factor of two due to midpoint time-shift; only single-qubit rotations are added.
- All observables are Pauli-strings, favorably mapping to NISQ hardware.
- Maintains robust convergence guarantees of Krylov subspace methods.

**Limitations:**
- Applicability requires existence of a unitary involution $T$ with $\{T, H\} = 0$ and a $T$-symmetric initial state; not all models (e.g., generic $k$-local Hamiltonians such as XYZ Heisenberg) admit such involutions.
- Performance remains sensitive to initial state and time-grid selection.
- Measurement cost scales as $\mathcal{O}(mL)$ if $H$ consists of $L$ Pauli terms; batching may ameliorate overhead in specific instances [2507.22559].

**Extensions:**
- Integration with advanced Krylov basis selection ("super-Krylov") can reduce the required subspace dimension $m$.
- Involutions beyond Pauli-string products can be constructed via binary-linear (XOR-SAT) analysis of the Hamiltonian terms.
- Possible generalization to antiunitary symmetries or alternative discrete symmetries (parity, charge conjugation).
- Overlap matrices may be further optimized using quadrature or derivative techniques, reducing measurement burden.

The KTR protocol, by leveraging algebraic symmetries to perform control-free Krylov diagonalization, provides one of the most near-term-compatible approaches for variational quantum spectral estimation [2507.22559].

Source: https://www.emergentmind.com/topics/krylov-time-reversal-ktr