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

Ground-state estimation of the Heisenberg model on frustrated lattices with Sample-based Krylov Quantum Diagonalization

Calvin Brooks, Henry Zou, Trevor David Rhone

quant-phSubmitted May 28, 2026• Announced May 29, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum spin simulations of frustrated lattices remain challenging for both classical and quantum algorithms, particularly in parameter regimes relevant to quantum spin liquid (QSL) phases. In this work, we apply Sample-based Krylov Quantum Diagonalization (SKQD) to estimate the ground state of the antiferromagnetic XXZ Heisenberg model on the $J_1$--$J_2$ square lattice, the Kagome lattice, and a 1D chain, studying system sizes from 12 to 72 spins. In our application of SKQD, we identify a ZZ deformation of $Δ=2$ as a sufficiently sparse Hamiltonian and introduce two modifications to the SKQD framework tailored to spin models: a canonical bitstring compression scheme that preserves the effectiveness of configuration recovery under spin-flip degeneracy, and the use of multiple Krylov subspaces to improve ground state coverage without any increase in quantum resources. For the 1D chain and Kagome lattice, SKQD achieves sub-percent ground-state energy errors at system sizes up to 24 spins, including a relative error of $0.002\%$ on the 12-site Kagome lattice, surpassing the best prior VQE result of $0.01\%$ on the same system while requiring no variational optimization. SKQD further extends to system sizes well beyond the reach of prior quantum algorithm studies, reaching 72 spins across all three geometries. Beyond 24 spins, accuracy degrades to relative errors of $19\%$--$36\%$ at 72 sites, but the gradual scaling of error with system size suggests these limits are set by available shot budgets and circuit depth rather than fundamental algorithmic constraints. Although classical tensor network methods remain state-of-the-art for these models, this work establishes a new benchmark for quantum simulation of the frustrated Heisenberg model and demonstrates SKQD as a scalable, hardware-compatible approach for studying strongly correlated spin systems.

Comments
15 pages (11 pages main text + 4 pages appendix), 11 figures, 1 table

Related papers

Evaluating Sample-Based Krylov Quantum Diagonalization for Heisenberg Models with Applications to Materials Science

Roman Firt, Neel Misciasci, Jonathan E. Mueller +4 more

We evaluate the Sample-based Krylov Quantum Diagonalization (SKQD) algorithm on one- and two-dimensional Heisenberg models, including strongly correlated regimes in which the ground state is dense. Using problem-informed initial states and magnetization-sector sweeps, SKQD accurately reproduces ground-state energies and field-dependent magnetization across a range of anisotropies. Benchmarks against DMRG and exact diagonalization show consistent qualitative agreement, with accuracy improving systematically in more anisotropic regimes. We further demonstrate SKQD on quantum hardware by implementing 18- and 30-qubit Heisenberg chains, obtaining magnetization curves that match theoretical expectations. Simulations on small 2D square-lattice systems further demonstrate that the method applies effectively beyond 1D geometries.

quant-pharXiv:2512.17141•Entropy•Dec 22, 2025•1 citation

Near-Term Quantum Spin Simulation of the Spin-$\frac{1}{2}$ Square $J_{1}-J_{2}$ Heisenberg Model

Dylan Sheils, Trevor David Rhone

