Three-dimensional surface codes: Transversal gates and fault-tolerant architectures

Abstract

One of the leading quantum computing architectures is based on the two-dimensional (2D) surface code. This code has many advantageous properties such as a high error threshold and a planar layout of physical qubits where each physical qubit need only interact with its nearest neighbours. However, the transversal logical gates available in 2D surface codes are limited. This means that an additional (resource intensive) procedure known as magic state distillation is required to do universal quantum computing with 2D surface codes. Here, we examine three-dimensional (3D) surface codes in the context of quantum computation. We introduce a picture for visualizing 3D surface codes which is useful for analysing stacks of three 3D surface codes. We use this picture to prove that the $CZ$ and $CCZ$ gates are transversal in 3D surface codes. We also generalize the techniques of 2D surface code lattice surgery to 3D surface codes. We combine these results and propose two quantum computing architectures based on 3D surface codes. Magic state distillation is not required in either of our architectures. Finally, we show that a stack of three 3D surface codes can be transformed into a single 3D color code (another type of quantum error-correcting code) using code concatenation.

23 pages, 24 figures, v2: published version

References in corpus (21)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Low-distance Surface Codes under Realistic Quantum Noise
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Topological Computation without Braiding
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Topological order in a 3D toric code at finite temperature
• Universal transversal gates with color codes - a simplified approach
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Low overhead quantum computation using lattice surgery
• 2-D Compass Codes
• Locality-Preserving Logical Operators in Topological Stabiliser Codes
• Magnetic-glassy multicritical behavior of the three-dimensional +- J Ising model
• Lattice Surgery Translation for Quantum Computation
• Renormalization group decoder for a four-dimensional toric code
• Lattice Surgery on the Raussendorf Lattice
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
• On the Local Equivalence of 2D Color Codes and Surface Codes with Applications

Cited by in corpus (53)

• Quantum Error Correction: An Introductory Guide
• The Future of Quantum Computing with Superconducting Qubits
• Decoding Across the Quantum LDPC Code Landscape
• Focus beyond quadratic speedups for error-corrected quantum advantage
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• High threshold codes for neutral atom qubits with biased erasure errors
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Universal fault-tolerant measurement-based quantum computation
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Partitioning qubits in hypergraph product codes to implement logical gates
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Morphing quantum codes
• Programmable photonic integrated meshes for modular generation of optical entanglement links
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Engineering 3D Floquet codes by rewinding
• Quantum computation from dynamic automorphism codes
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• A four-dimensional toric code with non-Clifford transversal gates
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Tailoring three-dimensional topological codes for biased noise
• Achieving fault tolerance on capped color codes with few ancillas
• Quantum error correction with fractal topological codes
• Experiments with the 4D Surface Code on a QCCD Quantum Computer
• Analog information decoding of bosonic quantum LDPC codes
• Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Limitations on transversal gates for hypergraph product codes
• Plane-selective manipulations of nuclear spin qubits in a three-dimensional optical tweezer array
• Non-Pauli Errors in the Three-Dimensional Surface Code
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
• Single-shot and measurement-based quantum error correction via fault complexes
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
• Braiding defects in topological stabiliser codes of any dimension cannot be universal
• Single-shot preparation of hypergraph product codes via dimension jump
• Fault-tolerance in qudit circuit design
• Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate beyond the $n^{1/3}$ Distance Barrier
• Magic Boundaries of 3D Color Codes
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Efficient simulation of logical magic state preparation protocols
• Finding the disjointness of stabilizer codes is NP-complete
• Tessellation codes: encoded quantum gates by geometric rotation
• Machine learning logical gates for quantum error correction
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Equivariant Machine Learning Decoder for 3D Toric Codes