Lattice Surgery on the Raussendorf Lattice
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.
Keywords
Cite
@article{arxiv.1711.04921,
title = {Lattice Surgery on the Raussendorf Lattice},
author = {Daniel Herr and Alexandru Paler and Simon J. Devitt and Franco Nori},
journal= {arXiv preprint arXiv:1711.04921},
year = {2018}
}