Please use this identifier to cite or link to this item: https://doi.org/10.1063/1.3534799
Title: Graph concatenation for quantum codes
Authors: Beigi, S.
Chuang, I.
Grassl, M. 
Shor, P.
Zeng, B.
Issue Date: 3-Feb-2011
Citation: Beigi, S., Chuang, I., Grassl, M., Shor, P., Zeng, B. (2011-02-03). Graph concatenation for quantum codes. Journal of Mathematical Physics 52 (2) : -. ScholarBank@NUS Repository. https://doi.org/10.1063/1.3534799
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. © 2011 American Institute of Physics.
Source Title: Journal of Mathematical Physics
URI: http://scholarbank.nus.edu.sg/handle/10635/116376
ISSN: 00222488
DOI: 10.1063/1.3534799
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.