\([[18,2,5]]\) BCC code[1]
Description
BCC code on 18 qubits encoding 2 logical qubits with distance 5, found by computer search [1].
The code is defined by \(\mathcal{S}=\{5,11,15,17\}\) in the BCC code framework, with even qubits \((0,2,\ldots,16)\) forming the \(A\)-sublattice and odd qubits \((1,3,\ldots,17)\) forming the \(B\)-sublattice. The subset \(\{5,11,17\}\subset\mathcal{S}\) is closed under adding 6 (mod 18), so the conjugated stabilizer \(UX_0X_6U^\dagger\) has large cancellations, yielding weight-4 stabilizers \(X_{-3}X_0X_3X_6\) and its cyclic shifts by even integers (and likewise with \(X\to Z\)).
A stabilizer tableau for the code is \begin{align} \begin{smallmatrix} X & X & X & I & I & X & I & X & I & I & I & X & I & X & I & X & I & I \\ I & I & X & X & X & I & I & X & I & X & I & I & I & X & I & X & I & X \\ I & X & I & I & X & X & X & I & I & X & I & X & I & I & I & X & I & X \\ I & X & I & X & I & I & X & X & X & I & I & X & I & X & I & I & I & X \\ I & X & I & X & I & X & I & I & X & X & X & I & I & X & I & X & I & I \\ I & I & I & X & I & X & I & X & I & I & X & X & X & I & I & X & I & X \\ I & X & I & I & I & X & I & X & I & X & I & I & X & X & X & I & I & X \\ I & X & I & X & I & I & I & X & I & X & I & X & I & I & X & X & X & I \\ I & Z & Z & Z & I & I & Z & I & Z & I & Z & I & I & I & Z & I & Z & I \\ Z & I & I & Z & Z & Z & I & I & Z & I & Z & I & Z & I & I & I & Z & I \\ Z & I & Z & I & I & Z & Z & Z & I & I & Z & I & Z & I & Z & I & I & I \\ I & I & Z & I & Z & I & I & Z & Z & Z & I & I & Z & I & Z & I & Z & I \\ Z & I & I & I & Z & I & Z & I & I & Z & Z & Z & I & I & Z & I & Z & I \\ Z & I & Z & I & I & I & Z & I & Z & I & I & Z & Z & Z & I & I & Z & I \\ Z & I & Z & I & Z & I & I & I & Z & I & Z & I & I & Z & Z & Z & I & I \\ I & I & Z & I & Z & I & Z & I & I & I & Z & I & Z & I & I & Z & Z & Z \end{smallmatrix}~. \tag*{(1)}\end{align}
Transversal Gates
Transversal Hadamard-SWAP logical gate (inherited from BCC code structure) [1].Logical Hadamard without SWAP: the code is self-dual, so transversal physical Hadamard implements logical \(H^{\otimes 2}\) [1].Decoding
An ancilla syndrome extraction scheme with 18 shared ancilla qubits (one per data qubit position across two code blocks) detects all single bit-flip errors; a further reduction to 9 entangled ancilla qubits is numerically shown to preserve fault tolerance to distance 5 [1].Fault Tolerance
An ancilla syndrome extraction scheme with 18 shared ancilla qubits (one per data qubit position across two code blocks) detects all single bit-flip errors; a further reduction to 9 entangled ancilla qubits is numerically shown to preserve fault tolerance to distance 5 [1].Member of code lists
- Cyclic quantum codes
- Lattice qubit stabilizer codes
- Quantum codes
- Quantum codes based on homological products
- Quantum codes with fault-tolerant gadgets
- Quantum codes with notable decoders
- Quantum codes with transversal or permutation-based gates
- Quantum LDPC codes
- Qubit CSS codes
- Small-distance qubit stabilizer codes and friends
Primary Hierarchy
References
- [1]
- M. B. Hastings, “A Class of Cyclic Quantum Codes”, (2025) arXiv:2509.06865
Page edit log
- Victor V. Albert (2026-05-26) — most recent
Cite as:
“\([[18,2,5]]\) BCC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/stab_18_2_5