Skip to content

Commit

Permalink
Pfister refs
Browse files Browse the repository at this point in the history
  • Loading branch information
valbert4 committed Feb 29, 2024
1 parent ccd0ac0 commit 5258be4
Show file tree
Hide file tree
Showing 7 changed files with 14 additions and 6 deletions.
2 changes: 2 additions & 0 deletions codes/classical/analog/analog.yml
Original file line number Diff line number Diff line change
Expand Up @@ -69,6 +69,8 @@ features:

notes:
- 'Database of sphere packings \cite{manual:{Agrell, E. "Database of sphere packings, 2019." Online: http://codes. se/packings. Accessed (2015).}}.'
- 'See Refs. \cite{doi:10.1109/18.720549,arXiv:cs/0611112} for reviews of sphere packing.'


relations:
parents:
Expand Down
1 change: 1 addition & 0 deletions codes/classical/bits/cyclic/golay.yml
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ description: |
A \([23, 12, 7]\) perfect binary linear code with connections to various areas of mathematics, e.g., lattices \cite{doi:10.1007/978-1-4757-6568-7} and sporadic simple groups \cite{preset:MacSlo}. Adding a parity bit to the code results in the \([24, 12, 8]\) \textit{extended Golay code}. Up to equivalence, both codes are unique for their respective parameters.
To construct the Golay code, one can use the great dodecahedron to generate codewords by placing message bits on the faces and calculating the parity bits that live on the 12 vertices of the inner icosahedron.
See \cite[Table II]{doi:10.1109/18.720549} for a generator matrix.
# One form of the generator matrix for the extended Golay code is \((I|A)\), where
# \begin{align}
Expand Down
1 change: 1 addition & 0 deletions codes/classical/ecc.yml
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,7 @@ features:

notes:
- 'See Ref. \cite{doi:10.1090/conm/634/12692} for a list of open problems in coding theory.'
- 'See Refs. \cite{doi:10.1109/18.720549,arXiv:cs/0611112} for reviews of coding theory.'

relations:
parents:
Expand Down
2 changes: 1 addition & 1 deletion codes/classical/spherical/lattice_shell/lattice_shell.yml
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ physical: spheres
logical: reals

name: 'Lattice-shell code'
introduced: '\cite{doi:10.1109/TIT.1981.1056351}'
introduced: '\cite{doi:10.1109/TIT.1981.1056351,doi:10.1109/18.265491}'

description: |
Spherical code whose codewords are scaled versions of points on a lattice.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -32,14 +32,14 @@ description: |
Optimal unambiguous state discrimination requires each vector to be linearly independent, which corresponds to a full-rank codebook.
This is possible only if \(K \leq n\).
Optimal receiver performance in ambiguous state discrimination is determined using the \textit{Yuen-Kennedy-Lax (YKL) conditions} \cite{doi:10.1109/TIT.1975.1055351}.
See review \cite{doi:10.1116/5.0036959} for details on receivers used for coherent-state c-q codes.
features:
rate: 'Random Gaussian-distributed coherent-state c-q codes achieve the capacity of the lossy bosonic channel \cite{arxiv:quant-ph/0308012}.'
decoders:
- 'Optimal receiver performance in ambiguous state discrimination is determined using the \textit{Yuen-Kennedy-Lax (YKL) conditions} \cite{doi:10.1109/TIT.1975.1055351}.
See review \cite{doi:10.1116/5.0036959} for details on receivers used for coherent-state c-q codes.'
- 'Joint-detection receiver that can attain channel capacity \cite{arxiv:1101.1550}.'
- 'Various near-optimal receiver designs that can handle arbitrary constellations of coherent states with possible degeneracies \cite{arxiv:2109.00008}.'
- 'The \textit{square-root measurement} is optimal for geometrically uniform constellations \cite{arxiv:quant-ph/0005132,arxiv:quant-ph/0211111,arxiv:2203.09822}.'

realizations:
- 'Continuous-variable quantum key distribution (CV-QKD) \cite{arxiv:quant-ph/9907073,arxiv:quant-ph/0109084,arxiv:quant-ph/0312016}.'
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ realizations:
- 'Communication over dephasing \cite{arxiv:1907.12515}, time-varying phase-noise \cite{doi:10.1103/PhysRevResearch.2.023384}, and thermal-noise \cite{arxiv:2007.11109} channels.'
- 'Adaptive decoder using displacements and photon detection \cite{arxiv:2207.12234}.'
- 'Superconducting circuits: a bit-flip time of 1s has been achieved for the two-legged cat code in the classical-bit regime \cite{arxiv:2204.09128}.'

- 'BPQM detector on a BPSK-modulated tree code \cite{arxiv:2102.13052}.'

relations:
parents:
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,11 @@ description: |
Qubit code designed for transmission of classical information in the form of bits through non-classical channels.
protection: |
Performance of a linear binary code over a channel is dual to the performance of its dual over a particular dual channel \cite{arxiv:1701.05583}.
Performance of a linear binary code over a channel is dual to the performance of its dual over a particular dual channel \cite{arxiv:1701.05583}.
features:
decoders:
- 'BP with quantum messages (BPQM) decoder \cite{arxiv:2207.04984,arxiv:2003.04356,doi:10.1109/MBITS.2023.3285848}.'

relations:
parents:
Expand Down

0 comments on commit 5258be4

Please sign in to comment.