• Corpus ID: 239024528

Boundaries for the Honeycomb Code

@inproceedings{Haah2021BoundariesFT,
  title={Boundaries for the Honeycomb Code},
  author={Jeongwan Haah and Matthew B. Hastings},
  year={2021}
}
The recently introduced honeycomb code [1] is a code with dynamically generated logical qubits that falls outside the usual stabilizer and subsystem code formalism. This code uses only pairwise checks, which are a product of Pauli matrices on two different qubits. The checks are measured in a particular sequence which is broken up into “rounds” where in each round one-third of the checks are measured, with the measurement pattern repeating every three rounds. Since the honeycomb code at any… 

Figures from this paper

Planar Floquet Codes
A protocol called the “honeycomb code”, or generically a “Floquet code”, was introduced by Hastings and Haah in [1]. The honeycomb code is a subsystem code based on the honeycomb lattice with zero
A Fault-Tolerant Honeycomb Memory
Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice [24]. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local measurements. The