Fusion Blossom: Fast MWPM Decoders for QEC

05/15/2023
by   Yue Wu, et al.
0

The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Quantum Error Correction (QEC) decoding. Despite its high accuracy, existing implementations of the MWPM decoder cannot catch up with quantum hardware, e.g., 1 million measurements per second for superconducting qubits. They suffer from a backlog of measurements that grows exponentially and as a result, cannot realize the power of quantum computation. We design and implement a fast MWPM decoder, called Parity Blossom, which reaches a time complexity almost proportional to the number of defect measurements. We further design and implement a parallel version of Parity Blossom called Fusion Blossom. Given a practical circuit-level noise of 0.1 measurement rounds per second up to a code distance of 33. Fusion Blossom also supports stream decoding mode that reaches a 0.7 ms decoding latency at code distance 21 regardless of the measurement rounds.

READ FULL TEXT
research
05/25/2023

A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes

Quantum error-correcting codes (QECCs) can eliminate the negative effect...
research
06/21/2023

Single-shot decoding of good quantum LDPC codes

Quantum Tanner codes constitute a family of quantum low-density parity-c...
research
08/11/2022

NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for Surface Codes

Quantum error correction (QEC) is essential for quantum computing to mit...
research
07/28/2021

Improved quantum error correction using soft information

The typical model for measurement noise in quantum error correction is t...
research
01/20/2023

Scalable Quantum Error Correction for Surface Codes using FPGA

A fault-tolerant quantum computer must decode and correct errors faster ...
research
08/14/2021

LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction

The error rates of quantum devices are orders of magnitude higher than w...
research
10/25/2022

A distributed blossom algorithm for minimum-weight perfect matching

We describe a distributed, asynchronous variant of Edmonds's exact algor...

Please sign up or login with your details

Forgot password? Click here to reset