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:0910.4129 · Journal of Mathematical Physics

Graph concatenation for quantum codes

Salman Beigi, Isaac L. Chuang, Markus Grassl, Peter W. Shor, Bei Zeng

Published Feb 1, 2011• 24 citations
arXivHTMLPDF

Abstract

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on “graph concatenation,” where graphs representing the inner and outer codes are concatenated via a simple graph operation called “generalized local complementation.” Our method applies to both binary and nonbinary concatenated quantum codes as well as their generalizations.

DOI
10.1063/1.3534799

Related papers

Generalized concatenated quantum codes

Markus Grassl, Peter W. Shor, Graeme Smith +2 more

We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.

arXiv:0901.1319•Physical Review A•May 22, 2009•48 citations

Generalized Concatenation for Quantum Codes

Markus Grassl, Peter W. Shor, Bei Zeng

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both stabilizer codes as well as so-called non-additive codes.

•Aug 1, 2009•4 citations

Generalized concatenation for quantum codes

Markus Grassl, Peter W. Shor, Bei Zeng

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both stabilizer codes as well as so-called non-additive codes.

arXiv:0905.0428•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•9 citations

Scheme for constructing graphs associated with stabilizer quantum codes

Carlo Cafaro, Damian Markham, Peter van Loock

We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code; second, the canonical form of the CWS code is uncovered; third, the input vertices are attached to the graphs. To check the effectiveness of the scheme, we discuss several graphical constructions of various useful stabilizer codes characterized by single and multi-qubit encoding operators. In particular, the error-correcting capabilities of such quantum codes are verified in graph-theoretic terms as originally advocated by Schlingemann and Werner. Finally, possible generalizations of our scheme for the graphical construction of both (stabilizer and nonadditive) nonbinary and continuous-variable quantum codes are briefly addressed.

arXiv:1407.2777•Jul 10, 2014•8 citations

A family of asymptotically good quantum codes based on code concatenation

Zhuo Li, Lijuan Xing, 西安电子科技大学综合业务网国家重点实验室,西安 710071

Using the idea of code concatenation in classical coding theory, we make the suggestion of constructing general concatenated quantum codes by choosing certain quantum codes as outer code and inner code. Then by concatenating quantum RS outer codes with a set of special quantum inner codes, one can construct a family of concatenated quantum codes, which is asymptotically good. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum code is constructed using bad classical codes.

Acta Physica Sinica•Jan 1, 2007•5 citations

A ZX-Calculus Approach for the Construction of Graph Codes

Zipeng Wu, Song Cheng, Bei Zeng

Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning-to depict the encoders of graph codes effectively. Through the integration of ZX-calculus with established encoder frameworks, we present a nuanced approach that leverages this graphical representation to facilitate the construction of large-scale QECCs. Our methodology is rigorously applied to examine the intricacies of concatenated graph codes and the development of holographic codes, thus demonstrating the practicality of our graphical approach in addressing complex quantum error correction challenges. This research contributes to the theoretical understanding of quantum error correction and offers practical tools for its application, providing objective advancements in the field of quantum computing.

arXiv:2304.08363•Apr 17, 2023•9 citations
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on “graph concatenation,” where graphs representing the inner and outer codes are concatenated via a simple graph operation called “generalized local complementation.” Our method applies to both binary and nonbinary concatenated quantum codes as well as their generalizations.
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code; second, the canonical form of the CWS code is uncovered; third, the input vertices are attached to the graphs. To check the effectiveness of the scheme, we discuss several graphical constructions of various useful stabilizer codes characterized by single and multi-qubit encoding operators. In particular, the error-correcting capabilities of such quantum codes are verified in graph-theoretic terms as originally advocated by Schlingemann and Werner. Finally, possible generalizations of our scheme for the graphical construction of both (stabilizer and nonadditive) nonbinary and continuous-variable quantum codes are briefly addressed.
Using the idea of code concatenation in classical coding theory, we make the suggestion of constructing general concatenated quantum codes by choosing certain quantum codes as outer code and inner code. Then by concatenating quantum RS outer codes with a set of special quantum inner codes, one can construct a family of concatenated quantum codes, which is asymptotically good. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum code is constructed using bad classical codes.
Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning-to depict the encoders of graph codes effectively. Through the integration of ZX-calculus with established encoder frameworks, we present a nuanced approach that leverages this graphical representation to facilitate the construction of large-scale QECCs. Our methodology is rigorously applied to examine the intricacies of concatenated graph codes and the development of holographic codes, thus demonstrating the practicality of our graphical approach in addressing complex quantum error correction challenges. This research contributes to the theoretical understanding of quantum error correction and offers practical tools for its application, providing objective advancements in the field of quantum computing.