Estimating overheads for quantum fault-tolerance in the honeycomb code

The honeycomb code is an exciting new quantum error-correcting code on which the logical observables dance around periodically. This dance permits logical qubits embedded naturally in a sparse qubit lattice, with check operators that are constructed from products of anticommuting weight-two measurements. However, these experimentally amenable properties come at an error-corrective cost. In this talk, we'll discuss estimates for the overhead of quantum error-correction using the honeycomb code, and compare it with the popular surface code. We'll touch on different metrics for comparing the two, as well as the (mostly open-source) software that greatly simplified these comparisons.