bib lint

valbert4 · valbert4 · commit 338b4674eaf7 · 2026-05-26T14:58:09.000-04:00
diff --git a/codelists/descendants/classical/list_self_dual.yml b/codelists/descendants/classical/list_self_dual.yml
@@ -1,6 +1,6 @@
 
 list_id: self_dual
-title: Self-dual objects
+title: Classical self-dual objects
 intro: |
   Here is a list of self-dual objects from classical coding theory --- codes, lattices, and polytopes.
 
diff --git a/codelists/descendants/classical/q-ary_digits/list_q-ary_linear.yml b/codelists/descendants/classical/q-ary_digits/list_q-ary_linear.yml
@@ -2,7 +2,7 @@
 list_id: 'q-ary_linear'
 
 title: |
-  \(q\)-ary linear codes
+  Non-binary linear codes
 
 intro: |
   Here is a list of \hyperref[code:q-ary_linear]{\(q\)-ary linear codes} over the Galois field \(\mathbb{F}_q\) for \(q > 2\). For \(q=2\), see \hyperref[codelist:binary_linear]{Binary linear codes}.
diff --git a/codes/classical/bits/cyclic/quad_residue/extended_golay.yml b/codes/classical/bits/cyclic/quad_residue/extended_golay.yml
@@ -57,9 +57,9 @@ relations:
     - code_id: binary_quad_residue
       detail: 'The extended Golay code is an extended binary quadratic-residue code \cite[Ch. 16]{preset:MacSlo}.'
     - code_id: icosahedron
-      detail: 'The parity bits of the extended Golay code can be visualized to lie on the vertices of the icosahedron; see \href{https://blogs.ams.org/visualinsight/2015/12/01/golay-code/}{post} by J. Baez for more details. To construct the 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.'
+      detail: 'The parity bits of the extended Golay code can be visualized to lie on the vertices of the icosahedron; see \cite{manual:{J. Baez, "Golay Code", Visual Insight (2015) \href{https://blogs.ams.org/visualinsight/2015/12/01/golay-code/}{URL}}} for more details. To construct the 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.'
     - code_id: dodecahedron
-      detail: 'The parity bits of the extended Golay code can be visualized to lie on the vertices of the icosahedron; see \href{https://blogs.ams.org/visualinsight/2015/12/01/golay-code/}{post} by J. Baez for more details. To construct the 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.'
+      detail: 'The parity bits of the extended Golay code can be visualized to lie on the vertices of the icosahedron; see \cite{manual:{J. Baez, "Golay Code", Visual Insight (2015) \href{https://blogs.ams.org/visualinsight/2015/12/01/golay-code/}{URL}}} for more details. To construct the 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.'
     - code_id: golay
       detail: 'The extended Golay code is an extension of the Golay code by a parity-check bit.'
     - code_id: group
diff --git a/codes/classical/bits/easy/cordaro_wagner.yml b/codes/classical/bits/easy/cordaro_wagner.yml
@@ -15,7 +15,7 @@ description: |
   A linear binary code with \(k=2\) that is optimal among binary linear \([n,2,d]\) codes.
 
 notes:
-  - 'Implementation in Komm Python software library for communication systems \cite{manual:{R. W. Nobrega, Komm, 2025 \href{https://github.com/rwnobrega/komm}{URL}}}.'
+  - 'Implementation in Komm Python software library for communication systems \cite{manual:{R. W. Nobrega, Komm Software Package, 2025 \href{https://github.com/rwnobrega/komm}{URL}}}.'
 
 
 relations:
diff --git a/codes/quantum/groups/group_quantum.yml b/codes/quantum/groups/group_quantum.yml
@@ -66,7 +66,7 @@ relations:
     - code_id: homogeneous_space_quantum
       detail: 'Homogeneous spaces \(G/H\) for trivial \(H\) reduce to group spaces. A group-\(G\) space can also be thought of as a multiplicity-free homogeneous space \((G\times G) / G\) \cite[pg. 60]{preset:Diaconis88}.'
     - code_id: category_quantum
