refs

codes/quantum/oscillators/stabilizer/lattice/gkp-cluster-state.yml

@@ -29,7 +29,8 @@ features:
   decoders:
     - 'GKP error correction can be naturally combined with CV MBQC protocols since the performance of both is quantified by a squeezing parameter \cite{arxiv:1310.7596}.'
   threshold:
-    - 'A lower bound on the squeezing required to obtain a particular error rate can be formulated in terms of the displacement noise strength. This in turn determines how much squeezing is required in order to be below threshold for a particular concatenated code. A threshold of \(10^{-6}\) yields a required squeezing of 20.5 dB \cite{arxiv:1310.7596}. Anti-squeezing does not affect the threshold \cite{arxiv:1903.02162}.'
+    - 'A lower bound on the squeezing required to obtain a particular error rate can be formulated in terms of the displacement noise strength. This in turn determines how much squeezing is required in order to be below threshold for a particular concatenated code. A threshold of \(10^{-6}\) yields a required squeezing of 20.5 dB \cite{arxiv:1310.7596}. Anti-squeezing does not affect the threshold \cite{arxiv:1903.02162}. The calculation has been generalized to various Markovian noise \cite{arxiv:2410.12365}.'
+
 
 relations:
   parents:

codes/quantum/properties/qecc_finite.yml

@@ -36,7 +36,7 @@ protection: |
   where the \textit{QEC matrix} elements \(c_{ij}\) are arbitrary complex numbers.  
   \end{defterm}
   
-  The Knill-Laflamme conditions can alternatively be expressed in terms of the \hyperref[topic:complementary-channel]{complementary channel}, or in an information-theoretic way via a data processing inequality \cite{arxiv:quant-ph/9604022,arxiv:quant-ph/9702031}\cite[Eq. (29)]{arxiv:quant-ph/9604034}.
+  The Knill-Laflamme conditions can alternatively be expressed in terms of the \hyperref[topic:complementary-channel]{complementary channel}, or in an information-theoretic way via a data processing inequality \cite{arxiv:quant-ph/9604022,arxiv:quant-ph/9702031,arxiv:quant-ph/9604034}.
   They motivate higher-rank numerical ranges, which are generalizations of the numerical range of an operator \cite{arxiv:quant-ph/0511101,arXiv:math/0511278}.
   They have been extended to sequences of multiple errors and rounds of correction \cite{arxiv:2405.17567}.
 

codes/quantum/properties/stabilizer/lattice/2d_stabilizer.yml

@@ -14,6 +14,7 @@ description: |
   Any prime-qudit code can be converted to several copies of the prime-qudit 2D surface code (i.e., \(\mathbb{Z}_2\) topological order) along with some trivial codes \cite{arxiv:1812.11193}.
   Any 2D topological order requires weight-four Hamiltonian terms, i.e., it cannot be stabilized via weight-two or weight-three terms on 2D lattices of qubits or qutrits \cite{arxiv:quant-ph/0308021,arxiv:1102.0770,arxiv:1803.02213}.
 
+  There is a numerical procedure to construct all possible boundaries and twist defects associated with a given lattice code that admits a particular topological phase \cite{arxiv:2410.11942}.
 
 features:
   decoders:

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

@@ -10,6 +10,10 @@ logical: qubits
 name: '\([[144,12,12]]\) gross code'
 introduced: '\cite{arxiv:2308.07915}'
 
+alternative_names:
+  - '\((3,3)\) BB code'
+  # \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.
   The name stems from the fact that a gross is a dozen dozen.
@@ -33,6 +37,10 @@ features:
 relations:
     parents:
       - code_id: qcga
+    cousins:
+      - code_id: 2d_stabilizer
+        detail: 'Boundary operators on the gross code correspond to anyons of 8 copies of the surface code \cite{arxiv:2410.11942}.'
+
 
 
 # Begin Entry Meta Information