Simulating complex spin systems, known for high frustration and entanglement, presents significant challenges due to their intricate energy landscapes. This study focuses on the $J_{1}-J_{2}$ Heisenberg model, renowned for its rich phase behavior on the square lattice, to investigate strongly correlated spin systems. We conducted the first experimental quantum computing study of this model using the 127-qubit IBM Rensselear Eagle processor and the Variational Quantum Eigensolver (VQE) algorithm. By employing classical warm-starting ($+40\%$ ground state energy approximation) and a newly developed ansatz ($+9.31\%$ improvement compared to prior best), we improved ground state approximation accuracy on the 16-site variant, achieving usable results with approximately $10^{3}$ iterations, significantly fewer than the $10^{4}-10^{5}$ steps proposed by previous theoretical studies. We utilized existing error mitigation strategies and introduced a novel Classically-Reinforced VQE error mitigation scheme, achieving $93\%$ ground state accuracy, compared to $83.7\%$ with the Quantum Moments algorithm and $60\%$ with standard error mitigation. These strategies reduced the average error of observable prediction from $\approx 20\%$ to $5\%$, enhancing phase prediction from qualitative to quantitative alignment. Additionally, we explored an experimental implementation of the Quantum Lanczos (QLanczos) algorithm using Variational-Fast Forwarding (VFF) on a 4-qubit site, achieving $\approx 97\%$ ground state approximation. Theoretical simulations indicated that Krylov-based methods outperform VQE, with the Lanczos basis converging faster than the real-time basis. Our study demonstrates that near-term quantum devices can predict phase-relevant observables for the $J_1-J_2$ Heisenberg model, transitioning focus from theoretical to experimental, and suggesting general improvements to VQE-based methods.

arXiv:2406.18474•Jun 26, 2024•1 citation

Ground state energy of a two-dimensional pure Z2 lattice gauge theory via sample-based Krylov quantum diagonalization

Lento Nagano, Y. Iiyama, Tomoya Hayata +6 more

We study the application of sample-based Krylov quantum diagonalization (SKQD) to a two-dimensional pure $\mathbb{Z}_2$ lattice gauge theory. SKQD samples configurations from states obtained via time-evolution quantum circuits, projects the Hamiltonian into the subspace spanned by the sampled configurations, and solves an eigenvalue problem to estimate the ground-state energy. We consider a model defined on a triangular lattice, which allows for an efficient construction of time-evolution circuits on the IBM Quantum Heron processor. We also propose a configuration recovery method based on Gauss's law and a conditional restricted Boltzmann machine (CRBM), to mitigate the effects of noise. We simulate a lattice of 108 links using the superconducting quantum processor $\texttt{ibm}\_\texttt{kawasaki}$, which allows us to obtain the ground-state energy within a few percent of tensor network results. We also compare configuration recovery with and without the CRBM, and observe that the CRBM improves the accuracy at each iteration.

International Symposium on Lattice Field Theory (LATTICE)•Jul 5, 2026•0 citations

Simulating the Antiferromagnetic Heisenberg Model on a Spin-Frustrated Kagome Lattice with the Contextual Subspace Variational Quantum Eigensolver

Tim Weaving, Alexis Ralli, Vinul Wimalaweera +2 more

In this work we investigate the ground state properties of a candidate quantum spin liquid using a superconducting Noisy Intermediate-Scale Quantum (NISQ) device. Specifically, we study the antiferromagnetic Heisenberg model on a Kagome lattice, a geometrically frustrated structure that gives rise to a highly degenerate energy spectrum. To successfully simulate this system, we employ a qubit reduction strategy leveraging the Contextual Subspace methodology, significantly reducing the problem size prior to execution on the quantum device. We improve the quality of these subspaces by using the wavefunctions obtained from low bond dimension Density Matrix Renormalization Group (DMRG) calculations to bias the subspace stabilizers through a symplectic approximate symmetry generator extraction algorithm. Reducing the Hamiltonian size allows us to implement tiled circuit ensembles and deploy the Variational Quantum Eigensolver (VQE) to estimate the ground state energy. We adopt a hybrid quantum error mitigation strategy combining Readout Error Mitigation (REM), Symmetry Verification (SV) and Zero Noise Extrapolation (ZNE). This approach yields high-accuracy energy estimates, achieving error rates on the order of 0.01% and thus demonstrating the potential of near-term quantum devices for probing frustrated quantum materials.

arXiv:2506.12391•Jun 14, 2025•0 citations

Sample-Based Krylov Quantum Diagonalization for the Schwinger Model on Trapped-Ion and Superconducting Quantum Processors

Emil Otis Rosanowski, Eisinger, Jurek, Lena Funcke +2 more

