6 citations · 10 across the 4 of their papers we have counts for
12 papers · 1 filter
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…
ffsim: Faster simulation of fermionic quantum circuits
Kevin J. Sung, Inho Choi, Mirko Amico +14
We present ffsim, an open-source software library for fast simulation of fermionic quantum circuits. ffsim exploits conservation of particle number and the z component of spin, sym…
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…
Quantum-centric simulation of hydrogen abstraction by sample-based quantum diagonalization and entanglement forging
Tyler Smith, Tanvi P. Gujarati, Mario Motta +11
The simulation of electronic systems is an anticipated application for quantum-centric computers, i.e. heterogeneous architectures where classical and quantum processing units oper…
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…
Symmetry-guided quantum state preparation: Branched-Subspaces Adiabatic Preparation (B-SAP)
Davide Cugini, Giacomo Guarnieri, Mario Motta +1
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and da…