Gnu code
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In quantum information, the gnu code refers to a particular family of quantum error correcting codes, with the special property of being invariant under permutations of the qubits. Given integers g (the gap), n (the occupancy), and m (the length of the code), the two codewords are
- |0L⟩=∑ℓeven0≤ℓ≤n(nℓ)2n−1|Dgℓm⟩
- |1L⟩=∑ℓodd0≤ℓ≤n(nℓ)2n−1|Dgℓm⟩
where |Dkm⟩ are the Dicke states consisting of a uniform superposition of all weight-k words on m qubits, e.g.
- |D24⟩=|0011⟩+|0101⟩+|1001⟩+|0110⟩+|1010⟩+|1100⟩6
The real parameter u=mgn scales the length of the code. The number u needs to be at least 1. The length m=gnu, hence the name of the code. The distance of the code is the minimum of g and n. For g=n and u≥1, the gnu code is capable of correcting g−1 erasure errors,[1] or deletion errors.[2] The code can also correct up to ⌊(g−1)/2⌋ corrupted qubits from the property of the distance.
References
edit edit source- ^ Ouyang, Yingkai (2014-12-10). "Permutation-invariant quantum codes". Physical Review A. 90 (6) 062317. arXiv:1302.3247. Bibcode:2014PhRvA..90f2317O. doi:10.1103/physreva.90.062317. ISSN 1050-2947. S2CID 119114455.
- ^ Ouyang, Yingkai (2021-02-04). "Permutation-invariant quantum coding for quantum deletion channels". arXiv:2102.02494v1 [quant-ph].
communication
complexity theory
processor benchmarks
computing models
error correction
implementations
programming
Text derived from https://en.wikipedia.org/w/index.php?oldid=1318177255 under CC BY-SA 4.0; modifications have been made.