Surface code quantum computing by lattice surgery
From MaRDI portal
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.
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; zbMATH DE number 5953473
- 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
- Clifford gates by code deformation
- Fault-tolerant quantum computation by anyons
- scientific article; zbMATH DE number 1820658 (Why is no real title available?)
- Low-overhead surface code logical Hadamard
- Maximum matching and a polyhedron with 0,1-vertices
- Paths, Trees, and Flowers
- Projective plane and planar quantum codes
- Quantum measurements and gates by code deformation
- Reliable quantum computers
- Topological computation without braiding
- Topological quantum memory
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Why should anyone care about computing with anyons?
Cited in
(32)- Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
- 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
- Quantum convolutional codes concatenated with the GKP code for correcting continuous errors
- Rectangular surface code under biased noise
- Estimating quantum speedups for lattice sieves
- Convolutional neural network based decoders for surface codes
- Bounding the distance of quantum surface codes
- A magic state’s fidelity can be superior to the operations that created it
- Quantum measurements and gates by code deformation
- Low-overhead surface code logical Hadamard
- Pauli fusion: a computational model to realise quantum transformations from ZX terms
- Multi-qubit parity measurement in circuit quantum electrodynamics
- Unfolding the color code
- Bulk-to-boundary anyon fusion from microscopic models
- Algebraic aspects of boundaries in the Kitaev quantum double model
- Lattice surgery translation for quantum computation
- Logical qubit behavior model and fast simulation for surface code
- Fault-tolerant quantum computation using low-cost joint measurements
- Well-tempered ZX and ZH calculi
- Generalized code distance through rotated logical states in quantum error correction
- Hierarchical quantum error correction with hypergraph product code and rotated surface code
- Introduction to quantum error correction with stabilizer codes
- Multi-qubit lattice surgery scheduling
- Implementation of magic state injection within heavy-hexagon architectures
- Quantum error correction with Kolmogorov-Arnold network for rotated surface codes decoding
- Architectures for lattice surgery-based surface code quantum computing under 3-dimensional nearest-neighbor connectivity
- Cups and gates. I: Cohomology invariants and logical quantum operations
- Automorphism in gauge theories: Higher symmetries and transversal non-Clifford logical gates
- Note on logical gates by gauge field formalism of quantum error correction
- On the practicality of quantum sieving algorithms for the shortest vector problem
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)
