Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes
Eric Sabo, Arun B. Aloshious, Kenneth R. Brown

TL;DR
This paper advances trellis decoding for qudit stabilizer codes, enhancing scalability and applying it to various quantum codes, resulting in improved decoding efficiency and higher error thresholds.
Contribution
It extends trellis decoding to prime-dimensional quantum systems, providing a canonical form and demonstrating its effectiveness on multiple quantum codes.
Findings
20% threshold improvement for color codes with boundaries
Trellis decoding applicable to any prime-dimensional system
Efficient offline and online decoding process
Abstract
Trellis decoders are a general decoding technique first applied to qubit-based quantum error correction codes by Ollivier and Tillich in 2006. Here we improve the scalability and practicality of their theory, show that it has strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The resulting formalism is valid for any prime-dimensional quantum system. The modified decoder works for any stabilizer code and separates into two parts: a one-time, offline computation which builds a compact, graphical representation of the normalizer of the code, , and a quick, parallel, online query of the resulting vertices using the Viterbi algorithm. We show the utility of trellis decoding by applying it to four high-density, length 20 stabilizer codes for…
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 · Quantum-Dot Cellular Automata · Quantum and electron transport phenomena
