12 papers · 1 filter
Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer
William Kirby, Bibek Pokharel, Javier Robledo Moreno +25
Demonstrating quantum advantage over classical algorithms for ground state energy problems is an outstanding open problem in quantum computation. We experimentally demonstrate that…
Polynomial-time exact diagonalization via sparse guided eigenwalks
Zachary E. Chin, Mario Motta, Javier Robledo Moreno +3
Computing quantum ground states is generically difficult, but additional structure can sometimes allow diagonalization to be recast as a more feasible problem. For example, when th…
Quantum Finite Temperature Lanczos Method
Gian Gentinetta, Friederike Metz, William Kirby +1
The computation of thermal properties of quantum many-body systems is a central challenge in our understanding of quantum mechanics. We introduce the Quantum Finite Temperature Lan…
Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization
Samuele Piccinelli, Alberto Baiardi, Stefano Barison +12
Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of…
Closed-loop calculations of electronic structure on a quantum processor and a classical supercomputer at full scale
Tomonori Shirakawa, Javier Robledo-Moreno, Toshinari Itoko +18
Quantum computers must operate in concert with classical computers to deliver on the promise of quantum advantage for practical problems. To achieve that, it is important to unders…
The quantum super-Krylov method
Adam Byrne, William Kirby, Kirk M. Soodhalter +1
The problem of estimating the ground-state energy of a quantum system is ubiquitous in chemistry and condensed matter physics. Krylov quantum diagonalization (KQD) has emerged as a…