Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
arXiv:2206.09726 · doi:10.1088/1402-4896/ac76ea
Abstract
We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code. Second, the canonical form of the CWS code is determined and third, the input vertices are attached to the graphs. In order to verify the effectiveness of the procedure, we implement the Gottesman stabilizer code characterized by multi-qubit encoding operators for the resource-efficient error correction of arbitrary single-qubit errors. Finally, the error-correcting capabilities of the Gottesman eight-qubit quantum stabilizer code is verified in graph-theoretic terms as originally advocated by Schlingemann and Werner.
20 pages, 2 tables, 1 figure. See also the unabridged work by Cafaro et al., arXiv:1407.2777 (2014)
References in corpus (12)
- Multi-party entanglement in graph states
- House of Graphs: a database of interesting graphs
- An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
- Experimental demonstration of a graph state quantum error-correction code
- Codeword Stabilized Quantum Codes
- Graphs, Quadratic Forms, and Quantum Codes
- Graphical Nonbinary Quantum Error-Correcting Codes
- Mapping graph state orbits under local complementation
- Graphical Quantum Error-Correcting Codes
- Graph states and local unitary transformations beyond local Clifford operations
- Analysis of quantum error correction with symmetric hypergraph states
- Scheme for constructing graphs associated with stabilizer quantum codes