-      detail: 'Finite-group-based quantum codes, whose basis states are parameterized by a finite group, correspond to category-based codes for the fusion category \(Vec G\). Extensions of such categories to Lie groups can also be done \cite{manual:{K. Fredenhagen, “Superselection sectors with infinite statistical dimension”, Subfactors (Kyuzeso, 1993) (1994): 242-258},arxiv:2106.12577,manual:{K. Walker, “Lie group symmetries and non-unital higher categories. Subfactors and Fusion (2-)Categories”, Banff International Research Station, 2023 \href{https://www.birs.ca/events/2023/5-day-workshops/23w5091/videos/watch/202312061131-Walker.html}{URL}},arxiv:2503.14596} (see also \cite{arxiv:gr-qc/0303060}).'
+      detail: 'Finite-group-based quantum codes, whose basis states are parameterized by a finite group, correspond to category-based codes for the fusion category \(Vec G\). Extensions of such categories to Lie groups can also be done \cite{manual:{K. Fredenhagen, “Superselection sectors with infinite statistical dimension”, Subfactors (Kyuzeso, 1993) (1994): 242-258},arxiv:2106.12577,manual:{K. Walker, “Lie group symmetries and non-unital higher categories”, Banff International Research Station, 2023 \href{https://www.birs.ca/events/2023/5-day-workshops/23w5091/videos/watch/202312061131-Walker.html}{URL}},arxiv:2503.14596} (see also \cite{arxiv:gr-qc/0303060}).'
 
 
 # Begin Entry Meta Information
diff --git a/codes/quantum/groups/stabilizer/qldpc/general_qldpc.yml b/codes/quantum/groups/stabilizer/qldpc/general_qldpc.yml
@@ -65,10 +65,10 @@ protection: |
 features:
   decoders:
     - 'Non-binary decoding algorithm for CSS-type QLDPC codes \cite{doi:10.1109/ACCESS.2015.2503267}.'
-    - 'GD-CSS Decoder for Galois-qudit CSS QLDPC codes \cite{arxiv:2507.11534,manual:{K. Kasai, “GD-CSS Decoder (Quantum Error Correction using Non-binary LDPC over GF(q))”, 2025 \href{https://github.com/kasaikenta/gd-css-decoder}{URL}}}'
+    - 'GD-CSS Decoder for Galois-qudit CSS QLDPC codes \cite{arxiv:2507.11534,manual:{K. Kasai, “GD-CSS Decoder (Quantum Error Correction using Non-binary LDPC over GF(q)) Software Package”, 2025 \href{https://github.com/kasaikenta/gd-css-decoder}{URL}}}'
 
 notes:
-  - 'Infleqtion QLDPC software library for estimating distance and creating various qubit and Galois-qudit QLDPC CSS codes \cite{manual:{M. A. Perlin, qLDPC, 2023 \href{https://github.com/Infleqtion/qLDPC}{URL}}}'
+  - 'Infleqtion QLDPC software library for estimating distance and creating various qubit and Galois-qudit QLDPC CSS codes \cite{manual:{M. A. Perlin, qLDPC Software Package, 2023 \href{https://github.com/Infleqtion/qLDPC}{URL}}}'
   - 'LDPC Python software library for decoding LDPC and QLDPC codes \cite{arxiv:2005.07016,preset:Roffe22}.'
   - 'Reviews of QLDPC codes provided in Refs. \cite{doi:10.1109/ACCESS.2015.2503267,arxiv:2103.06309,arxiv:2510.14090}.'
 
diff --git a/codes/quantum/oscillators/qsc/cat/two-legged-cat.yml b/codes/quantum/oscillators/qsc/cat/two-legged-cat.yml
@@ -50,7 +50,7 @@ realizations:
 #  - 'Approximate ("kitten") optical realization of the odd cat state \cite{doi:10.1126/science.1122858}.'
 
 notes:
