REVIEW 17 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 17 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.
-
Enhancing dissipative cat qubit protection by squeezing
A squeezed deformation of dissipative cat qubits, implemented with an extra pump, boosts bit-flip time 160-fold at fixed phase-flip time.
-
The random coupled-plaquette gauge model and the surface code under circuit-level noise
A new 'random coupled-plaquette gauge model' couples X and Z syndrome lattices, yielding higher surface code thresholds when Y errors are properly accounted for.
-
Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays
The authors complete a transversal Clifford gate set on rotated surface codes by embedding a fold-transversal S gate inside a syndrome extraction round, with detector construction and numerical support.
-
High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture
A sparse second qubit layer (Bypass) shortens lattice surgery paths, reducing decoding bottlenecks and enabling a 2.5D FTQC architecture that is faster and uses fewer resources in simulation.
-
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.
-
Implementation of Magic State Injection within Heavy-Hexagon Architecture
On heavy-hexagon hardware with flag qubits, the ZXXZ orientation of the XZZX code with down-triangle qubit initialization gives the lowest logical error rate for magic state injection under biased noise.
-
SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry
SymBreak splits syndrome nodes during belief propagation, reporting 16x lower logical error rates than BP and 3.2x lower than BP+OSD for qLDPC codes, at near-BP runtime.
-
Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
Logical Bell-state protocols with d=3/5 surface and Bacon-Shor codes in ion traps need gate error rates around 10^-4 to 10^-5 to beat unencoded Bell states at 1 km, and the non-local protocol reaches about 33 Hz over ...
-
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.
-
Controller-decoder system requirements derived by implementing Shor's algorithm with surface code
Running a non-Clifford surface-code circuit requires controller-decoder latency of tens of microseconds and parallel decoding tasks; a 1000-qubit, 0.1%-error processor could factor 21 with over 90% logical fidelity.
Discussion (0). Continue with ORCID to comment.