Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.00985

Normal Factor Graph Representations of Stabilizer Quantum Codes with Applications

July X. Li, Pascal O. Vontobel

quant-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

We develop normal factor graph (NFG) representations of stabilizer quantum error-correcting codes and entanglement-assisted quantum error-correcting codes. We introduce two complementary representations. Quantum-code NFGs describe stabilizer and normalizer label codes and provide a graphical framework for establishing self-orthogonality, constructing codes from component codes, and identifying encoding and decoding circuits. Quantum-probability NFGs represent the quantum-mechanical probabilities associated with encoding, noise, and measurement. We also introduce a doubleedge formulation that makes the relationship between these two representations explicit. We apply the framework to convolutional and tail-biting convolutional stabilizer codes, as well as to two classes of low-density parity-check stabilizer codes. Finally, we extend the quantum-probability representation to entanglementassisted codes.

AI Summary

The paper asks how normal factor graphs (NFGs) can represent stabilizer codes while exposing commutation constraints, circuit structure, and quantum-mechanical probabilities. It develops two complementary descriptions: quantum-code NFGs for stabilizer and normalizer label codes, and quantum-probability NFGs for encoding, noise, recovery, and measurement. A double-edge formulation groups paired quantum variables and relates the graphical structures. For quantum-code NFGs, local constraints are additive or linear codes. A graph-duality theorem, including a proof of the reverse inclusion missing from an earlier treatment, identifies the normalizer representation by dualizing local codes. Self-orthogonal local codes consequently produce a self-orthogonal global code. Opening and closing graph components connects code composition with Clifford-circuit decomposition. The paper also gives a decoding-circuit normal form with six gate-type stages, C–P–C–P–H–C, or five using controlled-$Z$; these stages are not bounds on physical circuit depth. The main constructive application is to convolutional and tail-biting stabilizer codes. Explicit algorithms generate self-orthogonal elementary constraints and encoding circuits using $\nu=\sum_i\nu_i$ memory qubits for additive label codes. For $\mathrm{GF}(4)$-linear label codes, the construction uses between $\nu/2$ and $\nu$ memory qubits. Examples reduce memory from three qubits to one or two relative to cited shift-register constructions. Further applications graphically re-establish commutation for hypergraph-product and toric codes and extend probability representations to entanglement-assisted codes. The memory results concern the supplied constructions rather than a general optimality theorem. Developing decoding algorithms that exploit these representations while explicitly accounting for degeneracy is left for future work.

Little sign of AI-generated textIncrementalUnclear noveltyPossible error

Error found: The Section IV-C Hermitian modification of the convolutional-code state-generation algorithm fails on the paper's own Section IV-F example, producing elementary-code rows with nonzero Hermitian inner product that its diagonal corrections cannot repair. The toric-code proof incorrectly infers S=C_Z from S-perp=C_Z; its intended argument requires S-perp=C_Z-perp.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Factor-graph representations of stabilizer quantum codes

July X. Li, Pascal O. Vontobel

We study normal factor graph (NFG) representations of stabilizer quantum error-correction codes (QECCs), in particular NFG representations of the stabilizer label code and the normalizer label code associated with a stabilizer QECC. The structure of the NFGs we are using is such that the (symplectic) self-orthogonality constraint that stabilizer label codes have to satisfy can be proven rather straightforwardly by applying certain NFG reformulations. We show that a variety of well-known stabilizer QECCs can be expressed in this framework: (tail-biting) convolutional stabilizer QECCs, the toric stabilizer QECCs by Kitaev, and a class of stabilizer QECCs that was recently introduced by Tillich and Zémor. Our approach not only gives new insights into these stabilizer QECCs, but will ultimately help to formulate new classes of stabilizer QECCs and low-complexity (approximate) decoding algorithms.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2016•5 citations

Stabilizer quantum codes: A unified view based on Forney-style factor graphs

Pascal O. Vontobel

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.

arXiv:0807.3566•International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2008•2 citations

Graph-theoretic approach to quantum error correction