We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories, using the Schwinger model with a $θ$-term as a benchmark. SKQD approximates the ground state of a Hamiltonian, employing a hybrid quantum-classical approach: (i) constructing a Krylov space from bitstrings sampled from time-evolved quantum states, and (ii) classically diagonalizing the Hamiltonian within this subspace. We study the dependence of the ground-state energy and particle number on the value of the $θ$-term, accurately capturing the model's phase structure. The algorithm is implemented on trapped-ion and superconducting quantum processors, demonstrating consistent performance across platforms. 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:2510.26951•Oct 30, 2025•0 citations

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Aaron Szasz, Ed Younis, Wibe Albert de Jong

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

arXiv:2401.03015•Quantum•Apr 9, 2025•2 citations
Quantum spin simulations of frustrated lattices remain challenging for both classical and quantum algorithms, particularly in parameter regimes relevant to quantum spin liquid (QSL) phases. In this work, we apply Sample-based Krylov Quantum Diagonalization (SKQD) to estimate the ground state of the antiferromagnetic XXZ Heisenberg model on the J1J_1J1​--J2J_2J2​ square lattice, the Kagome lattice, and a 1D chain, studying system sizes from 12 to 72 spins. In our application of SKQD, we identify a ZZ deformation of Δ=2Δ=2Δ=2 as a sufficiently sparse Hamiltonian and introduce two modifications to the SKQD framework tailored to spin models: a canonical bitstring compression scheme that preserves the effectiveness of configuration recovery under spin-flip degeneracy, and the use of multiple Krylov subspaces to improve ground state coverage without any increase in quantum resources. For the 1D chain and Kagome lattice, SKQD achieves sub-percent ground-state energy errors at system sizes up to 24 spins, including a relative error of 0.002%0.002\%0.002% on the 12-site Kagome lattice, surpassing the best prior VQE result of 0.01%0.01\%0.01% on the same system while requiring no variational optimization. SKQD further extends to system sizes well beyond the reach of prior quantum algorithm studies, reaching 72 spins across all three geometries. Beyond 24 spins, accuracy degrades to relative errors of 19%19\%19%--36%36\%36% at 72 sites, but the gradual scaling of error with system size suggests these limits are set by available shot budgets and circuit depth rather than fundamental algorithmic constraints. Although classical tensor network methods remain state-of-the-art for these models, this work establishes a new benchmark for quantum simulation of the frustrated Heisenberg model and demonstrates SKQD as a scalable, hardware-compatible approach for studying strongly correlated spin systems.
We evaluate the Sample-based Krylov Quantum Diagonalization (SKQD) algorithm on one- and two-dimensional Heisenberg models, including strongly correlated regimes in which the ground state is dense. Using problem-informed initial states and magnetization-sector sweeps, SKQD accurately reproduces ground-state energies and field-dependent magnetization across a range of anisotropies. Benchmarks against DMRG and exact diagonalization show consistent qualitative agreement, with accuracy improving systematically in more anisotropic regimes. We further demonstrate SKQD on quantum hardware by implementing 18- and 30-qubit Heisenberg chains, obtaining magnetization curves that match theoretical expectations. Simulations on small 2D square-lattice systems further demonstrate that the method applies effectively beyond 1D geometries.
Near-Term Quantum Spin Simulation of the Spin-12\frac{1}{2}21​ Square J1−J2J_{1}-J_{2}J1​−J2​ Heisenberg Model
Simulating complex spin systems, known for high frustration and entanglement, presents significant challenges due to their intricate energy landscapes. This study focuses on the J1−J2J_{1}-J_{2}J1​−J2​ Heisenberg model, renowned for its rich phase behavior on the square lattice, to investigate strongly correlated spin systems. We conducted the first experimental quantum computing study of this model using the 127-qubit IBM Rensselear Eagle processor and the Variational Quantum Eigensolver (VQE) algorithm. By employing classical warm-starting (+40%+40\%+40% ground state energy approximation) and a newly developed ansatz (+9.31%+9.31\%+9.31% improvement compared to prior best), we improved ground state approximation accuracy on the 16-site variant, achieving usable results with approximately 10310^{3}103 iterations, significantly fewer than the 104−10510^{4}-10^{5}104−105 steps proposed by previous theoretical studies. We utilized existing error mitigation strategies and introduced a novel Classically-Reinforced VQE error mitigation scheme, achieving 93%93\%93% ground state accuracy, compared to 83.7%83.7\%83.7% with the Quantum Moments algorithm and 60%60\%60% with standard error mitigation. These strategies reduced the average error of observable prediction from ≈20%\approx 20\%≈20% to 5%5\%5%, enhancing phase prediction from qualitative to quantitative alignment. Additionally, we explored an experimental implementation of the Quantum Lanczos (QLanczos) algorithm using Variational-Fast Forwarding (VFF) on a 4-qubit site, achieving ≈97%\approx 97\%≈97% ground state approximation. Theoretical simulations indicated that Krylov-based methods outperform VQE, with the Lanczos basis converging faster than the real-time basis. Our study demonstrates that near-term quantum devices can predict phase-relevant observables for the J1−J2J_1-J_2J1​−J2​ Heisenberg model, transitioning focus from theoretical to experimental, and suggesting general improvements to VQE-based methods.
We study the application of sample-based Krylov quantum diagonalization (SKQD) to a two-dimensional pure Z2\mathbb{Z}_2Z2​ lattice gauge theory. SKQD samples configurations from states obtained via time-evolution quantum circuits, projects the Hamiltonian into the subspace spanned by the sampled configurations, and solves an eigenvalue problem to estimate the ground-state energy. We consider a model defined on a triangular lattice, which allows for an efficient construction of time-evolution circuits on the IBM Quantum Heron processor. We also propose a configuration recovery method based on Gauss's law and a conditional restricted Boltzmann machine (CRBM), to mitigate the effects of noise. We simulate a lattice of 108 links using the superconducting quantum processor ibm_kawasaki\texttt{ibm}\_\texttt{kawasaki}ibm_kawasaki, which allows us to obtain the ground-state energy within a few percent of tensor network results. We also compare configuration recovery with and without the CRBM, and observe that the CRBM improves the accuracy at each iteration.
In this work we investigate the ground state properties of a candidate quantum spin liquid using a superconducting Noisy Intermediate-Scale Quantum (NISQ) device. Specifically, we study the antiferromagnetic Heisenberg model on a Kagome lattice, a geometrically frustrated structure that gives rise to a highly degenerate energy spectrum. To successfully simulate this system, we employ a qubit reduction strategy leveraging the Contextual Subspace methodology, significantly reducing the problem size prior to execution on the quantum device. We improve the quality of these subspaces by using the wavefunctions obtained from low bond dimension Density Matrix Renormalization Group (DMRG) calculations to bias the subspace stabilizers through a symplectic approximate symmetry generator extraction algorithm. Reducing the Hamiltonian size allows us to implement tiled circuit ensembles and deploy the Variational Quantum Eigensolver (VQE) to estimate the ground state energy. We adopt a hybrid quantum error mitigation strategy combining Readout Error Mitigation (REM), Symmetry Verification (SV) and Zero Noise Extrapolation (ZNE). This approach yields high-accuracy energy estimates, achieving error rates on the order of 0.01% and thus demonstrating the potential of near-term quantum devices for probing frustrated quantum materials.
We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories, using the Schwinger model with a θθθ-term as a benchmark. SKQD approximates the ground state of a Hamiltonian, employing a hybrid quantum-classical approach: (i) constructing a Krylov space from bitstrings sampled from time-evolved quantum states, and (ii) classically diagonalizing the Hamiltonian within this subspace. We study the dependence of the ground-state energy and particle number on the value of the θθθ-term, accurately capturing the model's phase structure. The algorithm is implemented on trapped-ion and superconducting quantum processors, demonstrating consistent performance across platforms. 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.
Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.