Boundaries for the Honeycomb Code

TL;DR

This paper presents a straightforward method for implementing boundary conditions in the honeycomb code, enabling parallelogram geometries through pairwise checks and modifications to the measurement sequence.

Contribution

It introduces a simple boundary construction for the honeycomb code that simplifies implementation and allows new geometrical configurations.

Findings

Boundary conditions compatible with parallelogram geometries

Implementation of boundary conditions using only pairwise checks

Modified bulk measurement sequence enables new boundary types

Abstract

We introduce a simple construction of boundary conditions for the honeycomb code 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.