Fast offline decoding with local message-passing automata

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Lake, Ethan
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909849959268352
author Lake, Ethan
author_facet Lake, Ethan
contents We present a local offline decoder for topological codes that operates according to a parallelized message-passing framework. The decoder works by passing messages between anyons, with the contents of received messages used to move nearby anyons towards one another. We prove the existence of a threshold, and show that in a system of linear size $L$, decoding terminates with an $O((\log L)^η)$ average-case runtime, where $η$ is a small constant. For the toric code subject to i.i.d Pauli noise, our decoder has $η=1$ and a threshold at a noise strength of $p_c\approx 7.3\%$.
format Preprint
id arxiv_https___arxiv_org_abs_2506_03266
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Fast offline decoding with local message-passing automata
Lake, Ethan
Quantum Physics
Statistical Mechanics
Strongly Correlated Electrons
Cellular Automata and Lattice Gases
We present a local offline decoder for topological codes that operates according to a parallelized message-passing framework. The decoder works by passing messages between anyons, with the contents of received messages used to move nearby anyons towards one another. We prove the existence of a threshold, and show that in a system of linear size $L$, decoding terminates with an $O((\log L)^η)$ average-case runtime, where $η$ is a small constant. For the toric code subject to i.i.d Pauli noise, our decoder has $η=1$ and a threshold at a noise strength of $p_c\approx 7.3\%$.
title Fast offline decoding with local message-passing automata
topic Quantum Physics
Statistical Mechanics
Strongly Correlated Electrons
Cellular Automata and Lattice Gases
url https://arxiv.org/abs/2506.03266