lint

Author: valbert4

code_extra/bib_preset.yml

@@ -700,3 +700,15 @@ albertPC25:
   _ready_formatted:
     flm: >-
       V. V. Albert, private communication, 2025
+
+# --- auto-promoted from manual citations ---
+
+AlbertPC26:
+  _ready_formatted:
+    flm: >-
+      V. V. Albert, private communication, 2026
+
+KnillPC98:
+  _ready_formatted:
+    flm: >-
+      E. Knill, private communication, ca. 1998

codes/classical/matrices/unitary/clifford_group.yml

@@ -51,7 +51,7 @@ relations:
       detail: 'Stabilizer states on \(n\) qubits form 3-designs on complex projective spaces \(\mathbb{C}P^{2^n}\) \cite{arxiv:1510.02767}. The \hyperref[topic:clifford]{Clifford group} is a unitary 2-design \cite{arxiv:quant-ph/0103098} and a 3-design \cite[Thm. 1.6(B)]{arxiv:math/0502080}\cite[pg. 191]{doi:10.1007/3-540-30731-1}\cite{arxiv:1510.02619,arxiv:1510.02769} on \(U(2^n)\). The \([[2m,2m-2,2]]\) code when \(2m\) is a multiple of four obstructs the Clifford group from being a 4-design \cite{arxiv:1609.08172}.'
   cousins:
     - code_id: qubit_stabilizer
-      detail: 'Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,manual:{E. Knill, private communication, ca. 1998}}. Stabilizer states can be mapped into the first lattice shell of a BW lattice over a cyclotomic field, while the \hyperref[topic:clifford]{Clifford group} is related to the symmetry group of the lattice \cite{arxiv:2404.17677}.'
+      detail: 'Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,preset:KnillPC98}. Stabilizer states can be mapped into the first lattice shell of a BW lattice over a cyclotomic field, while the \hyperref[topic:clifford]{Clifford group} is related to the symmetry group of the lattice \cite{arxiv:2404.17677}.'
     - code_id: kerdock
       detail: 'Kerdock codes correspond to cluster states, and the corresponding Clifford-group automorphisms of this set form a particular group \cite{doi:10.1112/S0024611597000403} that is a unitary 2-design on \(U(2^n)\) \cite{arxiv:1904.07842}. As such, cluster states form complex projective 2-designs on \(\mathbb{C}P^{2^n}\). These are useful in matrix-vector multiplication \cite{arxiv:2105.05879}.'
     - code_id: cluster_state

codes/classical/q-ary_digits/ag/reed_solomon/generalized_reed_solomon.yml

@@ -12,7 +12,7 @@ short_name: 'GRS'
 #introduced: '\cite{preset:MacSlo}'
 
 description: |
-  An \([n,k,n-k+1]_q\) linear code that is a modification of the RS code where codeword polynomials are multiplied by additional prefactors \cite[Def. 15.3.19]{preset:HKSag}.
+  An \([n,k,n-k+1]_q\) MDS code that is a modification of the RS code where codeword polynomials are multiplied by additional prefactors \cite[Def. 15.3.19]{preset:HKSag}.
 
   Each message \(\mu\) is encoded into a string of values of the corresponding polynomial \(f_\mu\) at the points \(\alpha_i\), multiplied by a corresponding nonzero factor \(v_i \in \mathbb{F}_q\),
   \begin{align}

codes/classical/q-ary_digits/poset/poset.yml

@@ -26,10 +26,9 @@ notes:
     - 'See book \cite{doi:10.1007/978-3-319-93821-9} for more details.'
 
 
-# Codewords are q-ary strings, so q-ary primary parent
+# Distance metric is not Hamming, so no Hamming parent. Makes more sense since poset metric is a special case of the metric on symmetric spaces.
 relations:
   parents:
