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:2611.09229

Exploring Variational Regularization of Krylov Subspaces

Alexandre Perrin, J. Messud, Sébastien Burdin, Matthieu Saubanère

Published Nov 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Krylov subspace methods efficiently approximate extremal eigenstates and eigenvalues of many-body Hamiltonians, but non-orthogonal bases can suffer from ill-conditioning. This challenge is amplified in quantum computing, where direct state access and thus straightforward orthogonalization are unavailable. We investigate a variational Krylov-like framework that iteratively optimizes a parametrized sequence of states to mimic Lanczos-like couplings while penalizing linear dependencies. Analyzed against exact Krylov and Lanczos on a finite Anderson impurity model, ansatz expressivity strongly influences the performance: Hamiltonian-inspired ansätze preserve Krylov-like convergence while improving the conditioning, whereas shallow ansätze remain stable but miss low-energy directions.

DOI
10.48550/arxiv.2611.09229

Related papers

Orthogonal Quantum Krylov Diagonalisation

Hadi Rammal, Alexandre Perrin, Oumaya Ladhari +3 more

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.

quant-pharXiv:2607.09476•Jul 13, 2026•3 citations

Quantum ansätze for Green's functions of single-impurity Anderson models at half-filling

E. A. Coello Pérez, Dmytro Bykov, Markus Eisenbach +9 more

We introduce a set of quantum ansätze tailored for computing Green's functions of single-impurity models using the variational quantum eigensolver. These ansätze conserve particle number and spin, allowing for the efficient preparation of the impurity model's ground state and the Krylov bases required to express the Green's function as a continued fraction. Notably, the parameters preparing the particle and hole excitations used as initial Krylov vectors are fully determined by those optimized for the ground state, eliminating the need for secondary optimizations or alternative excitation preparation methods. We demonstrate the utility of these ansätze by computing Green's functions for single-impurity Anderson models with one bath site within a dynamical mean-field theory loop, where the impuritybath hybridization is updated self-consistently. The parameters defining the states in the Krylov bases are straightforwardly determined by orthonormality in the single-bath case, allowing for the direct computation of the relevant Hamiltonian matrix elements from these states. Future work will explore the robustness, scalability, and practical integration of these ansätze into hybrid quantum-classical simulations of strongly correlated materials.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 1, 2025•0 citations

Exact and Tunable Quantum Krylov Subspaces via Unitary Decomposition

Ayush Asthana

Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a timestep trade-off between dynamical accuracy and basis collapse and often producing ill-conditioned overlap matrices that stall convergence. Here we introduce Quantum Krylov using Unitary Decomposition (QKUD), a time-evolution-free construction that maps Hamiltonian powers to implementable unitaries via the Hermitian transform $\sin(εH)/ε$. QKUD reduces to the exact Hamiltonian-power Krylov recursion as $ε\rightarrow0$, while finite $ε$ provides a controllable deformation that tunes subspace geometry and improves conditioning. Across molecular active-space benchmarks and a frustrated 2D J1-J2 Heisenberg model, QKUD reproduces exact-Krylov convergence in well-conditioned regimes and systematically restores variational improvement when both exact Krylov and time-evolution Krylov stagnate. These results identify overlap conditioning, instead of time-evolution fidelity, is the key resource for robust quantum Krylov simulation and provide a resilient way forward for accurate quantum simulation of challenging quantum many-body problems.

quant-pharXiv:2512.11788•Dec 15, 2025•7 citations

Exact and efficient Lanczos method on a quantum computer

William Kirby, Mário Motta, Antonio Mezzacapo

We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space, which can be used as the basis for the Lanczos method to estimate extremal eigenvalues of Hamiltonians. While the classical Lanczos method has exponential cost in the system size to represent the Krylov states for quantum systems, our efficient quantum algorithm achieves this in polynomial time and memory. The construction presented is exact in the sense that the resulting Krylov space is identical to that of the Lanczos method, so the only approximation with respect to the exact method is due to finite sample noise. This is possible because, unlike previous quantum Krylov methods, our algorithm does not require simulating real or imaginary time evolution. We provide an explicit error bound for the resulting ground state energy estimate in the presence of noise. For our method to be successful efficiently, the only requirement on the input problem is that the overlap of the initial state with the true ground state must be Ω ( 1 / poly ( n ) ) for n qubits.

arXiv:2208.00567•Quantum•May 23, 2023•84 citations

Generative Krylov Subspace Representations for Scalable Quantum Eigensolvers

Changwon Lee, Daniel K. Park

