Papers › Multi-reference Quantum Davidson Algorithm for Quantum Dynamics
Multi-reference Quantum Davidson Algorithm for Quantum Dynamics
Noah Berthusen, Faisal Alam, Yu Zhang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of existing quantum devices. To address this, Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers. In this study, we introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems. Unlike other QKS methods that pre-generate the Krylov subspace through real- or imaginary-time evolution, QDavidson iteratively adds basis vectors into the Krylov subspace. This iterative process enables faster convergence with fewer iterations and necessitates shallower circuit depths, marking a significant advancement in the field of quantum simulation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections