refs

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

@@ -44,6 +44,7 @@ features:
 notes:
   - 'The two extreme examples of codes are the \([n,0,n]_q\) \textit{zero code} and its dual the \([n,n,1]_q\) \textit{universe code}.'
   - 'University of Salzburg''s \href{https://mint.sbg.ac.at/table.php?i=c}{MinT application} generates an optimal parameter table for a linear code \([n,k,d]_q\), contingent on an optional fluctuation of maximal Hamming code distance, rank, and length, along with other specifications.'
+  - 'Julia \href{https://github.com/esabo/CodingTheory}{CodingTheory} framework by E. Sabo.'
 
 relations:
   parents:

codes/quantum/qubits/stabilizer/qldpc/homological/balanced_product/lp/gross.yml

@@ -15,7 +15,8 @@ alternative_names:
   # \cite{arxiv:2410.11942}
 
 description: |
-  A BB QLDPC code which requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance.
+  A BB code which requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance.
+  The gross code is equivalent to 8 copies of the surface code via a constant-depth Clifford circuit, and is an element of a larger family of 2D stabilizer codes \cite{arxiv:2410.11942}.
   The name stems from the fact that a gross is a dozen dozen.
 
   A different BB QLDPC code with the same parameters was introduced in \cite{arxiv:2407.16336}.
@@ -37,9 +38,11 @@ features:
 relations:
     parents:
       - code_id: qcga
+      - code_id: 2d_stabilizer
+        detail: 'The gross code is equivalent to 8 copies of the surface code via a constant-depth Clifford circuit, and is an element of a larger family of 2D stabilizer codes \cite{arxiv:2410.11942}.'
     cousins:
       - code_id: surface
-        detail: 'The gross code requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance. Boundary operators on the gross code correspond to anyons of 8 copies of the surface code \cite{arxiv:2410.11942}. An architecture combining the surface and gross codes was proposed in \cite{arxiv:2411.03202}.'
+        detail: 'The gross code requires less physical and ancilla qubits (for syndrome extraction) than the surface code with the same number of logical qubits and distance. The gross code is equivalent to 8 copies of the surface code via a constant-depth Clifford circuit, and is an element of a larger family of 2D stabilizer codes \cite{arxiv:2410.11942}. An architecture combining the surface and gross codes was proposed in \cite{arxiv:2411.03202}.'
 
 
 # Begin Entry Meta Information

codes/quantum/qudits_galois/galois_into_galois.yml

@@ -52,7 +52,8 @@ features:
 notes:
   - 'Introduction to Galois qudits by \href{https://ethz.ch/content/vp/en/conferences/2014/qec/05_thursday/dab6ca18-7453-4197-aaaa-8b1964ece714.html}{Gottesman}.'
   - 'Wigner function for Galois qudits \cite{arxiv:quant-ph/0401155}.'
-
+  - 'Julia \href{https://github.com/esabo/CodingTheory}{CodingTheory} framework by E. Sabo.'
+
 relations:
   parents:
     - code_id: block_quantum