Predicting ground state energies of quantum many-body systems is one of the central computational challenges in quantum chemistry, physics, and materials science. Krylov subspace methods, such as Krylov Quantum Diagonalization and Sample-based Krylov Quantum Diagonalization, are promising approaches for this task on near-term quantum computers. However, both require repeated quantum circuit executions for each Krylov subspace and for every new Hamiltonian, posing a major bottleneck under noisy hardware constraints. We introduce Generative Krylov Subspace Representations (GenKSR), a framework that learns a classical generative representation of the entire Krylov diagonalization process. To enable effective modeling of quantum systems, GenKSR leverages a conditional generative model framework. We investigate two representative backbone architectures, the standard Transformer and the Mamba state-space model. By learning the distribution of measurement outcomes conditioned on Hamiltonian parameters and evolution time, GenKSR generates Krylov subspace samples for unseen Hamiltonians and for larger subspace dimensions than those used in training. This enables full energy reconstruction purely from the classical model, without additional quantum experiments. We validate our approach through simulations of 15-qubit 1D and 16-qubit 2D Heisenberg models, as well as a hardware experiment on a 20-qubit XXZ chain executed on an IBM quantum processor. Our model successfully learns the distribution from experimental data and generates a high-fidelity representation of the quantum process. This representation enables classical reproduction of experimental outcomes, supports reliable energy estimates for unseen Hamiltonians, and significantly reduces the need for further quantum computation.

quant-pharXiv:2512.19420•Dec 23, 2025•1 citation

Post-Optimization Subspace Corrections to Quantum Ansätze

Prince Frederick Kwao, Bharath Sambasivam, Jason Saroni +3 more

Circuit depth and measurement count are the main limitations for chemical applications of the leading variational quantum algorithms on quantum computers. We show that both resource requirements can be reduced by augmenting adaptive variational quantum algorithms with post-optimization corrective techniques. We focus on two such techniques---Hamiltonian-moment Krylov subspace diagonalization and the identity-augmented quantum self-consistent equation of motion (q-sc-EOM)---applied to optimized ADAPT-VQE states without further ansatz growth or nonlinear optimization. Across molecular systems studied with up to 20 qubits, first-order Krylov correction reduces the optimized iterations (and the corresponding number of adaptive layers) needed to reach the $1.6~\mathrm{m}E_h$ threshold by up to approximately sixfold, with a general trend toward larger reductions at higher determinant Rényi entropy. We also find measurement-cost reductions of up to approximately fortyfold using a suitable resource-cost model. Identity-augmented q-sc-EOM improves molecular potential-energy curves obtained from truncated ADAPT-VQE ansätze with limited expressivity and recovers accuracy from states produced by sampled operator ranking without additional gradient-based operator selection, providing an advantage when small pool gradients make selection measurement intensive. Together, these post-optimization corrections offer routes to improve energy accuracy and reduce adaptive circuit growth in quantum algorithms as quantum hardware advances.

