2008/07/22 by Pascal O. Vontobel, Vontobel, Pascal O.
Computer Science · Mathematics · Physics and Astronomy · #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #cs.IT #math.IT #quant-ph
paper · pdf · doi:10.48550/arxiv.0807.3566
Proceedings 5th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 1-5, 2008
arxiv created 2008/07/22 · openalex publication_date 2008/07/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be represented by graphical models which possess a structure that enables efficient and close-to-optimal iterative decoding. In this paper we focus on stabilizer QECCs, a class of QECCs whose construction is rendered non-trivial by the fact that the stabilizer label code, a code that is associated with a stabilizer QECC, has to satisfy a certain self-orthogonality condition. In order to design graphical models of stabilizer label codes that satisfy this condition, we extend a duality result for Forney-style factor graphs (FFGs) to the stabilizer label code framework. This allows us to formulate a simple FFG design rule for constructing stabilizer label codes, a design rule that unifies several earlier stabilizer label code constructions.