11 papers
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…
Scaling Sample-Based Quantum Diagonalization on GPU-Accelerated Systems using OpenMP Offload
Robert Walkup, Juha Jäykkä, Igor Pasichnyk +14
Hybrid quantum-HPC algorithms advance research by delegating complex tasks to quantum processors and using HPC systems to orchestrate workflows and complementary computations. Samp…
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…