Quantum technologies have the potential to solve certain computationally hard problems
with polynomial or super-polynomial speedups when compared to classical methods …

We present a family of local quantum channels whose steady states exhibit stable mixed-
state symmetry-protected topological (SPT) order. Motivated by recent experimental …

Estimating and reducing the overhead of fault-tolerance (FT) schemes is a crucial step
toward realizing scalable quantum computers. Of particular interest are schemes based on …

A fault-tolerant quantum computer will be supported by a classical decoding system
interfacing with quantum hardware to perform quantum error correction. It is important that …

In this work, we study the single-shot performance of higher-dimensional hypergraph
product codes decoded using belief propagation and ordered-statistics decoding [P …

Decoding algorithms based on approximate tensor-network (TN) contraction have proven
tremendously successful in decoding two-dimensional (2D) local quantum codes such as …

Implementing algorithms on a fault-tolerant quantum computer will require fast decoding
throughput and latency times to prevent an exponential increase in buffer times between the …

Single-shot error correction corrects data noise using only a single round of noisy
measurements on the data qubits, removing the need for intensive measurement repetition …

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high-
storage-threshold error rates and improved subthreshold performance under biased Pauli …

We introduce a model of nonunitary quantum dynamics that exhibits infinitely long-lived
discrete spatiotemporal order robust against any unitary or dissipative perturbation …