Lattice Surgery on the Raussendorf Lattice
arXiv:1711.04921 · doi:10.1088/2058-9565/aac450
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.
References in corpus (24)
- Surface codes: Towards practical large-scale quantum computation
- Measurement-based quantum computation with cluster states
- Measurement-based quantum computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- Surface code quantum computing by lattice surgery
- A fault-tolerant one-way quantum computer
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Magic state distillation with low overhead
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Photonic architecture for scalable quantum information processing in NV-diamond
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Foliated Quantum Codes
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- The surface code with a twist
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Unifying gate-synthesis and magic state distillation
- Fault-tolerant interface between quantum memories and quantum processors
- Quantum computing by color-code lattice surgery
- Synthesis of Arbitrary Quantum Circuits to Topological Assembly
- Optimization of Lattice Surgery is NP-Hard
- Lattice Surgery Translation for Quantum Computation
- State injection, lattice surgery and dense packing of the deformation-based surface code
Cited by in corpus (12)
- Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- High threshold codes for neutral atom qubits with biased erasure errors
- High-threshold quantum computing by fusing one-dimensional cluster states
- Universal fault-tolerant measurement-based quantum computation
- Tailored cluster states with high threshold under biased noise
- Deterministic one-way logic gates on a cloud quantum computer
- Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
- Parity-encoding-based quantum computing with Bayesian error tracking
- End-to-end switchless architecture for fault-tolerant photonic quantum computing
- A 3D lattice defect and efficient computations in topological MBQC
- Lattice Surgery for Dummies