-    - code_id: q-ary_digits_into_q-ary_digits
     - code_id: symmetric_space
       detail: 'Ordered Hamming space can be viewed as a finite symmetric space \cite{doi:10.4153/CJM-1999-017-5,arxiv:cs/0702033}\cite[Sec. 4.2.3]{arxiv:0909.4767}\cite[Table 3]{arxiv:1007.2905}.'
   cousins:

codes/quantum/oscillators/fock_state/matrix_qm.yml

@@ -32,8 +32,6 @@ relations:
   parents:
     - code_id: fock_state
       detail: 'Matrix-model logical states lie in a low-energy Fock-state subspace.'
-    - code_id: approximate_qecc
-      detail: 'Matrix-model codes approximately protect against gauge-invariant errors in the large-mode limit.'
     - code_id: hamiltonian
       detail: 'Matrix-model codewords for simple codes are eigenstates of a matrix-model Hamiltonian.'
     - code_id: holographic

codes/quantum/qubits/qubits_into_qubits.yml

@@ -127,7 +127,7 @@ features:
     - 'If a qubit code \(Q\) of length \(n\) has compact subgroups \(N\triangleleft G\leq \mathrm{Aut}(Q)\) such that \(G/N\) is finite, non-Abelian, simple, and not \(A_5\), then \(n\) is at least the minimal permutation degree \(\mu(G/N)\) \cite[Thm. 1]{arxiv:2604.15111}.'
   general_gates:
     - |
-      Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,manual:{E. Knill, private communication, ca. 1998}}.
+      Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,preset:KnillPC98}.
       There is a canonical form for \hyperref[topic:clifford]{Clifford circuits} \cite{arxiv:2003.09412,arxiv:2408.15202} and many algorithms for simulating them \cite{arxiv:quant-ph/0406196,arxiv:1712.03554,arxiv:2301.02356}.
       Universal quantum computing can be achieved using \hyperref[topic:clifford]{Clifford gates} and a single type of \hyperref[topic:clifford]{non-Clifford} gate, such as the \(T\) gate \cite{arxiv:quant-ph/9503016}.
       More generally, the \textit{Solovay-Kitaev} theorem \cite{doi:10.1070/RM1997v052n06ABEH002155,doi:10.1090/gsm/047} states that any subset of gates that generates a dense subgroup of the full \(n\)-qubit gate group can be used to construct any gate to arbitrary accuracy (see \cite{arxiv:quant-ph/0505030}\cite[Appx. 3]{doi:10.1017/cbo9780511976667.019}). The task of approximating a desired gate by \hyperref[topic:clifford]{Clifford gates} and a fixed set of \hyperref[topic:clifford]{non-Clifford} gates is called \textit{gate compilation} or \textit{circuit synthesis}.
@@ -208,7 +208,7 @@ relations:
     # Stabilizer part also in clifford_group
     - code_id: clifford_group
       detail: |
-        Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,manual:{E. Knill, private communication, ca. 1998}}.
+        Computing with \hyperref[topic:clifford]{Clifford gates}, Pauli measurements, and classical feedforward acting on stabilizer states only can be efficiently simulated on a classical computer by tracking stabilizer and logical generators, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,preset:KnillPC98}.
         There is a canonical form for \hyperref[topic:clifford]{Clifford circuits} \cite{arxiv:2003.09412,arxiv:2408.15202} and many algorithms for simulating them \cite{arxiv:quant-ph/0406196,arxiv:1712.03554,arxiv:2301.02356}.
         Universal quantum computing can be achieved using \hyperref[topic:clifford]{Clifford gates} and a single type of \hyperref[topic:clifford]{non-Clifford} gate, such as the \(T\) gate \cite{arxiv:quant-ph/9503016}.
         More generally, the \textit{Solovay-Kitaev} theorem \cite{doi:10.1070/RM1997v052n06ABEH002155,doi:10.1090/gsm/047} states that any subset of gates that generates a dense subgroup of the full \(n\)-qubit gate group can be used to construct any gate to arbitrary accuracy (see \cite{arxiv:quant-ph/0505030}\cite[Appx. 3]{doi:10.1017/cbo9780511976667.019}). The task of approximating a desired gate by \hyperref[topic:clifford]{Clifford gates} and a fixed set of \hyperref[topic:clifford]{non-Clifford} gates is called \textit{gate compilation} or \textit{circuit synthesis}.

