String Diagrams for Defect-Based Surface Code Computing
Mateusz Kupper (Department of Informatics, University of Sussex), Dominic Horsman (Department of Computer Science, University of Oxford), Chris Heunen (School of Informatics, University of Edinburgh), Niel de Beaudrap (Department of Informatics, University of Sussex)

TL;DR
This paper formalizes a graphical calculus called KNOT for defect braiding in surface codes, using ZX-calculus, enabling analysis of fault-tolerant quantum computing operations.
Contribution
It introduces the KNOT calculus and its subtheories, linking defect braiding effects to ZX-calculus, and provides a formal framework for analyzing surface code operations.
Findings
Defined the KNOT graphical calculus for defect braiding effects.
Established the soundness and completeness of subtheories for the (0, pi)-fragment.
Connected defect braiding operations to ZX-calculus for quantum computing analysis.
Abstract
Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, either by lattice surgery or by braiding defects around each other. The effect of lattice surgery operations may be simply described using the ZX-calculus: a graphical language that has proven effective for program design and optimisation. In this work, we formalise a similar description via the ZX-calculus of defect braiding, as it is conventionally described. We define a graphical calculus KNOT, denoting the logical effects (in the absence of byproduct operations) of defect braiding in surface codes: we show how these effects may be described via a fragment of ZX-calculus which we call the (0, pi)-fragment. We then use a doubling construction to define a subtheory of KNOT, more specialised to standard encoding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
