~

code_extra/override_arxiv_dois.yml

@@ -11,10 +11,10 @@
 '1604.04062': '10.26421/QIC16.15-16-1'
 '1411.3334': '10.1109/TIT.2017.2663199'
 '1907.01393': '10.1109/JSAC.2020.2968997'
-'2412.02442': null
 
 # In this case, the DOI listed on Quantum's own webpage
 # (https://quantum-journal.org/papers/q-2021-12-20-605/) does not work!  So
 # let's pretend that there is no associated DOI so that, at least, we get an
 # arXiv citation.
 #  '2108.10457': null
+# '2412.02442': null

codes/quantum/groups/topological/quantum_double.yml

@@ -47,6 +47,10 @@ features:
   decoders:
     - 'For any solvable group \(G\), topological charge measurements can be done with an adaptive constant-depth circuit with geometrically local gates and measurements throughout \cite{arxiv:2205.01933}.'
 
+  code_capacity_threshold:
+    - 'Behavior under particular \(X\)-type noise (namely, diffusion of an anyon that squares to the trivial anyon) is related to the phase diagram of a disordered \(D_4\) rotor model \cite{arxiv:2409.12230,arxiv:2409.12948}.'
+
+
 notes:
   - 'See Ref. \cite{doi:10.1103/RevModPhys.51.659} for a review of gauge theory, which admits quantum-double topological phases.'
 

codes/quantum/groups/topological/quantum_double_dihedral.yml

@@ -21,7 +21,7 @@ features:
     - 'Universal topological quantum computation is possible for certain groups such as \(G=D_3=S_3\) \cite{arxiv:quant-ph/0306063,arxiv:0901.1345}.'
     - '\(U\)-model gate set \cite{arxiv:1401.7096}, which can protect from circuit-level noise with the help of an anyon interferometer for the case of \(G=S_3\) \cite{arxiv:2411.09697}.'
   code_capacity_threshold:
-    - 'The threshold under ML decoding for the \(G=D_4\) quantum double corresponds to the value of a critical point of a disordered \(D_4\) rotor model \cite{arxiv:2409.12230,arxiv:2409.12948}.'
+    - 'Behavior under \(X\)-type noise (namely, diffusion of certain anyons) for the \(G=D_4\) case is related to the phase diagram of a disordered net model \cite{arxiv:2409.12948}.'
 
   fault_tolerance:
     - 'Universal topological quantum computation is possible for certain groups such as \(G=D_3=S_3\) \cite{arxiv:quant-ph/0306063,arxiv:0901.1345}.'

codes/quantum/oscillators/stabilizer/hybrid/homological_cv.yml

@@ -11,10 +11,10 @@ name: 'Integer-homology bosonic CSS code'
 introduced: '\cite{arxiv:2411.04993}'
 
 description: |
-  An oscillator stabilizer code whose physical modes have been restricted, via a single GKP stabilizer, from the space of function on the real line to the space of periodic functions.
-  This restriction effectively realizes a rotor on each physical mode, allowing one to construct homological rotor codes out of continuous displacement stabilizer groups.
-  The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension.
+  An oscillator stabilizer code whose physical modes have been restricted, via a single GKP stabilizer, from the space of functions on the real line to the space of periodic functions.
+  This restriction effectively realizes a rotor on each physical mode, allowing one to construct homological rotor codes out of displacement stabilizer groups.
   The stabilizer group is continuous, but contains discrete components in the form of the single-mode GKP stabilizers.
+  The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension.
 
 
 relations:
@@ -25,7 +25,7 @@ relations:
       detail: 'Integer-homology bosonic CSS codes are constructed from chain complexes over the integers and realize homological rotor codes out of continuous displacement stabilizer groups. The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension.'
   cousins:
     - code_id: homological_rotor
-      detail: 'Integer-homology bosonic CSS codes are constructed from chain complexes over the integers and realize homological rotor codes out of continuous displacement stabilizer groups.'
+      detail: 'Integer-homology bosonic CSS codes are constructed from chain complexes over the integers and realize homological rotor codes out of continuous displacement stabilizer groups \cite{arXiv:2411.04993}.'
 
 
 _meta:

codes/quantum/oscillators/stabilizer/hyperplane/analog_surface.yml

@@ -30,10 +30,9 @@ relations:
     - code_id: 2d_stabilizer
   cousins:
     - code_id: qudit_surface
-      detail: 'The analog surface code realizes a straightforward extension of the modular-qudit surface code to infinite local dimension, \(q\to\infty\).
-      There are two types of anyons, \(e\) and \(m\), with each type being valued in a continuous domain as opposed to \(\mathbb{Z}_q\) for the qudit surface code.'
+      detail: 'The analog surface code realizes a straightforward extension of the modular-qudit surface code to infinite local dimension, \(q\to\infty\) \cite{arxiv:1709.04460}.'
     - code_id: topological_abelian
-      detail: 'The analog surface code realizes a straightforward extension of the modular-qudit surface code to infinite local dimension, \(q\to\infty\).
+      detail: 'The analog surface code realizes a straightforward extension of the modular-qudit surface code to infinite local dimension, \(q\to\infty\) \cite{arxiv:1709.04460}.
       The code realizes a phase of 2D \(\mathbb{R}\) gauge theory.
       There are two types of anyons, \(e\) and \(m\), with each type being valued in a continuous domain as opposed to \(\mathbb{Z}_q\) for the qudit surface code.'
 

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

@@ -38,9 +38,9 @@ features:
 relations:
     parents:
       - code_id: qcga
+    cousins:
       - 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. 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}.'