\([[6,2,3,2]]\) BBS code [1]
Description
Error-detecting six-qubit BBS subsystem code with parameters \([[6,2,3,2]]\) that can suppress errors in adiabatic quantum computation [2].
The code is defined by the \(3\times 3\) binary matrix \begin{align}
Protection
This code detects arbitrary single-qubit errors and is used as an error-suppressing encoding with non-commuting two-local Hamiltonian terms built from gauge generators [2]. For the symmetric choice of coefficients considered in [2], the resulting two-local suppression Hamiltonian has energy separation \(4-2\sqrt{3}\).Gates
When both logical qubits are encoded in the same block, \(X_{L1}X_{L2}\) and \(Z_{L1}Z_{L2}\) are implementable using two-local physical interactions up to stabilizers [2].Cousins
- Small-distance qubit stabilizer code
- \([[4,1,1,2]]\) Four-qubit subsystem code— Both the \([[6,2,3,2]]\) BBS code and the four-qubit subsystem code can be used to suppress errors in adiabatic quantum computation [2].
Primary Hierarchy
References
- [1]
S. Bravyi, “Subsystem codes with spatially local generators”, Physical Review A 83, (2011) arXiv:1008.1029 DOI
- [2]
Z. Jiang and E. G. Rieffel, “Non-commuting two-local Hamiltonians for quantum error suppression”, Quantum Information Processing 16, (2017) arXiv:1511.01997 DOI
Page edit log
- Victor V. Albert (2026-06-08) — most recent
- Victor V. Albert (2024-12-13)
Cite as:
“\([[6,2,3,2]]\) BBS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/bravyi_bacon_shor_6, arXiv:2606.11484