~

codes/quantum/oscillators/fock_state/constant_excitation/two-mode_binomial.yml

@@ -26,7 +26,7 @@ description: |
     |\overline{\mu}\rangle=\frac{1}{2^{J}}\sum_{m=0}^{2J}\left(-1\right)^{\mu m}\sqrt{{2J \choose m}}\left|2J-(S+1)m,(S+1)m\right\rangle~,
   \end{align}
   with spacing \(S\) and dephasing error parameter \(N\) such that \(J = \frac{1}{2}(N+1)(S+1)\) \cite{arXiv:1602.00008}.
-  The \(S=0\) version can be obtained by applying a \(50:50\) beamsplitter to the highest-weight Fock state \(|2J,0\rangle\) \cite{arxiv:1512.07605}.
+  The \(S=0\) version can be obtained by applying a \(50:50\) beamsplitter to the highest-weight Fock states \(|2J,0\rangle\) and \(|0,2J\rangle\) \cite{arxiv:1512.07605}.
 
 
 relations:

codes/quantum/qubits/stabilizer/qubit_stabilizer.yml

@@ -157,7 +157,7 @@ relations:
       detail: 'Qubit stabilizer codes are the closest quantum analogues of binary linear codes because addition modulo two corresponds to multiplication of stabilizers in the quantum case.
       Any binary linear code can be thought of as a qubit stabilizer code with \(Z\)-type stabilizer generators \cite[Table I]{arxiv:quant-ph/0610088}.
       The stabilizer generators are extracted from rows of the parity-check matrix, while logical \(X\) Paulis correspond to rows of the generator matrix.
-      States close to the equal superposition of all codewords of a binary linear code can be prepared efficiently \cite{arxiv:2404.16129}.'
+      States close to the equal superposition of all bit strings within Hamming distance \(b\) of a binary linear code can be prepared efficiently \cite{arxiv:2404.16129}.'
     - code_id: dual
       detail: 'Qubit stabilizer codes are in one-to-one correspondence with symplectic self-orthogonal binary linear codes of length \(2n\) via the \hyperref[topic:binary-symplectic-representation]{binary symplectic representation}.'
     - code_id: dual_additive