pith. machine review for the scientific record. sign in

arxiv: 1705.00857 · v1 · submitted 2017-05-02 · 🪐 quant-ph

Recognition: unknown

Decoding Small Surface Codes with Feedforward Neural Networks

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords decodingneuraltimefeedforwardnetworkalgorithmscodeserror
0
0 comments X
read the original abstract

Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Proof of a finite threshold for the union-find decoder

    quant-ph 2026-02 unverdicted novelty 8.0

    Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.