Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.20998 · npj Quantum Information

Mirror subspace diagonalization: A quantum Krylov algorithm with near-optimal sampling cost

Shota Kanasugi, Yuya O. Nakagawa, Norifumi Matsumoto, Yuichiro Hidaka, Kazunori Maruyama, Hirotaka Oshima

quant-phSubmitted Nov 26, 2025• Announced Nov 27, 2025• 0 citations• Revised Mar 30, 2026 (v2)
v1 · Nov 26, 2025v2 · Mar 30, 2026v3 · Oct 14, 2026
arXivHTMLPDF

Abstract

Quantum Krylov algorithms have emerged as a promising approach for ground-state energy estimation in the near-term quantum computing era. A major challenge, however, lies in their inherently substantial sampling cost, primarily due to the individual measurement of each term in the Hamiltonian. While various techniques have been proposed to mitigate this issue, the sampling overhead remains a significant bottleneck, especially for practical large-scale electronic structure problems. In this work, we introduce an alternative method, dubbed mirror subspace diagonalization (MSD), which approaches the theoretical lower bound of the sampling cost for quantum Krylov algorithms. MSD leverages a finite-difference formula to express the Hamiltonian operator as a linear combination of time-evolution unitaries with symmetrically shifted timesteps, enabling efficient estimation of the Hamiltonian matrix within the Krylov subspace. In this scheme, the finite difference and statistical errors are simultaneously minimized by optimizing the timestep parameter and shifting the energy spectrum. Consequently, MSD attains the lower bound of the sampling cost of the quantum Krylov algorithms up to a logarithmic factor. Furthermore, we employ classical post-processing to infer Hamiltonian moments, which are used to mitigate the ground state energy error based on the Lanczos scheme. Through theoretical analysis of the sampling cost, we demonstrate that MSD is particularly effective when the spectral norm of the Hamiltonian is significantly smaller than its 1-norm. Such a situation arises, for example, in high-accuracy simulations of molecules using large basis sets that incorporate strong electronic correlations. Numerical results for various molecular models reveal that MSD can achieve sampling cost reductions ranging from approximately 10 to 10,000 times compared to the conventional quantum Krylov algorithm.

DOI
10.1038/s41534-026-01384-y
Comments
28 pages, 13 figures

Related papers

Measurement-efficient quantum Krylov subspace diagonalisation

Zongkang Zhang, Anbang Wang, Xiaosi Xu +1 more

The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are prone to errors due to inevitable statistical fluctuations in quantum measurements. To address this problem, we develop a general theoretical framework to analyse the statistical error and measurement cost. Based on the framework, we propose a quantum algorithm to construct the Hamiltonian-power Krylov subspace that can minimise the measurement cost. In our algorithm, the product of power and Gaussian functions of the Hamiltonian is expressed as an integral of the real-time evolution, such that it can be evaluated on a quantum computer. We compare our algorithm with other established quantum Krylov subspace algorithms in solving two prominent examples. To achieve an error comparable to that of the classical Lanczos algorithm at the same subspace dimension, our algorithm typically requires orders of magnitude fewer measurements than others. Such an improvement can be attributed to the reduced cost of composing projectors onto the ground state. These results show that our algorithm is exceptionally robust to statistical fluctuations and promising for practical applications.

arXiv:2301.13353•Quantum•Aug 13, 2024•15 citations

Real-Time Krylov Theory for Quantum Computing Algorithms

Yizhi Shen, Katherine Klymko, James Sud +3 more

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

arXiv:2208.01063•Quantum•Jul 25, 2023•33 citations

Sampling Error Analysis in Quantum Krylov Subspace Diagonalization

Gwonhak Lee, Dongkeun Lee, Joonsuk Huh

Quantum Krylov subspace diagonalization (QKSD) is an emerging method used in place of quantum phase estimation in the early fault-tolerant era, where limited quantum circuit depth is available. In contrast to the classical Krylov subspace diagonalization (KSD) or the Lanczos method, QKSD exploits the quantum computer to efficiently estimate the eigenvalues of large-size Hamiltonians through a faster Krylov projection. However, unlike classical KSD, which is solely concerned with machine precision, QKSD is inherently accompanied by errors originating from a finite number of samples. Moreover, due to difficulty establishing an artificial orthogonal basis, ill-conditioning problems are often encountered, rendering the solution vulnerable to noise. In this work, we present a nonasymptotic theoretical framework to assess the relationship between sampling noise and its effects on eigenvalues. We also propose an optimal solution to cope with large condition numbers by eliminating the ill-conditioned bases. Numerical simulations of the one-dimensional Hubbard model demonstrate that the error bound of finite samplings accurately predicts the experimental errors in well-conditioned regions.

