A combinatorial approach to quantum error correcting codes
From MaRDI portal
Abstract: Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric -vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence of operations that maps between two given graph colourings. We provide an explicit algorithm for computing the solution of our problem, which in turn is directly related to computing the distance (performance) of an underlying quantum error correcting code. Computing the distance of a quantum code is a highly non-trivial problem and our method may be of use in the construction of better codes.
Recommendations
Cites work
Cited in
(13)- A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes
- Flips in graphs
- On bounds for quantum error correcting codes over EJ-integers
- Maximality of quantum error-correcting code spaces
- 2-designs and redundant syndrome extraction for quantum error correction
- Analysis of quantum error correction with symmetric hypergraph states
- [[:Publication:291572|Syndrome measurement order for the 7,1,3 quantum error correction code]]
- scientific article; zbMATH DE number 1796837 (Why is no real title available?)
- A class of quantum low-density parity check codes by combining seed graphs
- CONCATENATION OF ERROR AVOIDING WITH ERROR CORRECTING QUANTUM CODES FOR CORRELATED NOISE MODELS
- Design of quantum error correcting code for biased error on heavy-hexagon structure
- Two Infinite Families of Nonadditive Quantum Error-Correcting Codes
- The multiplicative domain in quantum error correction
This page was built for publication: A combinatorial approach to quantum error correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931919)