Conservation laws and quantum error correction: towards a generalised matching decoder
Benjamin J. Brown

TL;DR
This paper investigates how minimum-weight perfect-matching decoders, crucial for surface code quantum error correction, can be generalized to other topological and stabilizer codes, enhancing fault-tolerant quantum computing.
Contribution
It proposes a systematic method to construct matching decoders for a broader class of quantum codes based on their structural properties.
Findings
Decoding algorithms exploiting symmetries improve error correction.
Examples of specialized matching decoders for biased noise models.
A framework for generalizing matching decoders to topological codes.
Abstract
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the leading efforts to demonstrate scalable quantum computing. Central to our discussion is the minimum-weight perfect-matching decoder. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. By concentrating on these symmetries, we begin to address the question of how a minimum-weight perfect-matching decoder might be generalised for other families of codes. We approach this question first by investigating examples of matching decoders for other codes. These include decoding algorithms that have been specialised to correct for noise models that demonstrate a particular…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Memory and Neural Computing · Quantum-Dot Cellular Automata