arXiv:2307.16279•Quantum•Sep 19, 2024•15 citations

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Nicholas H. Stair, Cristian L. Cortes, Robert M. Parrish +2 more

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}^{\ensuremath{-}i\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}\ensuremath{\tau}}$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than $1 \mathrm{kcal} {\mathrm{mol}}^{\ensuremath{-}1}$ with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

arXiv:2211.08274•Physical Review A•Mar 15, 2023•15 citations

Sample-Based Quantum Linear Solver and Bounds on Krylov-State Sampling

Byeongyong Park, Keunhong Jeong, Doyeol Ahn

To solve linear systems $Ax=b$, we propose a sample-based quantum linear solver combining quantum Krylov-state sampling with classical variational diagonalization. Rather than simulating the cost Hamiltonian $H_b(A)=A^\dagger(I-|b\rangle\langle b|)A$, we measure quantum Krylov states $e^{-iAT}|b\rangle$ generated by the original Hermitian operator $A$ in the computational basis. We then classically diagonalize the projected cost Hamiltonian to reconstruct an approximate solution. Using a representation of $A^{-1}|b\rangle$ as a linear combination of quantum Krylov states, we derive lower bounds on computational-basis sampling probabilities from solution amplitudes. We establish support-discovery guarantees for finite nonnegative-time grid sampling and signed-time sampling, which permits both positive and negative evolution times. The former bounds the maximum evolution time, whereas the latter improves ideal shot complexity at the cost of occasional long evolutions. For a condition-number bound $κ$ on $A$, a lower bound $β_L$ on the solution probability weight of each of $L$ target basis states, and failure probability $δ$, signed-time sampling achieves $O(κ^2β_L^{-1}\log(L/δ))$ shots, matching a worst-case lower bound up to constants within an evolution-only observation model in a specified parameter regime. Finally, we analyze the effects of finite-length qDRIFT compilation and circuit reuse on sampling and derive an infidelity bound for the reconstructed solution.

quant-pharXiv:2610.23138•Oct 19, 2026•0 citations

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Cristian L. Cortes, Stephen K. Gray

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\ensuremath{\langle}{\ensuremath{\phi}}_{i}|{e}^{\ensuremath{-}i\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}\ensuremath{\tau}}|{\ensuremath{\phi}}_{j}\ensuremath{\rangle}$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, 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 propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

