Lattice Surgery on the Raussendorf Lattice

TL;DR

This paper explores how lattice surgery can be applied to the Raussendorf lattice, offering a measurement-based alternative to braiding for fault-tolerant quantum computation with topological codes.

Contribution

It demonstrates the feasibility of implementing lattice surgery on the Raussendorf lattice, expanding measurement-based quantum computing methods.

Findings

Lattice surgery can be adapted to the Raussendorf lattice.

Provides an alternative to braiding in measurement-based topological quantum computing.

Enhances resource efficiency for fault-tolerant quantum algorithms.

Abstract

Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar-code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that eases physical hardware implementations. Lattice-surgery approaches to algorithmic compilation and optimization have been demonstrated to be more resource efficient for resource-intensive components of a fault-tolerant algorithm, and consequently may be preferable over braid-based logic. Lattice surgery can be extended to the Raussendorf lattice, providing a measurement-based approach to the surface code. In this paper we describe how lattice surgery can be performed on the Raussendorf lattice and therefore give a viable alternative to computation using braiding in measurement based implementations of topological codes.