Metraipolis › archive › dc_ec8ca1416e22
Gnu code — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Gnu_code
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T16:28:39.501Z
- SHA-256 of the archived text
9599fe542e648924318e18ba7fd553a8361c2c1c064e95bcb470fd94b91bde4a- Stable URL of this page
https://metraipolis.com/documento/dc_ec8ca1416e22
How to cite
Gnu code — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Gnu_code (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ec8ca1416e22 (Metraipolis archive dc_ec8ca1416e22, sha256 9599fe542e648924318e18ba7fd553a8361c2c1c064e95bcb470fd94b91bde4a)
BibTeX
@misc{dcec8ca1416e22,
title = {Gnu code — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Gnu_code},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ec8ca1416e22; sha256 9599fe542e648924318e18ba7fd553a8361c2c1c064e95bcb470fd94b91bde4a},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Gnu_code. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 | 0 L ⟩ = ∑ ℓ even 0 ≤ ℓ ≤ n ( n ℓ ) 2 n − 1 | D g ℓ m ⟩ {\displaystyle |0_{\rm {L}}\rangle =\sum _{\ell \,{\textrm {even}} \atop 0\leq \ell \leq n}{\sqrt {\frac {n \choose \ell }{2^{n-1}}}}|D_{g\ell }^{m}\rangle } | 1 L ⟩ = ∑ ℓ odd 0 ≤ ℓ ≤ n ( n ℓ ) 2 n − 1 | D g ℓ m ⟩ {\displaystyle |1_{\rm {L}}\rangle =\sum _{\ell \,{\textrm {odd}} \atop 0\leq \ell \leq n}{\sqrt {\frac {n \choose \ell }{2^{n-1}}}}|D_{g\ell }^{m}\rangle } where | D k m ⟩ {\displaystyle |D_{k}^{m}\rangle } are the Dicke states consisting of a uniform superposition of all weight-k words on m qubits, e.g. | D 2 4 ⟩ = | 0011 ⟩ + | 0101 ⟩ + | 1001 ⟩ + | 0110 ⟩ + | 1010 ⟩ + | 1100 ⟩ 6 {\displaystyle |D_{2}^{4}\rangle ={\frac {|0011\rangle +|0101\rangle +|1001\rangle +|0110\rangle +|1010\rangle +|1100\rangle }{\sqrt {6}}}} The real parameter u = m g n {\displaystyle u={\frac {m}{gn}}} scales the length of the code. The number u {\displaystyle u} needs to be at least 1. The length m = g n u {\displaystyle m=gnu} , hence the name of the code. The distance of the code is the minimum of g {\displaystyle g} and n {\displaystyle n} . For g = n {\displaystyle g=n} and u ≥ 1 {\displaystyle u\geq 1} , the gnu code is capable of correcting g − 1 {\displaystyle g-1} erasure errors, or deletion errors. The code can also correct up to ⌊ ( g − 1 ) / 2 ⌋ {\displaystyle \lfloor (g-1)/2\rfloor } corrupted qubits from the property of the distance.
Tema degli esploratori: fisica e astronomia (deposito sistematico; categoria «Quantum information science»).
Fonte: Wikipedia in inglese, voce «Gnu code» — https://en.wikipedia.org/wiki/Gnu_code
Wikidata Q105626101 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q105626101
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Gnu_code?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1318177255, consultata il 2026-10-06T15:17:24.664Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 702d133ef673a7b29c2a9e9e042332672edd4d2711b82b4d525af920a0099fc9