Pith. sign in

REVIEW 6 cited by

General tensor network decoding of 2D Pauli codes

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 2101.04125 v3 pith:FJV5MCMJ submitted 2021-01-11 quant-ph

classification quant-ph
keywords codesdecodertensordecodingnetworknoisesurfaceapproximates
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this work we develop a general tensor network decoder for 2D codes. Specifically, we propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. For a code consisting of $n$ qubits our decoder has a runtime of $O(n\log n+n\chi^3)$, where $\chi$ is an approximation parameter. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models, namely regular surface codes, irregular surface codes, subsystem surface codes and colour codes, under bit-flip, phase-flip and depolarising noise. We show that the thresholds yielded by our decoder are state-of-the-art, and numerically consistent with optimal thresholds where available, suggesting that the tensor network decoder well approximates optimal decoding in all these cases. Novel to our decoder is an efficient and effective approximate contraction scheme for arbitrary 2D tensor networks, which may be of independent interest. We have also released an implementation of this algorithm as a stand-alone Julia package: SweepContractor.jl.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 26 citations worldwide. Full citation record

  1. Spacetime Layout and Logical Compilation of Color Code

    quant-ph 2026-07 conditional novelty 7.0 of 10

    An automated color-code logical compiler maps Clifford+T circuits to admissible spacetime block layouts via edge-decorated ZX diagrams and fusion-region-aware routing, beating reported surface-code volumes on nine benchmarks.

  2. A partition function framework for estimating logical error curves in stabilizer codes

    quant-ph 2025-05 accept novelty 7.0 of 10

    A ratio of partition functions, the decoding probability, exactly measures the success rate of maximum partition function decoders, including maximum likelihood and degeneracy-enhanced maximum probability decoding.

  3. Tensor network characterization and mitigation of readout errors

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    Readout errors, including correlated ones, are characterized and mitigated with a tensor-network (MPO/PEPO) model trained from calibration data.

  4. Correcting a noisy quantum computer using a quantum computer

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A variational quantum circuit, trained on syndrome data, decodes surface codes with accuracy close to minimum-weight perfect matching in classical simulation.

  5. RISC-Q: A Generator for Real-Time Quantum Control System-on-Chips Compatible with RISC-V

    cs.AR 2025-05 conditional novelty 6.0 of 10

    RISC-Q is an open-source, parameterizable generator for building RISC-V-based quantum control chips, demonstrated on a ZCU216 board at 500 MHz with 16 DACs.

  6. A Cross-Platform Analysis of High-Performance Quantum Error Correction Codes

    quant-ph 2026-07 conditional novelty 5.5 of 10

    A binomial fault-count model estimates QEC logical error rates from N_loc and p_loc, reproduces simulation trends, and identifies distributed-QPU sweet spots under interconnect noise.

Pith tools