CRAWLER

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

Author: Tamara

codes/classical/bits/nonlinear/gray_map/duals/hergert.yml

@@ -21,7 +21,7 @@ description: |
 
 features:
   decoders:
-    - 'Since the equivalent \(\mathbb{Z}_4\) codes are extended cyclic codes, efficient encoding and decoding is possible. \cite{arxiv:math/0207208,doi:10.1109/18.476333}.'
+    - 'Since the equivalent \(\mathbb{Z}_4\) codes are extended cyclic codes, efficient encoding and decoding is possible \cite{arxiv:math/0207208,doi:10.1109/18.476333}.'
 
 
 relations:

codes/classical/q-ary_digits/distributed_storage/q-ary_lcc.yml

@@ -17,6 +17,7 @@ relations:
   parents:
     - code_id: q-ary_linear
     - code_id: lcc
+  cousins:
     - code_id: ldc
       detail: 'Linear LCCs can be converted into LDCs with the same locality \(r\) \cite[Sec. 2.4.1]{preset:Gopi18}.'
 

codes/quantum/qudits/qudits_into_qudits.yml

@@ -15,7 +15,7 @@ alternative_names:
   - 'Modular-qudit subspace code'
 
 description: |
-  Encodes \(K\)-dimensional Hilbert space into a \(q^n\)-dimensional (\(n\)-qudit) Hilbert space, with canonical qudit states \(|k\rangle\) labeled by elements \(k\) of the group \(\mathbb{Z}_q\) of integers \textit{modulo} \(q\).
+  Encodes a \(K\)-dimensional Hilbert space into a \(q^n\)-dimensional (\(n\)-qudit) Hilbert space, with canonical qudit states \(|k\rangle\) labeled by elements \(k\) of the group \(\mathbb{Z}_q\) of integers \textit{modulo} \(q\).
   Usually denoted as \(((n,K))_{\mathbb{Z}_q}\) or \(((n,K,d))_{\mathbb{Z}_q}\), whenever the code's distance \(d\) is defined, and with \(q=p\) when the dimension is prime.
 
   There exists an analogue of the Wigner function for modular qudits \cite{arxiv:quant-ph/0401155,arxiv:quant-ph/0410117,arxiv:2503.09353}.
@@ -48,7 +48,7 @@ features:
   rate: 'Non-stabilizer states yield higher quantum capacity of the discrete beamsplitter channel \cite{arxiv:2401.12105}.'
   general_gates:
     - 'The normalizer of the \hyperref[topic:qudit-pauli]{modular-qudit Pauli group} is the \textit{modular-qudit Clifford group} \cite{arxiv:quant-ph/9802007,arxiv:quant-ph/0412001,arxiv:quant-ph/0408190,arxiv:quant-ph/0512155,arxiv:quant-ph/0605094,doi:10.1088/1751-8113/43/4/042001,arxiv:1101.1519,arxiv:1102.3354,arxiv:2008.00959}.
-    There is a standard form for modular-qudit Clifford-group operators \cite[Lemma 4]{arxiv:quant-ph/0412001}, and any modular-qudit gate can be constructed from phase-shift and quantum Fourier transform gates \cite{arxiv:1307.5087}.
+    There is a standard form for modular-qudit Clifford-group operators \cite[Lemma 4]{arxiv:quant-ph/0412001}, and any modular-qudit Clifford gate can be constructed from phase-shift and quantum Fourier transform gates \cite{arxiv:1307.5087}.
     Universal computing can be achieved using qudit Clifford gates and a single type of non-Clifford gate, such as the \(T\) gate \cite{arxiv:1503.08800}.
     Non-Clifford gates are typically more difficult to implement than Clifford gates and so are treated as a resource.
     There is a normal form for Clifford+\(T\) operators for qutrits \cite{arxiv:1803.03228} and, more generally, odd prime qudits \cite{arxiv:2011.07970}.