Stabilizer codes can be realized as graph codes
From MaRDI portal
Publication:3522381
Recommendations
Cited in
(21)- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Stabilizer codes and equientangled bases from phase states
- Magic state distillation with the ternary Golay code
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Two-colorable graph states with maximal Schmidt measure
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Variations on encoding circuits for stabilizer quantum codes
- Quantum stabilizer codes, lattices, and CFTs
- Compact neural-network quantum state representations of Jastrow and stabilizer states
- New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Homological stabilizer codes
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- Graph concatenation for quantum codes
- New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
- A complete characterization of all-versus-nothing arguments for stabilizer states
- Standard form of qudit stabilizer groups
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Entanglement in eight-qubit graph states
- Generalized graph states based on Hadamard matrices
- Implementing stabilizer codes by linear optics
This page was built for publication: Stabilizer codes can be realized as graph codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522381)
