Merge branch 'main' of http://github.com/errorcorrectionzoo/eczoo_data

Author: valbert4

code_extra/bib_preset.yml

@@ -19,7 +19,7 @@ ShorMSRI:
 PreskillNotes:
   _ready_formatted:
     flm: >-
-      J. Preskill, \emph{Lecture notes on Quantum Computation.} (1997–2020)
+      J. Preskill, \emph{Lecture notes on Quantum Computation} (1997–2020)
       \href{https://preskill.caltech.edu/ph219/}{URL}
 
 GottesmanBook:

codes/classical/bits/tanner/regular_tanner/regular_ldpc/expander.yml

@@ -35,7 +35,7 @@ features:
     - '''Find erasures and Decode'' a.k.a. Viderman''s algorithm correcting \hyperref[topic:asymptotics]{order} \(\Omega(n)\) errors in \hyperref[topic:asymptotics]{order} \(O(n)\) time \cite{doi:10.1145/2493252.2493255}.'
 
   fault_tolerance:
-    - 'The flip decoding algorithm is fault tolerant against parity-check errors \cite{doi:10.1109/18.556668}; see also \href{https://courses.csail.mit.edu/6.440/spring08/index.html}{course notes} by M. Sudan.'
+    - 'The flip decoding algorithm is fault tolerant against parity-check errors \cite{doi:10.1109/18.556668}; see also \cite{manual:{M. Sudan, \emph{Essential Coding Theory} (2008) \href{https://courses.csail.mit.edu/6.440/spring08/index.html}{URL}}}.'
 
 relations:
   parents:

codes/classical/properties/block/distributed_storage/ldc.yml

@@ -28,7 +28,7 @@ features:
     - 'LDCs admit decoders whose runtime scales polylogarithmically with \(n\).'
 
 notes:
-  - 'See \href{https://www.cs.princeton.edu/~zdvir/LDCnotes/ldc-notes.html}{notes} by Z. Dvir and Ref. \cite{preset:Gopi18,doi:10.1017/9781009283403} for introductions to LDCs and LCCs.'
+  - 'See \cite{manual:{Z. Dvir, \emph{Lecture notes on locally decodable codes} (2016) \href{https://www.cs.princeton.edu/~zdvir/LDCnotes/ldc-notes.html}{URL}}} and Ref. \cite{preset:Gopi18,doi:10.1017/9781009283403} for introductions to LDCs and LCCs.'
 
 
 relations:

codes/classical/properties/block/distributed_storage/lrc/lcc.yml

@@ -26,7 +26,7 @@ protection: |
   Three-query LCCs have to have length that is superpolynomial in the message length \cite{arxiv:2311.00558}.
 
 notes:
-  - 'See \href{https://www.cs.princeton.edu/~zdvir/LDCnotes/ldc-notes.html}{notes} by Z. Dvir and Ref. \cite{preset:Gopi18} for an introduction to LDCs and LCCs.'
+  - 'See \cite{manual:{Z. Dvir, \emph{Lecture notes on locally decodable codes} (2016) \href{https://www.cs.princeton.edu/~zdvir/LDCnotes/ldc-notes.html}{URL}}} and Ref. \cite{preset:Gopi18} for an introduction to LDCs and LCCs.'
   - 'See a popular summary of the result about three-query LCCs in \href{https://www.quantamagazine.org/magical-error-correction-scheme-proved-inherently-inefficient-20240109}{Quanta Magazine}.'
 
 

codes/quantum/groups/stabilizer/stabilizer.yml

@@ -15,8 +15,7 @@ description: |
   The coding theory motivation for stabilizer codes came from linear binary codes, whose codewords form a closed subspace in the space of binary strings.
   Stabilizer codes extend this property, in various ways, to quantum error correction.
   Stabilizer codes can be defined succinctly using the stabilizer group generators and without explicitly writing out a basis of codewords.
-  The stabilizer formalism is applicable to almost all quantum-code kingdoms; see \href{https://errorcorrectionzoo.org/list/stabilizer}{list of stabilizer codes} for a list of all stabilizer codes.
-
+  
   Stabilizer codes were originally defined for qubits, where the relevant commuting operators are tensor products of Pauli matrices.
   The Pauli stabilizer structure is useful in providing standardized encoding, gates, decoding, and performance bounds.
   Elements of this structure remain in qudit extensions, in particular for prime-dimensional modular qudits and Galois qudits.

codes/quantum/properties/block/block_quantum.yml

@@ -66,7 +66,7 @@ features:
 
 notes:
   - 'Tables of linear-programming upper bounds on general block quantum codes for various \(n\), \(k\), and \(q\), based on algorithms developed in Refs. \cite{doi:10.1007/978-3-540-37634-7_13,arxiv:2405.15057}, are maintained by M. Grassl at this \href{https://www.codetables.de/}{website}. A Magma implementation exists at this \href{https://magma.maths.usyd.edu.au/magma/handbook/text/1976}{website}.'
-  - 'States of block quantum codes can be classified in terms of the complexity of their underlying encoding circuit; see \href{https://complexityzoo.net/Complexity_Zoo_Exhibit}{Complexity Zoo exhibit}.'
+  - 'States of block quantum codes can be classified in terms of the complexity of their underlying encoding circuit; see the Complexity Zoo Exhibit on Classes of Quantum States and Probability Distributions \cite{manual:{S. Aaronson, The Complexity Zoo, \href{https://complexityzoo.net/}{URL}}}.'
 
 
 relations:

codes/quantum/qubits/stabilizer/topological/surface/hyperbolic/four_dimensional_hyperbolic.yml

@@ -14,7 +14,7 @@ description: |
   Homological linear-rate code based on cellulations of certain 4D hyperbolic manifolds with particular homology and systolic properties.
 
   Guth and Lubotzky \cite{arxiv:1310.5555} show that there exists \(\epsilon\), a 4D hyperbolic manifold \(M\), and a sequence of manifolds \(M_i\) such that
-  each \(M_i\) is a finite sheeted \href{https://en.wikipedia.org/wiki/Covering_space}{covering} of \(M\), and the 4D volumes of the manifolds \(\text{Vol}_4(M_i)\) of the sequence tend to infinity.
+  each \(M_i\) is a finite sheeted covering of \(M\), and the 4D volumes of the manifolds \(\text{Vol}_4(M_i)\) of the sequence tend to infinity.
   Also, the dimension of the second homology and size of systoles are bounded by \(H_2(M_i, \mathbb{Z}_2) \geq \frac{\text{Vol}_4(M_i)}{100}\) and \(\text{Sys}_2(M_i) \geq \text{Vol}_4(M_i)^\epsilon\), respectively.
 
   Then given any cellulation of \(M\), it can naturally be extended to cellulations for each of the manifolds \(M_i\) and used to define CSS codes via the homological construction by choosing the size three chain complex consisting of the \(3,2\) and \(1\)-cells of the cellulations.