-  - 'Pedagogical introduction to cat codes in the context of microwave cavities can be found in Refs. \cite{arxiv:2203.03222,manual:{S. Puri, “QEC when the noise is biased”, 2019 \href{https://physinfo.fr/houches2019/files/Puri_v1.pdf}{URL}}}, and in the context of optical systems in books \cite{doi:10.1093/acprof:oso/9780198509141.001.0001,doi:10.1142/9781860948169_0009,doi:10.1002/9783527695805}.'
+  - 'Pedagogical introduction to cat codes in the context of microwave cavities can be found in Refs. \cite{arxiv:2203.03222,manual:{S. Puri, “QEC when the noise is biased”, Les Houches Summer School (2019) \href{https://physinfo.fr/houches2019/files/Puri_v1.pdf}{URL}}}, and in the context of optical systems in books \cite{doi:10.1093/acprof:oso/9780198509141.001.0001,doi:10.1142/9781860948169_0009,doi:10.1002/9783527695805}.'
   - 'Ground states of the fluxonium superconducting qubit resemble two-component cat codewords \cite{arxiv:2501.16425}.'
 
 relations:
diff --git a/codes/quantum/properties/hamiltonian/self_correct.yml b/codes/quantum/properties/hamiltonian/self_correct.yml
@@ -58,7 +58,7 @@ relations:
       detail: 'Self-correcting quantum codes do no require a symmetry for protection, so in that sense they are protected by a trivial symmetry.'
   cousins:
     - code_id: surface
-      detail: 'The surface code is not thermally stable \cite{arxiv:quant-ph/0702102,arxiv:0709.2717,arxiv:0810.4584,arxiv:0911.3843,arxiv:2410.01206} because its string-like logical operators anti-commute with stabilizer generators supported only at their ends, and thus have a constant energy cost of creation. Various candidates for self-correcting quantum memories have been constructed by coupling neighboring anyons in the code so as to prevent them from spreading \cite{arxiv:0812.4622,arxiv:0908.4264,arxiv:1101.6028,manual:{D. Poulin, “Decoding problem for topological quantum codes” [Conference talk], Simons Center for Geometry and Physics, Stony Brook University, 2011 \href{http://scgp.stonybrook.edu/archives/1087}{URL}},arxiv:1406.2338,arxiv:1511.05579,arxiv:1512.04528,arxiv:2510.08056}.'
+      detail: 'The surface code is not thermally stable \cite{arxiv:quant-ph/0702102,arxiv:0709.2717,arxiv:0810.4584,arxiv:0911.3843,arxiv:2410.01206} because its string-like logical operators anti-commute with stabilizer generators supported only at their ends, and thus have a constant energy cost of creation. Various candidates for self-correcting quantum memories have been constructed by coupling neighboring anyons in the code so as to prevent them from spreading \cite{arxiv:0812.4622,arxiv:0908.4264,arxiv:1101.6028,manual:{D. Poulin, “Decoding problem for topological quantum codes”, Simons Center for Geometry and Physics, Stony Brook University, 2011 \href{http://scgp.stonybrook.edu/archives/1087}{URL}},arxiv:1406.2338,arxiv:1511.05579,arxiv:1512.04528,arxiv:2510.08056}.'
     - code_id: 2d_stabilizer
       detail: '2D stabilizer codes \cite{arxiv:0810.1983} and encodings of frustration-free code Hamiltonians \cite{arxiv:1209.5750} admit only constant-energy excitations, and so do not have an energy barrier.'
     - code_id: quantum_double
diff --git a/codes/quantum/qubits/stabilizer/mbqc/cluster_state.yml b/codes/quantum/qubits/stabilizer/mbqc/cluster_state.yml
@@ -108,7 +108,7 @@ notes:
   - 'See Refs. \cite{arxiv:quant-ph/0602096,doi:10.1002/9783527635283} for a review of cluster states and their applications.'
   - 'Cluster states are useful for entanglement purification \cite{arxiv:0705.4165}.'
   - 'The original one-way MBQC paper also noted that universal computation remains possible on irregular occupied 2D clusters above the percolation threshold, and that finite clusters can be reused by re-entangling successive computation segments \cite{doi:10.1103/PhysRevLett.86.5188}.'
