refs/corr

codes/classical/properties/block/block.yml

@@ -19,7 +19,7 @@ description: |
 
   \begin{defterm}{Asymptotic notation}
   \label{topic:asymptotics}
-  We are often interested in how parameters of particular infinite block-code families scale with increasing block length \(n\), necessitating the use of asymptotic or Bachmann–Landau notation. The table below summarizes the notation used throughout the EC Zoo for relating functions \(f,g\) that both grow with \(n\).
+  We are often interested in how parameters of particular infinite block-code families scale with increasing block length \(n\), necessitating the use of asymptotic or Bachmann–Landau notation; see the book \cite{manual:{Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms. MIT press.}}. The table below summarizes the notation used throughout the EC Zoo for relating functions \(f,g\) that both grow with \(n\).
   \begin{table}
     \begin{cells}
     \celldata<c H, c H>{relation & behavior}

codes/quantum/qubits/qubits_into_qubits.yml

@@ -92,7 +92,7 @@ features:
   transversal_gates:
     - 'A qubit code is \(U\)-\textit{quasi-transversal} if it can realize the logical gate \(U\) in the third level of the \term{Clifford hierarchy} using the physical gate \(C T^{\otimes n}\), where \(C\) is some Clifford gate \cite[Def. 4]{arxiv:1606.01904}.'
   general_gates:
-    - 'The normalizer of the \hyperref[topic:complementary-channel]{Pauli group} is the Clifford group; see Ref. \cite{arxiv:1310.6813} for generators, relations, and normal form. The Clifford group permutes Pauli operators amongst themselves, and, up to any phases, is equivalent to the symplectic group \(Sp(2n,\mathbb{Z}_2)\).
+    - 'The normalizer of the \hyperref[topic:complementary-channel]{Pauli group} is the Clifford group; see Refs. \cite{arxiv:quant-ph/0304125,arxiv:0811.0898,arxiv:1310.6813} for generators, relations, and normal form. The Clifford group permutes Pauli operators amongst themselves, and, up to any phases, is equivalent to the symplectic group \(Sp(2n,\mathbb{Z}_2)\).
     The combined Pauli and Clifford group cannot be expressed as a semidirect product of those two constituents \cite{arxiv:2406.09951}.'
     - 'Computing using Clifford gates only can be efficiently simulated on a classical computer, according to the \textit{Gottesman-Knill theorem} \cite{arxiv:quant-ph/9807006,manual:{E. Knill, private communication, ca. 1998.}}.
     Universal quantum computing can be achieved using Clifford gates and a single type of non-Clifford gate, such as the \(T\) gate \cite{arxiv:quant-ph/9503016}.

codes/quantum/qubits/stabilizer/hermitian/stabilizer_over_gf4.yml

@@ -38,8 +38,8 @@ protection: |
 
 features:
   transversal_gates:
-    - 'Transversal \(SH\) gates \cite[Sec. 8.2]{arxiv:quant-ph/9703048}.'
-    - 'The three-block transversal gate mapping each \(X \to XYZ\) and each \(Z \to ZXY\) implements a logical gate \cite{arxiv:quant-ph/9702029}\cite[Exam. 2]{arxiv:quant-ph/9703048}.'
+    - 'Transversal \(SH\) gates \cite[Sec. 8.2]{arxiv:quant-ph/9705052}.'
+    - 'The three-block transversal gate mapping each physical \(X \to XYZ\) and each \(Z \to ZXY\) implements a logical gate \cite{arxiv:quant-ph/9702029}\cite[Exam. 2]{arxiv:quant-ph/9703048}.'
 
   fault_tolerance:
     - 'Characterizing fault-tolerant multi-qubit gates under the \hyperref[topic:gf4-representation]{\(GF(4)\) representation} may involve characterizing all global automorphisms of some number of copies of a code that preserve the symplectic inner product \cite[pg. 9]{arxiv:quant-ph/9703048}.'