Surface code quantum computing by lattice surgery
From MaRDI portal
Publication:5137804
DOI10.1088/1367-2630/14/12/123011zbMATH Open1448.81240arXiv1111.4022OpenAlexW3103149928WikidataQ59567528 ScholiaQ59567528MaRDI QIDQ5137804FDOQ5137804
Authors: Clare Horsman, Austin G. Fowler, Simon J. Devitt, Rodney Van Meter 
Publication date: 2 December 2020
Published in: New Journal of Physics (Search for Journal in Brave)
Abstract: In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance 3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
Full work available at URL: https://arxiv.org/abs/1111.4022
Recommendations
- Lattice surgery-based surface code architecture using remote logical CNOT operation
- Lattice surgery translation for quantum computation
- Qudit surface codes and hypermap codes
- Bounding the distance of quantum surface codes
- Quantum Codes From Toric Surfaces
- Qudit surface codes and gauge theory with finite cyclic groups
- scientific article
- Logical qubit behavior model and fast simulation for surface code
- Quantum double aspects of surface code models
Cites Work
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Paths, Trees, and Flowers
- Fault-tolerant quantum computation by anyons
- Reliable quantum computers
- Maximum matching and a polyhedron with 0,1-vertices
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Topological quantum memory
- Title not available (Why is that?)
- Topological computation without braiding
- Quantum measurements and gates by code deformation
- Clifford gates by code deformation
- Projective plane and planar quantum codes
- Why should anyone care about computing with anyons?
- Low-overhead surface code logical Hadamard
Cited In (21)
- Lattice surgery-based surface code architecture using remote logical CNOT operation
- Target-generating quantum error correction coding scheme based on generative confrontation network
- Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
- Low-overhead surface code logical Hadamard
- Quantum convolutional codes concatenated with the GKP code for correcting continuous errors
- Bounding the distance of quantum surface codes
- Unfolding the color code
- Title not available (Why is that?)
- Quantum measurements and gates by code deformation
- Multi-qubit parity measurement in circuit quantum electrodynamics
- Algebraic aspects of boundaries in the Kitaev quantum double model
- Bulk-to-boundary anyon fusion from microscopic models
- Logical qubit behavior model and fast simulation for surface code
- Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
- Well-tempered ZX and ZH calculi
- A magic state’s fidelity can be superior to the operations that created it
- Estimating quantum speedups for lattice sieves
- Lattice surgery translation for quantum computation
- Rectangular surface code under biased noise
- Convolutional neural network based decoders for surface codes
- Fault-tolerant quantum computation using low-cost joint measurements
Uses Software
This page was built for publication: Surface code quantum computing by lattice surgery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137804)
