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

Graph concatenation for quantum codes

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

Published Feb 1, 2010• 23 citations
OpenAlex

Abstract

Original article: February 3, 2010

Related papers

Graph concatenation for quantum codes

Salman Beigi, Isaac L. Chuang, Markus Grassl +2 more

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.

arXiv:0910.4129•Journal of Mathematical Physics•Feb 1, 2011•24 citations

Applications of graph theory to quantum computation

Abbas Al-Shimary

•Jan 1, 2013•0 citations

Explicit error syndrome calculation for quantum graph codes

Gilson Oliveira dos Santos, Francisco de Assis, Aércio Ferreira de Lima

Quantum Information Processing•Aug 17, 2012•1 citation

Publisher's Note: Overhead analysis of universal concatenated quantum codes [Phys. Rev. A 95 , 022313 (2017)]

Christopher Chamberland, Tomas Jochym-O’Connor, Raymond Laflamme

Received 15 February 2017DOI:https://doi.org/10.1103/PhysRevA.95.029904©2017 American Physical SocietyPhysics Subject Headings (PhySH)Research AreasQuantum computationQuantum error correctionQuantum Information

Physical Review A•Feb 24, 2017•2 citations

From concatenated codes to graph codes

JØrn Justesen, Tom Høholdt

We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing in trees.

Manufacturing Engineer•Apr 6, 2005•2 citations

Concatenation of linear code pairs for quantum error correction and cryptography

Mitsuru Hamada

•Jan 1, 2008•0 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.