arXiv:2109.06868•Physical Review A•Feb 14, 2022•109 citations
Quantum Krylov algorithms have emerged as a promising approach for ground-state energy estimation in the near-term quantum computing era. A major challenge, however, lies in their inherently substantial sampling cost, primarily due to the individual measurement of each term in the Hamiltonian. While various techniques have been proposed to mitigate this issue, the sampling overhead remains a significant bottleneck, especially for practical large-scale electronic structure problems. In this work, we introduce an alternative method, dubbed mirror subspace diagonalization (MSD), which approaches the theoretical lower bound of the sampling cost for quantum Krylov algorithms. MSD leverages a finite-difference formula to express the Hamiltonian operator as a linear combination of time-evolution unitaries with symmetrically shifted timesteps, enabling efficient estimation of the Hamiltonian matrix within the Krylov subspace. In this scheme, the finite difference and statistical errors are simultaneously minimized by optimizing the timestep parameter and shifting the energy spectrum. Consequently, MSD attains the lower bound of the sampling cost of the quantum Krylov algorithms up to a logarithmic factor. Furthermore, we employ classical post-processing to infer Hamiltonian moments, which are used to mitigate the ground state energy error based on the Lanczos scheme. Through theoretical analysis of the sampling cost, we demonstrate that MSD is particularly effective when the spectral norm of the Hamiltonian is significantly smaller than its 1-norm. Such a situation arises, for example, in high-accuracy simulations of molecules using large basis sets that incorporate strong electronic correlations. Numerical results for various molecular models reveal that MSD can achieve sampling cost reductions ranging from approximately 10 to 10,000 times compared to the conventional quantum Krylov algorithm.
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are prone to errors due to inevitable statistical fluctuations in quantum measurements. To address this problem, we develop a general theoretical framework to analyse the statistical error and measurement cost. Based on the framework, we propose a quantum algorithm to construct the Hamiltonian-power Krylov subspace that can minimise the measurement cost. In our algorithm, the product of power and Gaussian functions of the Hamiltonian is expressed as an integral of the real-time evolution, such that it can be evaluated on a quantum computer. We compare our algorithm with other established quantum Krylov subspace algorithms in solving two prominent examples. To achieve an error comparable to that of the classical Lanczos algorithm at the same subspace dimension, our algorithm typically requires orders of magnitude fewer measurements than others. Such an improvement can be attributed to the reduced cost of composing projectors onto the ground state. These results show that our algorithm is exceptionally robust to statistical fluctuations and promising for practical applications.
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
Quantum Krylov subspace diagonalization (QKSD) is an emerging method used in place of quantum phase estimation in the early fault-tolerant era, where limited quantum circuit depth is available. In contrast to the classical Krylov subspace diagonalization (KSD) or the Lanczos method, QKSD exploits the quantum computer to efficiently estimate the eigenvalues of large-size Hamiltonians through a faster Krylov projection. However, unlike classical KSD, which is solely concerned with machine precision, QKSD is inherently accompanied by errors originating from a finite number of samples. Moreover, due to difficulty establishing an artificial orthogonal basis, ill-conditioning problems are often encountered, rendering the solution vulnerable to noise. In this work, we present a nonasymptotic theoretical framework to assess the relationship between sampling noise and its effects on eigenvalues. We also propose an optimal solution to cope with large condition numbers by eliminating the ill-conditioned bases. Numerical simulations of the one-dimensional Hubbard model demonstrate that the error bound of finite samplings accurately predicts the experimental errors in well-conditioned regions.
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}^{\ensuremath{-}i\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}\ensuremath{\tau}}$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than $1 \mathrm{kcal} {\mathrm{mol}}^{\ensuremath{-}1}$ with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.
To solve linear systems Ax=bAx=bAx=b, we propose a sample-based quantum linear solver combining quantum Krylov-state sampling with classical variational diagonalization. Rather than simulating the cost Hamiltonian Hb(A)=A†(I−∣b⟩⟨b∣)AH_b(A)=A^\dagger(I-|b\rangle\langle b|)AHb​(A)=A†(I−∣b⟩⟨b∣)A, we measure quantum Krylov states e−iAT∣b⟩e^{-iAT}|b\ranglee−iAT∣b⟩ generated by the original Hermitian operator AAA in the computational basis. We then classically diagonalize the projected cost Hamiltonian to reconstruct an approximate solution. Using a representation of A−1∣b⟩A^{-1}|b\rangleA−1∣b⟩ as a linear combination of quantum Krylov states, we derive lower bounds on computational-basis sampling probabilities from solution amplitudes. We establish support-discovery guarantees for finite nonnegative-time grid sampling and signed-time sampling, which permits both positive and negative evolution times. The former bounds the maximum evolution time, whereas the latter improves ideal shot complexity at the cost of occasional long evolutions. For a condition-number bound κκκ on AAA, a lower bound βLβ_LβL​ on the solution probability weight of each of LLL target basis states, and failure probability δδδ, signed-time sampling achieves O(κ2βL−1log⁡(L/δ))O(κ^2β_L^{-1}\log(L/δ))O(κ2βL−1​log(L/δ)) shots, matching a worst-case lower bound up to constants within an evolution-only observation model in a specified parameter regime. Finally, we analyze the effects of finite-length qDRIFT compilation and circuit reuse on sampling and derive an infidelity bound for the reconstructed solution.
Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\ensuremath{\langle}{\ensuremath{\phi}}_{i}|{e}^{\ensuremath{-}i\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}\ensuremath{\tau}}|{\ensuremath{\phi}}_{j}\ensuremath{\rangle}$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, 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 propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.