papers

Publications (18)

quant-ph2019

Supplementary information for "Quantum supremacy using a programmable superconducting processor"

Frank Arute, Kunal Arya, Ryan Babbush +74

This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 201…

quant-ph2026

Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams

Laura S. Herzog, Gilad Kishony, Robert Wille +1

Pipe diagrams have emerged as a powerful framework for flexible lattice surgery compilation and spacetime optimization for the surface code. In contrast, analogous compilation tech…

quant-ph2024

Dynamics of magnetization at infinite temperature in a Heisenberg spin chain

Eliott Rosenberg, Trond Andersen, Rhine Samajdar +178

Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the 1D Heisenberg model were conjectured…

quant-ph2018

Faster manipulation of large quantum circuits using wire label reference diagrams

Alexandru Paler, Austin Fowler, Robert Wille

Large scale quantum computing is highly anticipated, and quantum circuit design automation needs to keep up with the transition from small scale to large scale problems. Methods to…

quant-ph2020

Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization

Ian D. Kivlichan, Craig Gidney, Dominic W. Berry +9

Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one…

quant-ph2026

Surface code off-the-hook: diagonal syndrome-extraction scheduling

Gilad Kishony, Austin Fowler

In the rotated surface code, hook errors (errors on auxiliary qubits midway through syndrome extraction that propagate to correlated two-qubit data errors) can reduce the circuit-l…

quant-ph2021

Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83

We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…

quant-ph2021

Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits

Matt McEwen, Lara Faoro, Kunal Arya +50

Scalable quantum computing can become a reality with error correction, provided coherent qubits can be constructed in large arrays. The key premise is that physical errors can rema…

quant-ph2019

A 28nm Bulk-CMOS 4-to-8GHz <2mW Cryogenic Pulse Modulator for Scalable Quantum Computing

Joseph C Bardin, Evan Jeffrey, Erik Lucero +28

Future quantum computing systems will require cryogenic integrated circuits to control and measure millions of qubits. In this paper, we report the design and characterization of a…

quant-ph2025

The FLuid Allocation of Surface code Qubits (FLASQ) cost model for early fault-tolerant quantum algorithms

William J. Huggins, Tanuj Khattar, Amanda Xu +6

Holistic resource estimates are essential for guiding the development of fault-tolerant quantum algorithms and the computers they will run on. This is particularly true when we foc…

quant-ph2017

A slightly smaller surface code S gate

Craig Gidney, Austin Fowler

We cut the volume of surface code S gates by 25% by omitting a Hadamard gate.

quant-ph2026

Color code off-the-hook: avoiding hook errors with a single auxiliary per plaquette

Gilad Kishony, Austin Fowler

Syndrome extraction in the planar color code is complicated by high weight stabilizers and hook errors that can reduce the circuit-level distance. With a single auxiliary qubit per…

quant-ph2021

A Fault-Tolerant Honeycomb Memory

Craig Gidney, Michael Newman, Austin Fowler +1

Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local meas…

quant-ph2014

Resource comparison of two surface code implementations of small angle Z rotations

Prashant Mishra, Austin Fowler

Fault-tolerant Z rotations by pi/2^k are important as they arise in numerous quantum algorithms, most notably those involving quantum Fourier transforms. We describe surface code i…

quant-ph2019

Learning Non-Markovian Quantum Noise from Moiré-Enhanced Swap Spectroscopy with Deep Evolutionary Algorithm

Murphy Yuezhen Niu, Vadim Smelyanskyi, Paul Klimov +30

Two-level-system (TLS) defects in amorphous dielectrics are a major source of noise and decoherence in solid-state qubits. Gate-dependent non-Markovian errors caused by TLS-qubit c…

quant-ph2020

Hartree-Fock on a superconducting qubit quantum computer

Frank Arute, Kunal Arya, Ryan Babbush +79

As the search continues for useful applications of noisy intermediate scale quantum devices, variational simulations of fermionic systems remain one of the most promising direction…

quant-ph2018

Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity

Ryan Babbush, Craig Gidney, Dominic W. Berry +5

We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the…

quant-ph2020

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…