Decoding across Transversal Clifford Gates in the Surface Code

Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding across logical gates, complicating the decoding task. We show how one can decode across an arbitrary sequence of transversal gates for the unrotated surface code, using a fast “logical observable” minimum-weight perfect matching-based decoder, and benchmark its performance in Clifford circuits under circuit-level noise. We propose logical observable matching decoders to address the problem of fully efficient decoding: our basic windowed decoder is computationally efficient under the restriction of quiescent (slow) resets. Our “advanced” two-step windowed decoder can be computationally inefficient but allows fast resets. For both windowed decoders we identify errors which scale sublinearly in <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>d</a:mi> </a:math> —depending on the structure of the circuit—which can lead to logical failure, and we propose methods to adapt the decoding to remove such failures. Our work highlights the complexity and interest in efficient decoding of fast logic for the surface code.