quant-pharXiv:2610.19109•Oct 15, 2026•0 citations
Krylov subspace methods efficiently approximate extremal eigenstates and eigenvalues of many-body Hamiltonians, but non-orthogonal bases can suffer from ill-conditioning. This challenge is amplified in quantum computing, where direct state access and thus straightforward orthogonalization are unavailable. We investigate a variational Krylov-like framework that iteratively optimizes a parametrized sequence of states to mimic Lanczos-like couplings while penalizing linear dependencies. Analyzed against exact Krylov and Lanczos on a finite Anderson impurity model, ansatz expressivity strongly influences the performance: Hamiltonian-inspired ansätze preserve Krylov-like convergence while improving the conditioning, whereas shallow ansätze remain stable but miss low-energy directions.
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 J1J_1J1​--J2J_2J2​ 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.
We introduce a set of quantum ansätze tailored for computing Green's functions of single-impurity models using the variational quantum eigensolver. These ansätze conserve particle number and spin, allowing for the efficient preparation of the impurity model's ground state and the Krylov bases required to express the Green's function as a continued fraction. Notably, the parameters preparing the particle and hole excitations used as initial Krylov vectors are fully determined by those optimized for the ground state, eliminating the need for secondary optimizations or alternative excitation preparation methods. We demonstrate the utility of these ansätze by computing Green's functions for single-impurity Anderson models with one bath site within a dynamical mean-field theory loop, where the impuritybath hybridization is updated self-consistently. The parameters defining the states in the Krylov bases are straightforwardly determined by orthonormality in the single-bath case, allowing for the direct computation of the relevant Hamiltonian matrix elements from these states. Future work will explore the robustness, scalability, and practical integration of these ansätze into hybrid quantum-classical simulations of strongly correlated materials.
Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a timestep trade-off between dynamical accuracy and basis collapse and often producing ill-conditioned overlap matrices that stall convergence. Here we introduce Quantum Krylov using Unitary Decomposition (QKUD), a time-evolution-free construction that maps Hamiltonian powers to implementable unitaries via the Hermitian transform sin⁡(εH)/ε\sin(εH)/εsin(εH)/ε. QKUD reduces to the exact Hamiltonian-power Krylov recursion as ε→0ε\rightarrow0ε→0, while finite εεε provides a controllable deformation that tunes subspace geometry and improves conditioning. Across molecular active-space benchmarks and a frustrated 2D J1-J2 Heisenberg model, QKUD reproduces exact-Krylov convergence in well-conditioned regimes and systematically restores variational improvement when both exact Krylov and time-evolution Krylov stagnate. These results identify overlap conditioning, instead of time-evolution fidelity, is the key resource for robust quantum Krylov simulation and provide a resilient way forward for accurate quantum simulation of challenging quantum many-body problems.
We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space, which can be used as the basis for the Lanczos method to estimate extremal eigenvalues of Hamiltonians. While the classical Lanczos method has exponential cost in the system size to represent the Krylov states for quantum systems, our efficient quantum algorithm achieves this in polynomial time and memory. The construction presented is exact in the sense that the resulting Krylov space is identical to that of the Lanczos method, so the only approximation with respect to the exact method is due to finite sample noise. This is possible because, unlike previous quantum Krylov methods, our algorithm does not require simulating real or imaginary time evolution. We provide an explicit error bound for the resulting ground state energy estimate in the presence of noise. For our method to be successful efficiently, the only requirement on the input problem is that the overlap of the initial state with the true ground state must be Ω ( 1 / poly ( n ) ) for n qubits.
Predicting ground state energies of quantum many-body systems is one of the central computational challenges in quantum chemistry, physics, and materials science. Krylov subspace methods, such as Krylov Quantum Diagonalization and Sample-based Krylov Quantum Diagonalization, are promising approaches for this task on near-term quantum computers. However, both require repeated quantum circuit executions for each Krylov subspace and for every new Hamiltonian, posing a major bottleneck under noisy hardware constraints. We introduce Generative Krylov Subspace Representations (GenKSR), a framework that learns a classical generative representation of the entire Krylov diagonalization process. To enable effective modeling of quantum systems, GenKSR leverages a conditional generative model framework. We investigate two representative backbone architectures, the standard Transformer and the Mamba state-space model. By learning the distribution of measurement outcomes conditioned on Hamiltonian parameters and evolution time, GenKSR generates Krylov subspace samples for unseen Hamiltonians and for larger subspace dimensions than those used in training. This enables full energy reconstruction purely from the classical model, without additional quantum experiments. We validate our approach through simulations of 15-qubit 1D and 16-qubit 2D Heisenberg models, as well as a hardware experiment on a 20-qubit XXZ chain executed on an IBM quantum processor. Our model successfully learns the distribution from experimental data and generates a high-fidelity representation of the quantum process. This representation enables classical reproduction of experimental outcomes, supports reliable energy estimates for unseen Hamiltonians, and significantly reduces the need for further quantum computation.
Circuit depth and measurement count are the main limitations for chemical applications of the leading variational quantum algorithms on quantum computers. We show that both resource requirements can be reduced by augmenting adaptive variational quantum algorithms with post-optimization corrective techniques. We focus on two such techniques---Hamiltonian-moment Krylov subspace diagonalization and the identity-augmented quantum self-consistent equation of motion (q-sc-EOM)---applied to optimized ADAPT-VQE states without further ansatz growth or nonlinear optimization. Across molecular systems studied with up to 20 qubits, first-order Krylov correction reduces the optimized iterations (and the corresponding number of adaptive layers) needed to reach the 1.6 mEh1.6~\mathrm{m}E_h1.6 mEh​ threshold by up to approximately sixfold, with a general trend toward larger reductions at higher determinant Rényi entropy. We also find measurement-cost reductions of up to approximately fortyfold using a suitable resource-cost model. Identity-augmented q-sc-EOM improves molecular potential-energy curves obtained from truncated ADAPT-VQE ansätze with limited expressivity and recovers accuracy from states produced by sampled operator ranking without additional gradient-based operator selection, providing an advantage when small pool gradients make selection measurement intensive. Together, these post-optimization corrections offer routes to improve energy accuracy and reduce adaptive circuit growth in quantum algorithms as quantum hardware advances.