REVIEW 9 cited by
Sparse Blossom: correcting a million errors per core second with minimum-weight matching
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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 error correcting codes, including surface codes. Our algorithm, which we call sparse blossom, is a variant of the blossom algorithm which directly solves the decoding problem relevant to quantum error correction. Sparse blossom avoids the need for all-to-all Dijkstra searches, common amongst MWPM decoder implementations. For 0.1% circuit-level depolarising noise, sparse blossom processes syndrome data in both $X$ and $Z$ bases of distance-17 surface code circuits in less than one microsecond per round of syndrome extraction on a single core, which matches the rate at which syndrome data is generated by superconducting quantum computers. Our implementation is open-source, and has been released in version 2 of the PyMatching library.
Forward citations
Cited by 9 Pith papers
-
Physics-Informed Graph-Neural Decoding of the Surface Code: the Logical Signal as an Exact Topological Pairing
The logical-error signal in a surface-code decoder is an exact relative-cohomology pairing of the syndrome with a boundary-fixed harmonic coordinate, evaluated as the current difference between two boundary sinks.
-
The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop
In windowed quantum decoding, a wrong speculative boundary guess stays inside one window, and the predict-verify-recover loop removes the serial stall with negligible penalty.
-
A Unitary Encoder for Surface Codes
A new non-local unitary encoder grows a rotated surface code from distance d to 2d-1 in four time steps, giving about 43% less depth than the previous best logarithmic-depth encoder.
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Real-Time Dynamics in a (2+1)-D Gauge Theory: The Stringy Nature on a Superconducting Quantum Simulator
On a 144-qubit superconducting processor, the authors observe the real-time dynamics of confining electric strings in a (2+1)-D Z2 gauge theory, distinguishing longitudinal yo-yo modes from transverse bending and demo...
-
Correcting a noisy quantum computer using a quantum computer
A variational quantum circuit, trained on syndrome data, decodes surface codes with accuracy close to minimum-weight perfect matching in classical simulation.
-
Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code
Confidence-gated neural decoding escalates only ~3–6% of rotated-surface-code syndromes to MWPM and raises end-to-end accuracy from 99.21% to 99.81% at d=7 under circuit-level depolarising noise.
-
Dynamics and rupture of doped Motility Induced Phase Peparation
Adding passive particles to a phase-separated active suspension can produce a stable, self-sustained drift of the dense slab.
-
Synchronization for Fault-Tolerant Quantum Computers
Active and Hybrid synchronization policies cut logical error rates by up to 2.4x and 3.4x compared to passive waiting, by distributing idle time across syndrome generation rounds.
Discussion (0). Sign in to comment.