Constructions and decoding procedures for quantum CSS codes
Yannick Saouter, Massinissa Zenia, Gilles Burel
TL;DR
This paper introduces new quantum CSS codes constructed from classical self-orthogonal codes and presents an algebraic decoding method demonstrated on BCH, Reed-Muller, and projective geometry codes.
Contribution
It provides novel constructions of quantum CSS codes using classical code combinations and introduces an algebraic decoding technique for these codes.
Findings
New CSS code constructions from classical self-orthogonal codes
Algebraic decoding method demonstrated on BCH, Reed-Muller, and projective geometry codes
Enhanced decoding procedures for quantum error correction
Abstract
This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes. A new algebraic decoding technique is also introduced. This technique is exemplified on CSS codes obtained from BCH, Reed-Muller and projective geometry codes.
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 Information and Cryptography · Quantum-Dot Cellular Automata