-  - 'Graph-State Compass (GSC) Python software library for manipulating local Clifford equivalence classes of cluster states \cite{arxiv:1910.03969,doi:10.5281/zenodo.2582616,manual:{S. Morley-Short, GSC, 2021 \href{https://github.com/sammorley-short/gsc/tree/master}{URL}}}.'
+  - 'Graph-State Compass (GSC) Python software library for manipulating local Clifford equivalence classes of cluster states \cite{arxiv:1910.03969,doi:10.5281/zenodo.2582616,manual:{S. Morley-Short, GSC Software Package, 2021 \href{https://github.com/sammorley-short/gsc/tree/master}{URL}}}.'
 
 
 relations:
diff --git a/codes/quantum/qubits/stabilizer/qldpc/qldpc.yml b/codes/quantum/qubits/stabilizer/qldpc/qldpc.yml
@@ -111,9 +111,9 @@ features:
 
 notes:
   - 'Links to code tables of notable QLDPC codes \cite{arxiv:2103.06309}.'
-  - 'Collection of QLDPC qubit codes based on hyperbolic tilings in the QEC-Pages software library \cite{manual:{L. P. Pryadko and M. Woolls, Quantum_LDPC_Codes, 2023 \href{https://github.com/QEC-pages/Quantum_LDPC_Codes}{URL}}}.'
+  - 'Collection of QLDPC qubit codes based on hyperbolic tilings in the QEC-Pages software library \cite{manual:{L. P. Pryadko and M. Woolls, Quantum_LDPC_Codes Software Package, 2023 \href{https://github.com/QEC-pages/Quantum_LDPC_Codes}{URL}}}.'
   - 'High-rate QLDPC codes can be used for Bell-pair distillation \cite{arxiv:2502.09542}.'
-  - 'Qldpc code circUIT Simulator (QUITS) Python software library for simulating QLDPC code circuits \cite{arxiv:2504.02673,manual:{M. Kang, QUITS, 2025 \href{https://github.com/mkangquantum/quits}{URL}}}.'
+  - 'Qldpc code circUIT Simulator (QUITS) Python software library for simulating QLDPC code circuits \cite{arxiv:2504.02673,manual:{M. Kang, QUITS Software Package, 2025 \href{https://github.com/mkangquantum/quits}{URL}}}.'
 
 relations:
   parents:
diff --git a/codes/quantum/qubits/stabilizer/qubit_stabilizer.yml b/codes/quantum/qubits/stabilizer/qubit_stabilizer.yml
@@ -272,9 +272,9 @@ notes:
   - 'The stabilizer formalism has been gamified \cite{arxiv:2405.06795}.'
   - 'There is a relation between magic states and the onset of contextuality \cite{arxiv:1401.4174}.'
   - 'Codes can be found via genetic algorithms \cite{arxiv:2409.13017}.'
