Pith. sign in

REVIEW 5 cited by

Efficient near-optimal decoding of the surface code through ensembling

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

arxiv 2401.12434 v3 pith:7U7SFTGM submitted 2024-01-23 quant-ph

classification quant-ph
keywords decodingensembleaccurateaccuracycodedecodersensemblesensembling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce harmonization, an ensembling method that combines several "noisy" decoders to generate highly accurate decoding predictions. Harmonized ensembles of MWPM-based decoders achieve lower logical error rates than their individual counterparts on repetition and surface code benchmarks, approaching maximum-likelihood accuracy at large ensemble sizes. We can use the degree of consensus among the ensemble as a confidence measure for a layered decoding scheme, in which a small ensemble flags high-risk cases to be checked by a larger, more accurate ensemble. This layered scheme can realize the accuracy improvements of large ensembles with a relatively small constant factor of computational overhead. We conclude that harmonization provides a viable path towards highly accurate real-time decoding.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid

    quant-ph 2026-06 unverdicted novelty 8.0 of 10

    Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while usi...

  2. Magic state cultivation: growing T states as cheap as CNOT gates

    quant-ph 2024-09 unverdicted novelty 7.0 of 10

    Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.

  3. LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.

  4. Learning Neural Decoding with Parallelism and Self-Coordination for Quantum Error Correction

    quant-ph 2025-09 conditional novelty 6.0 of 10

    A transformer-based decoder trained on local window labels learns to output per-window logical corrections that can be XORed across sliding windows, enabling parallel decoding with accuracy slightly above belief match...

  5. Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation

    quant-ph 2025-04 unverdicted novelty 6.0 of 10

    FPGA emulator tests 10^13 error patterns in 20 days and diversity BP decoder matches BP+OSD logical error rates with 30-80% average speed gains and far less post-processing for QLDPC codes.

Pith tools