Lattice Surgery Compilation Beyond the Surface Code

Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge has mostly focused on the surface code and lattice surgery schemes. In this work, we broaden the scope by considering lat...

Full description

Saved in:
Bibliographic Details
Main Authors Herzog, Laura S, Berent, Lucas, Kubica, Aleksander, Wille, Robert
Format Journal Article
LanguageEnglish
Published 01.08.2025
Subjects
Online AccessGet full text
DOI10.48550/arxiv.2504.10591

Cover

Loading…
More Information
Summary:Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge has mostly focused on the surface code and lattice surgery schemes. In this work, we broaden the scope by considering lattice surgery compilation for topological codes beyond the surface code. We begin by defining a code substrate - a blueprint for implementing topological codes and lattice surgery. We then abstract from the microscopic details and rephrase the compilation task as a mapping and routing problem on a macroscopic routing graph, potentially subject to substrate-specific constraints. We explore specific substrates and codes, including the color code and the folded surface code, providing detailed microscopic constructions. For the color code, we present numerical simulations analyzing how design choices at the microscopic and macroscopic levels affect the depth of compiled logical $\mathrm{CNOT}+\mathrm{T}$ circuits. An open-source code is available on GitHub https://github.com/cda-tum/mqt-qecc.
DOI:10.48550/arxiv.2504.10591