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

In this work, we introduce a fast implementation of the minimum-weight perfect matching
(MWPM) decoder, the most widely used decoder for several important families of quantum …

The standard primitives of quantum computing include deterministic unitary entangling
gates, which are not natural operations in many systems including photonics. Here, we …

Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable
quantum computing, but the requisite numbers of qubits and physical error rates are …

Quantum error correction is an indispensable ingredient for scalable quantum computing. In
this Perspective we discuss a particular class of quantum codes called “quantum low-density …

Photonics is the platform of choice to build a modular, easy-to-network quantum computer
operating at room temperature. However, no concrete architecture has been presented so …

Large-scale quantum computers have the potential to hold computational capabilities
beyond conventional computers. However, the physical qubits are prone to noise which …

We construct a new explicit family of good quantum low-density parity-check codes which
additionally have linear time decoders. Our codes are based on a three-term chain (2 m× m) …

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

Quantum error correction is believed to be essential for scalable quantum computation, but
its implementation is challenging due to its considerable space-time overhead. Motivated by …