Lattice surgery on the Raussendorf lattice. (6th June 2018)

• Record Type: Journal Article
• Authors: Herr, Daniel; Paler, Alexandru; Devitt, Simon J; Nori, Franco
• Is Part Of: Quantum science and technology. Volume 3:Number 3(2018)
• Publication Date: 2018-06-06
• Subjects: quantum computing -- fault tolerance -- lattice surgery -- braiding; Quantum theory -- Periodicals; Quantum theory; Periodicals; 530
• DOI: 10.1088/2058-9565/aac450
• Languages: English
• ISSNs: 2058-9565

Abstract

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.