Orthogonal Quantum Krylov Diagonalisation

• URL: http://arxiv.org/abs/2607.09476v2
• Date: Fri, 17 Jul 2026 13:01:50 GMT
• Title: Orthogonal Quantum Krylov Diagonalisation
• Abstract summary: Existing quantum Krylov approaches rely on non-orthogonal Krylov bases, requiring overlap-matrix regularization.<n>We introduce an Orthogonal Quantum Krylov Diagonalization (OQKD) framework that reformulates the classical Lanczos at the operator level.
• Score: 35.18016233072556
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum subspace-diagonalization methods, particularly Quantum Krylov Diagonalization (QKD), provide a promising route for computing low-energy spectra of quantum many-body Hamiltonians. However, existing quantum Krylov approaches rely on non-orthogonal Krylov bases, requiring overlap-matrix regularization that limits numerical stability and accuracy. In this work, we introduce an Orthogonal Quantum Krylov Diagonalization (OQKD) framework that reformulates the classical Lanczos recursion at the operator level, enabling an orthogonal quantum implementation of Krylov-subspace diagonalization. By expressing Lanczos vectors as polynomial transformations of the Hamiltonian, OQKD reproduces the orthogonality, tridiagonal structure, and convergence behavior of the classical Lanczos algorithm thus eliminating the need for overlap-matrix regularization. We further show that the required Lanczos polynomials can be implemented using block encoding and Generalized Quantum Signal Processing with the same asymptotic query complexity as Chebyshev-based QKD methods. Numerical simulations of the $J_1$--$J_2$ Heisenberg model confirm the classical Lanczos convergence and numerical stability of the proposed method, while the measurement-complexity scaling is established analytically. Building upon the OQKD framework, we then introduce a restarted state-preparation protocol that replaces a single high-degree polynomial transformation with a sequence of fixed low-degree transformations, maintaining an affordable block encoding success probability while retaining comparable convergence. These results establish OQKD as an orthogonal quantum analog of the classical Lanczos algorithm and identify the restarted protocol as a promising state-preparation strategy for Quantum Phase Estimation.

Related papers

• Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
  This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
  arXiv  Detail & Related papers  (2026-03-12T14:47:16Z)
• Sample-Based Krylov Quantum Diagonalization for the Schwinger Model on Trapped-Ion and Superconducting Quantum Processors [26.315169722500556]
  We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories.<n>We study the dependence of the ground-state energy and particle number on the value of the $theta$-term, accurately capturing the model's phase structure.<n>We show that SKQD substantially reduces the effective Hilbert space, and although the Krylov space dimension still scales exponentially, the slower growth underscores its promise for simulating lattice gauge theories in larger volumes.
  arXiv  Detail & Related papers  (2025-10-30T19:21:06Z)
• When Less is More: Approximating the Quantum Geometric Tensor with Block Structures [43.39839287869652]
  We introduce a block-diagonal quantum geometric tensor that partitions the metric by network layers, analogous to block-structured Fisher methods such as K-FAC.<n> Experiments on Heisenberg and frustrated $J_1$-$J$ models show faster convergence, lower energy, and improved stability.
  arXiv  Detail & Related papers  (2025-10-09T16:44:30Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Partitioned Quantum Subspace Expansion [0.0]
  We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis.<n>By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware.
  arXiv  Detail & Related papers  (2024-03-13T18:00:04Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm [0.0]
  In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems. We demonstrate that by employing Fock-space variants of the SW transformation one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.
  arXiv  Detail & Related papers  (2022-11-18T23:06:57Z)
• A stochastic quantum Krylov protocol with double factorized Hamiltonians [0.0]
  We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e-ihatH tau$, as a linear combination of unitaries and subsequently uses a sampling procedure to reduce circuit depth requirements.
  arXiv  Detail & Related papers  (2022-11-15T16:27:41Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Quantum Krylov subspace algorithms for ground and excited state energy estimation [0.0]
  Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm. We show that a wide class of Hamiltonians relevant to condensed matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We develop a unified theory of quantum Krylov subspace algorithms and present three new quantum-classical algorithms for the ground and excited-state energy estimation problems.
  arXiv  Detail & Related papers  (2021-09-14T17:56:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.