-  - 'Stim Python software library for simulating and analyzing qubit stabilizer circuits \cite{arxiv:2103.02202,manual:{C. Gidney, Stim, 2021 \href{https://github.com/quantumlib/Stim}{URL}}}.'
-  - 'PanQEC Python software library for simulating and visualizing qubit stabilizer codes \cite{arxiv:2211.02116,manual:{E. Huang and A. Pesah, PanQEC, 2023 \href{https://github.com/panqec/panqec}{URL}}}.'
-  - 'QuantumSavory Julia software library that includes stabilizer formalism tools, symbolic manipulation, and a tool for drawing quantum circuits \cite{manual:{S. Krastanov, QuantumSavory, 2025 \href{https://github.com/QuantumSavory}{URL}},doi:10.5281/zenodo.5208167}.'
+  - 'Stim Python software library for simulating and analyzing qubit stabilizer circuits \cite{arxiv:2103.02202,manual:{C. Gidney, Stim Software Package, 2021 \href{https://github.com/quantumlib/Stim}{URL}}}.'
+  - 'PanQEC Python software library for simulating and visualizing qubit stabilizer codes \cite{arxiv:2211.02116,manual:{E. Huang and A. Pesah, PanQEC Software Package, 2023 \href{https://github.com/panqec/panqec}{URL}}}.'
+  - 'QuantumSavory Julia software library that includes stabilizer formalism tools, symbolic manipulation, and a tool for drawing quantum circuits \cite{manual:{S. Krastanov, QuantumSavory Software Package, 2025 \href{https://github.com/QuantumSavory}{URL}},doi:10.5281/zenodo.5208167}.'
 
 relations:
   parents:
diff --git a/codes/quantum/qudits/stabilizer/fracton/qudit_cubic.yml b/codes/quantum/qudits/stabilizer/fracton/qudit_cubic.yml
@@ -8,7 +8,7 @@ physical: qudits
 logical: qudits
 
 name: 'Qudit cubic code'
-introduced: '\cite{arxiv:1202.0052,manual:{J. Haah, “KITP Conference: Frontiers of Quantum Information Physics, UCSB, Santa Barbara, CA” \href{https://web.archive.org/web/20210515012200/https://online.kitp.ucsb.edu/online/qinfo_c17/haah/}{URL}},arxiv:1709.04460,arxiv:2504.09847}'
+introduced: '\cite{arxiv:1202.0052,manual:{J. Haah, “Two generalizations of the cubic code model”, KITP Conference: Frontiers of Quantum Information Physics, UCSB, Santa Barbara, CA (2017) \href{https://web.archive.org/web/20210515012200/https://online.kitp.ucsb.edu/online/qinfo_c17/haah/}{URL}},arxiv:1709.04460,arxiv:2504.09847}'
 
 description: |
   Generalization of the Haah cubic code to modular qudits.
@@ -24,7 +24,7 @@ relations:
       The qutrit models in \cite[Eqs. (D11-D12)]{arxiv:1908.08049} are likely Type-II, with no string operators found numerically up to width 20, while the \(q=5\) qudit model in \cite[Eq. (D13)]{arxiv:1908.08049} satisfies a proven no-string condition and is Type-II.'
   cousins:
     - code_id: homological_rotor
-      detail: 'The qudit cubic code can be generalized to rotors \cite{manual:{J. Haah, “KITP Conference: Frontiers of Quantum Information Physics, UCSB, Santa Barbara, CA” \href{https://web.archive.org/web/20210515012200/https://online.kitp.ucsb.edu/online/qinfo_c17/haah/}{URL}},arxiv:1709.04460}.'
+      detail: 'The qudit cubic code can be generalized to rotors \cite{manual:{J. Haah, “Two generalizations of the cubic code model”, KITP Conference: Frontiers of Quantum Information Physics, UCSB, Santa Barbara, CA (2017) \href{https://web.archive.org/web/20210515012200/https://online.kitp.ucsb.edu/online/qinfo_c17/haah/}{URL}},arxiv:1709.04460}.'
     - code_id: analog_stabilizer
       detail: 'The qudit cubic code can be generalized to oscillators \cite{arxiv:1709.04460}.'
 
diff --git a/codes/quantum/spins/single_spin/okada.yml b/codes/quantum/spins/single_spin/okada.yml
@@ -13,7 +13,7 @@ description: |
   Non-diagonal \(SU(2)\) single-spin code in the spin-\(J = 3m\) irrep for integer \(m \geq 1\), encoding a logical \((2m+1)\)-dimensional space.
   The construction uses a \textit{non-diagonal} subspace (one for which the projected error space \(P_{\mathcal{B}}\mathcal{E}P_{\mathcal{B}}\) is block-diagonal rather than diagonal) to exceed the dimension bound achievable by the Tverberg theorem construction \cite{arxiv:quant-ph/9908066}.
 