codes/quantum/qubits/small_distance/small/10/stab_10_1_2.yml

@@ -13,7 +13,7 @@ introduced: '\cite{arxiv:2112.01446}'
 # based on qiskit database brute force search
 description: |
   A stabilizer code obtained by morphing the \([[15,1,3]]\) quantum Reed-Muller code on a subset whose child code is the \([[8,3,2]]\) smallest interesting color code \cite{arxiv:2112.01446}.
-   This is the smallest code that implements a fault-tolerant logical \(T\) gate using a diagonal depth-one Clifford circuit \cite{manual:{V. V. Albert, private communication, 2026}}.
+   This is the smallest code that implements a fault-tolerant logical \(T\) gate using a diagonal depth-one Clifford circuit \cite{preset:AlbertPC26}.
    It is the smallest known stabilizer code with a fault-tolerant logical \(T\) gate, implemented via physical \(T\), \(T^{\dagger}\), and \(CCZ\) gates \cite{arxiv:2112.01446}.
 
   A stabilizer tableau for the code is \cite{arxiv:2403.13732}

codes/quantum/qubits/small_distance/small/12/carbon.yml

@@ -54,8 +54,6 @@ relations:
   parents:
     - code_id: bc_phantom
       detail: 'The carbon code is the B\&C phantom code obtained from the \([[3,1,2]]_4\) Galois-qudit code \cite{arxiv:2601.20927}.'
-    - code_id: qubit_concatenated
-      detail: 'The \([[12,2,4]]\) carbon code is based on Knill''s \(C_4/C_6\) scheme \cite{arxiv:2404.02280}. Using the concatenation convention presented here, it is a block concatenation with inner code \([[4,2,2]]\) and outer code \(C_6\).'
     - code_id: small_distance_qubit_stabilizer
   cousins:
     - code_id: stab_4_2_2

codes/quantum/qubits/small_distance/small/5/stab_5_1_2/stab_5_1_2.yml

@@ -11,7 +11,7 @@ name: '\([[5,1,2]]\) rotated surface code'
 
 # based on qiskit database brute force search
 description: |
-  A rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it. This is the smallest code that implements a fault-tolerant logical \(S\) gate using a diagonal depth-one Clifford circuit \cite{manual:{V. V. Albert, private communication, 2026}}.
+  A rotated surface code on one rung of a ladder, with one qubit on the rung, and four qubits surrounding it. This is the smallest code that implements a fault-tolerant logical \(S\) gate using a diagonal depth-one Clifford circuit \cite{preset:AlbertPC26}.
 
   A stabilizer tableau for the code is given by \cite[ID 18]{preset:qiskit}
   \begin{align}

codes/quantum/qubits/small_distance/small/7/qetc_7_2.yml

@@ -32,7 +32,7 @@ relations:
     - code_id: qetc
   cousins:
     - code_id: bare_7_1_3
-      detail: 'The stabilizer group of the \([[7,2,2]]\) QETC, together with the logical-\(Z\) operator on the first logical qubit, generates the stabilizer group of a \([[7,1,3]]\) code \cite{arxiv:2310.10278} equivalent to the bare \([[7,1,3]]\) code \cite{manual:{V. V. Albert, private communication, 2026}}.'
+      detail: 'The stabilizer group of the \([[7,2,2]]\) QETC, together with the logical-\(Z\) operator on the first logical qubit, generates the stabilizer group of a \([[7,1,3]]\) code \cite{arxiv:2310.10278} equivalent to the bare \([[7,1,3]]\) code \cite{preset:AlbertPC26}.'
 
 
 # Begin Entry Meta Information