Robert R. Vandermolen, Duncan Wright

We investigate a class of quantum error-correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. In this framework, we represent the algebraic conditions for error correction in terms of edge avoidance between graphs providing a visual representation of the interplay between errors and error-correcting codes. Most importantly, this framework supports the development of quantum codes that correct against a predetermined set of errors, in contrast to current methods. A heuristic algorithm is presented, providing steps to develop codes that correct against an arbitrary noisy channel. We benchmark the correction capability of reflexive stabilizer codes for the case of single-qubit errors by comparison to existing stabilizer codes that are widely used. In addition, we present two instances of optimal encodings: an optimal encoding for fully correlated noise, which achieves a higher encoding rate than previously known, and a minimal encoding for single-qudit errors on a four-state system..

arXiv:2110.08414•Physical Review A•Mar 29, 2022•5 citations

Quantum Codes From Classical Graphical Models

Joschka Roffe, Stefan Zohren, Dominic Horsman +1 more

We introduce a new graphical framework for designing quantum error correction codes based on classical principles. A key feature of this graphical language, over previous approaches, is that it is closely related to that of factor graphs or graphical models in classical information theory and machine learning. It enables us to formulate the description of the recently-introduced `coherent parity check' quantum error correction codes entirely within the language of classical information theory. This makes our construction accessible without requiring background in quantum error correction or even quantum mechanics in general. More importantly, this allows for a collaborative interplay where one can design new quantum error correction codes derived from classical codes.

arXiv:1804.07653•IEEE Transactions on Information Theory•Sep 3, 2019•9 citations

A class of quantum stabilizer codes based on classical convolutional codes

Xinmei Wang

A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,the necessary and sufficient condition is proved under which classical convolutional codes over GF(4) are self-orthogonal with respect to the trace inner product,and then corresponding codes satisfying the condition are found.Tail-biting codes with a simple block structure are obtained by tail-biting transformation,which are self-orthogonal with respect to the trace inner product.Finally,relative quantum stabilizer codes are constructed.The code construction is simple,and the minimum distance of the code approaches the upper bound.

Journal of Xidian University•Jan 1, 2008•0 citations

Quantized Graphs and Quantum Error Correction

Zhengwei Liu

Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a general framework. We give a new method to construct graphical quantum error correcting codes on quantized graphs and characterize all optimal ones. We establish a further connection to geometric group theory and construct quantum low-density parity-check stabilizer codes on the Cayley graphs of groups. Their logical qubits can be encoded by the ground states of newly constructed exactly solvable models with translation-invariant local Hamiltonians. Moreover, the Hamiltonian is gapped in the large limit when the underlying group is infinite.

arXiv:1910.12065•Oct 26, 2019•6 citations
We develop normal factor graph (NFG) representations of stabilizer quantum error-correcting codes and entanglement-assisted quantum error-correcting codes. We introduce two complementary representations. Quantum-code NFGs describe stabilizer and normalizer label codes and provide a graphical framework for establishing self-orthogonality, constructing codes from component codes, and identifying encoding and decoding circuits. Quantum-probability NFGs represent the quantum-mechanical probabilities associated with encoding, noise, and measurement. We also introduce a doubleedge formulation that makes the relationship between these two representations explicit. We apply the framework to convolutional and tail-biting convolutional stabilizer codes, as well as to two classes of low-density parity-check stabilizer codes. Finally, we extend the quantum-probability representation to entanglementassisted codes.
The paper asks how normal factor graphs (NFGs) can represent stabilizer codes while exposing commutation constraints, circuit structure, and quantum-mechanical probabilities. It develops two complementary descriptions: quantum-code NFGs for stabilizer and normalizer label codes, and quantum-probability NFGs for encoding, noise, recovery, and measurement. A double-edge formulation groups paired quantum variables and relates the graphical structures.
For quantum-code NFGs, local constraints are additive or linear codes. A graph-duality theorem, including a proof of the reverse inclusion missing from an earlier treatment, identifies the normalizer representation by dualizing local codes. Self-orthogonal local codes consequently produce a self-orthogonal global code. Opening and closing graph components connects code composition with Clifford-circuit decomposition. The paper also gives a decoding-circuit normal form with six gate-type stages, C–P–C–P–H–C, or five using controlled-ZZZ; these stages are not bounds on physical circuit depth.
The main constructive application is to convolutional and tail-biting stabilizer codes. Explicit algorithms generate self-orthogonal elementary constraints and encoding circuits using ν=∑iνi\nu=\sum_i\nu_iν=∑i​νi​ memory qubits for additive label codes. For GF(4)\mathrm{GF}(4)GF(4)-linear label codes, the construction uses between ν/2\nu/2ν/2 and ν\nuν memory qubits. Examples reduce memory from three qubits to one or two relative to cited shift-register constructions. Further applications graphically re-establish commutation for hypergraph-product and toric codes and extend probability representations to entanglement-assisted codes.
The memory results concern the supplied constructions rather than a general optimality theorem. Developing decoding algorithms that exploit these representations while explicitly accounting for degeneracy is left for future work.
We study normal factor graph (NFG) representations of stabilizer quantum error-correction codes (QECCs), in particular NFG representations of the stabilizer label code and the normalizer label code associated with a stabilizer QECC. The structure of the NFGs we are using is such that the (symplectic) self-orthogonality constraint that stabilizer label codes have to satisfy can be proven rather straightforwardly by applying certain NFG reformulations. We show that a variety of well-known stabilizer QECCs can be expressed in this framework: (tail-biting) convolutional stabilizer QECCs, the toric stabilizer QECCs by Kitaev, and a class of stabilizer QECCs that was recently introduced by Tillich and Zémor. Our approach not only gives new insights into these stabilizer QECCs, but will ultimately help to formulate new classes of stabilizer QECCs and low-complexity (approximate) decoding algorithms.
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.
We investigate a class of quantum error-correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. In this framework, we represent the algebraic conditions for error correction in terms of edge avoidance between graphs providing a visual representation of the interplay between errors and error-correcting codes. Most importantly, this framework supports the development of quantum codes that correct against a predetermined set of errors, in contrast to current methods. A heuristic algorithm is presented, providing steps to develop codes that correct against an arbitrary noisy channel. We benchmark the correction capability of reflexive stabilizer codes for the case of single-qubit errors by comparison to existing stabilizer codes that are widely used. In addition, we present two instances of optimal encodings: an optimal encoding for fully correlated noise, which achieves a higher encoding rate than previously known, and a minimal encoding for single-qudit errors on a four-state system..
We introduce a new graphical framework for designing quantum error correction codes based on classical principles. A key feature of this graphical language, over previous approaches, is that it is closely related to that of factor graphs or graphical models in classical information theory and machine learning. It enables us to formulate the description of the recently-introduced `coherent parity check' quantum error correction codes entirely within the language of classical information theory. This makes our construction accessible without requiring background in quantum error correction or even quantum mechanics in general. More importantly, this allows for a collaborative interplay where one can design new quantum error correction codes derived from classical codes.
A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,the necessary and sufficient condition is proved under which classical convolutional codes over GF(4) are self-orthogonal with respect to the trace inner product,and then corresponding codes satisfying the condition are found.Tail-biting codes with a simple block structure are obtained by tail-biting transformation,which are self-orthogonal with respect to the trace inner product.Finally,relative quantum stabilizer codes are constructed.The code construction is simple,and the minimum distance of the code approaches the upper bound.
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a general framework. We give a new method to construct graphical quantum error correcting codes on quantized graphs and characterize all optimal ones. We establish a further connection to geometric group theory and construct quantum low-density parity-check stabilizer codes on the Cayley graphs of groups. Their logical qubits can be encoded by the ground states of newly constructed exactly solvable models with translation-invariant local Hamiltonians. Moreover, the Hamiltonian is gapped in the large limit when the underlying group is infinite.