7.2k citations · 17.6k across the 84 of their papers we have counts for
10 papers · 1 filter
Quantum block lookahead adders and the wait for magic states
Craig Gidney
We improve the Toffoli count of low depth quantum adders, and analyze how their spacetime cost reacts to having a limited number of magic state factories. We present a block lookah…
Accurately computing electronic properties of a quantum ring
C. Neill, T. McCourt, X. Mi +89
A promising approach to study condensed-matter systems is to simulate them on an engineered quantum platform. However, achieving the accuracy needed to outperform classical methods…
Focus beyond quadratic speedups for error-corrected quantum advantage
Ryan Babbush, Jarrod McClean, Michael Newman +3
In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algor…
Even more efficient quantum computations of chemistry through tensor hypercontraction
Joonho Lee, Dominic W. Berry, Craig Gidney +4
We describe quantum circuits with only Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of arbitrary (e.g.,…
Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
Frank Arute, Kunal Arya, Ryan Babbush +96
Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avo…
Offloading Quantum Computation by Superposition Masking
Samuel Jaques, Craig Gidney
Error correction will add so much overhead to large quantum computations that we suspect the most efficient algorithms will use a classical co-processor to do as much work as possi…