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

Bulletin of the American Physical Society

Graph convolutional network for topological stabilizer codes

Yasunari Suzuki, Amarsanaa Davaasuren, Keisuke Fujii, Masato Koashi, Yasunobu Nakamura

Published Mar 7, 2019• 0 citations
OpenAlex

Related papers

Normal Factor Graph Representations of Stabilizer Quantum Codes with Applications

July X. Li, Pascal O. Vontobel

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.

quant-pharXiv:2611.00985•Nov 3, 2026

Topological Stabilizer Codes

Keisuke Fujii

SpringerBriefs in mathematical physics•Jan 1, 2015•0 citations

Homological Stabilizer Codes

Jonas T. Anderson

In this paper we define homological stabilizer codes which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes.

arXiv:1107.3502•Jul 18, 2011•0 citations

Structure of 2D Topological Stabilizer Codes

Héctor Bombín

arXiv:1107.2707•Communications in Mathematical Physics•Mar 8, 2014•73 citations

Topological stabilizer code on a honeycomb lattice

Basudha Srivastava

•Jan 1, 2022•0 citations

Novel Architecture of Parameterized Quantum Circuit for Graph Convolutional Network

Yanhu Chen, Cen Wang, Hongxiang Guo +1 more

Recently, the implementation of quantum neural networks is based on noisy intermediate-scale quantum (NISQ) devices. Parameterized quantum circuit (PQC) is such the method, and its current design just can handle linear data classification. However, data in the real world often shows a topological structure. In the machine learning field, the classical graph convolutional layer (GCL)-based graph convolutional network (GCN) can well handle the topological data. Inspired by the architecture of a classical GCN, in this paper, to expand the function of the PQC, we design a novel PQC architecture to realize a quantum GCN (QGCN). More specifically, we first implement an adjacent matrix based on linear combination unitary and a weight matrix in a quantum GCL, and then by stacking multiple GCLs, we obtain the QGCN. In addition, we first achieve gradients decent on quantum circuit following the parameter-shift rule for a GCL and then for the QGCN. We evaluate the performance of the QGCN by conducting a node classification task on Cora dataset with topological data. The numerical simulation result shows that QGCN has the same performance as its classical counterpart, the GCN, in contrast, requires less tunable parameters. Compared to a traditional PQC, we also verify that deploying an extra adjacent matrix can significantly improve the classification performance for quantum topological data.

arXiv:2203.03251•Mar 7, 2022•1 citation
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.
In this paper we define homological stabilizer codes which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes.
Recently, the implementation of quantum neural networks is based on noisy intermediate-scale quantum (NISQ) devices. Parameterized quantum circuit (PQC) is such the method, and its current design just can handle linear data classification. However, data in the real world often shows a topological structure. In the machine learning field, the classical graph convolutional layer (GCL)-based graph convolutional network (GCN) can well handle the topological data. Inspired by the architecture of a classical GCN, in this paper, to expand the function of the PQC, we design a novel PQC architecture to realize a quantum GCN (QGCN). More specifically, we first implement an adjacent matrix based on linear combination unitary and a weight matrix in a quantum GCL, and then by stacking multiple GCLs, we obtain the QGCN. In addition, we first achieve gradients decent on quantum circuit following the parameter-shift rule for a GCL and then for the QGCN. We evaluate the performance of the QGCN by conducting a node classification task on Cora dataset with topological data. The numerical simulation result shows that QGCN has the same performance as its classical counterpart, the GCN, in contrast, requires less tunable parameters. Compared to a traditional PQC, we also verify that deploying an extra adjacent matrix can significantly improve the classification performance for quantum topological data.