Boundaries for the honeycomb code

Abstract

We introduce a simple construction of boundary conditions for the honeycomb code [1] that uses only pairwise checks and allows parallelogram geometries at the cost of modifying the bulk measurement sequence. We discuss small instances of the code.