Quantum circuits—built from local unitary gates and local measurements—are a new
playground for quantum many-body physics and a tractable setting to explore universal …

Quantum computing holds substantial potential for applications in biology and medicine,
spanning from the simulation of biomolecules to machine learning methods for subtyping …

For the first time in history, we are seeing a branching point in computing paradigms with the
emergence of quantum processing units (QPUs). Extracting the full potential of computation …

Long-range entanglement—the backbone of topologically ordered states—cannot be
created in finite time using local unitary circuits, or, equivalently, adiabatic state preparation …

While quantum computers promise to solve some scientifically and commercially valuable
problems thought intractable for classical machines, delivering on this promise will require a …

The manipulation of topologically ordered phases of matter to encode and process quantum
information forms the cornerstone of many approaches to fault-tolerant quantum computing …

This article introduces PyMatching, a fast open-source Python package for decoding
quantum error-correcting codes with the minimum-weight perfect matching (MWPM) …

We propose a new class of error-correcting dynamic codes in two and three dimensions that
has no explicit connection to any parent subsystem code. The two-dimensional code, which …

The typical time-independent view of quantum error correction (QEC) codes hides significant
freedom in the decomposition into circuits that are executable on hardware. Using the …

The recent “honeycomb code” is a fault-tolerant quantum memory defined by a sequence of
checks, which implements a nontrivial automorphism of the toric code. We argue that a …