Scheme for constructing graphs associated with stabilizer quantum codes
arXiv:1407.2777
Abstract
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.
42 pages, 12 figures
References in corpus (11)
- Multi-party entanglement in graph states
- Building Gaussian Cluster States by Linear Optics
- House of Graphs: a database of interesting graphs
- Experimental demonstration of a graph state quantum error-correction code
- Codeword Stabilized Quantum Codes
- Graphical Nonbinary Quantum Error-Correcting Codes
- Encoding One Logical Qubit Into Six Physical Qubits
- Graphical Quantum Error-Correcting Codes
- Graphical description of local Gaussian operations for continuous-variable weighted graph states
- Local complementation rule for continuous-variable four-mode unweighted graph states
- Transformations of symmetric multipartite Gaussian states by Gaussian LOCC