1.1k citations · 1.4k across the 20 of their papers we have counts for
6 papers · 1 filter
Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits
Katherine Van Kirk, Christian Kokail, Jonathan Kunjummen +7
Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algori…
Experimental Demonstration of Logical Magic State Distillation
Pedro Sales Rodriguez, John M. Robinson, Paul Niklas Jepsen +70
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error cor…
Quantum adiabatic optimization with Rydberg arrays: localization phenomena and encoding strategies
Lisa Bombieri, Zhongda Zeng, Roberto Tricarico +5
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However,…
Strategies for running the QAOA at hundreds of qubits
Brandon Augustino, Madelyn Cain, Edward Farhi +5
We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, followi…
Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
Hengyun Zhou, Chen Zhao, Madelyn Cain +7
Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurem…
Quantum quench dynamics as a shortcut to adiabaticity
Alexander Lukin, Benjamin F. Schiffer, Boris Braverman +9
The ability to efficiently prepare ground states of quantum Hamiltonians via adiabatic protocols is typically limited by the smallest energy gap encountered during the quantum evol…