-  The code is defined in terms of a subspace \(\mathcal{B} = \mathrm{span}\{|k, n-k\rangle : k \equiv 0 \text{ or } 1 \pmod{3}\}\) of the spin-\(n/2\) Hilbert space \(\mathcal{H}_n\) (with \(n = 2J = 6m\)), where \(|k, n-k\rangle\) denotes the state with \(k\) particles in the first mode and \(n-k\) in the second \cite[Ex. 7.1]{manual:{I. Shors, “Quantum Error Detection and Lie Theory”, undergraduate thesis, UC Davis Mathematics REU, 2022, \href{https://reu.math.ucdavis.edu/application/files/8316/7872/4883/shors-final.pdf}{URL}}}.
+  The code is defined in terms of a subspace \(\mathcal{B} = \mathrm{span}\{|k, n-k\rangle : k \equiv 0 \text{ or } 1 \pmod{3}\}\) of the spin-\(n/2\) Hilbert space \(\mathcal{H}_n\) (with \(n = 2J = 6m\)), where \(|k, n-k\rangle\) denotes the state with \(k\) particles in the first mode and \(n-k\) in the second \cite[Ex. 7.1]{manual:{I. Shors, “Quantum Error Detection and Lie Theory”, UC Davis Mathematics REU Report, 2022, \href{https://reu.math.ucdavis.edu/application/files/8316/7872/4883/shors-final.pdf}{URL}}}.
   The codespace has dimension \(\dim \mathcal{C} = 2m+1\), which is approximately \((n+1)/3\).
 
   The \(m = 1\) (\(J = 3\)) instance encodes a logical qutrit and admits the unnormalized codewords
diff --git a/codes/quantum/spins/single_spin/single_spin.yml b/codes/quantum/spins/single_spin/single_spin.yml
@@ -28,7 +28,7 @@ features:
   rate: |
     For every \(K,t \geq 2\), there are explicitly constructible \(K\)-dimensional single-spin codes for \(SU(q=N)\) with total spin \(N=(K-1)t(t+1)\) and distance \(t+1\); there also exist families with logical dimension \(K = o(2^N)\) and distance of \hyperref[topic:asymptotics]{order} \(o(N/\log N)\) \cite{arxiv:2509.20545}.
 
-    For the spin-\(n/2\) irrep of \(\mathfrak{su}(2)\), the Tverberg theorem construction \cite{arxiv:quant-ph/9908066} yields a distance-1 error-detecting code of dimension \(\lceil (n+1)/4 \rceil\) against the \(\mathfrak{su}(2)\) Lie algebra error set \(\{E, F, H\}\) \cite{arxiv:1205.4517}\cite[Ex. 6.3]{manual:{I. Shors, “Quantum Error Detection and Lie Theory”, undergraduate thesis, UC Davis Mathematics REU, 2022, \href{https://reu.math.ucdavis.edu/application/files/8316/7872/4883/shors-final.pdf}{URL}}}.
+    For the spin-\(n/2\) irrep of \(\mathfrak{su}(2)\), the Tverberg theorem construction \cite{arxiv:quant-ph/9908066} yields a distance-1 error-detecting code of dimension \(\lceil (n+1)/4 \rceil\) against the \(\mathfrak{su}(2)\) Lie algebra error set \(\{E, F, H\}\) \cite{arxiv:1205.4517}\cite[Ex. 6.3]{manual:{I. Shors, “Quantum Error Detection and Lie Theory”, UC Davis Mathematics REU Report, 2022, \href{https://reu.math.ucdavis.edu/application/files/8316/7872/4883/shors-final.pdf}{URL}}}.
 
 
 relations:
diff --git a/codes/quantum/spins/single_spin/su3_tverberg_spin.yml b/codes/quantum/spins/single_spin/su3_tverberg_spin.yml
