Logical blocks for fault-tolerant topological quantum computation

Abstract

Logical gates constitute the building blocks of fault-tolerant quantum computation. While quantum error-corrected memories have been extensively studied in the literature, explicit constructions and detailed analyses of thresholds and resource overheads of universal logical gate sets have so far been limited. In this paper, we present a comprehensive framework for universal fault-tolerant logic motivated by the combined need for platform-independent logical gate definitions, flexible and scalable tools for numerical analysis, and exploration of novel schemes for universal logic that improve resource overheads. Central to our framework is the description of logical gates holistically in a way which treats space and time on a similar footing. Focusing on schemes based on surface codes, we introduce explicit, but platform-independent representations of topological logic gates -- called logical blocks -- and generate new, overhead-efficient methods for universal quantum computation. As a specific example, we propose fault-tolerant schemes based on surface codes concatenated with more general low-density parity check (LDPC) codes. The logical blocks framework enables a convenient mapping from an abstract description of the logical gate to a precise set of physical instructions for both circuit-based and fusion-based quantum computation (FBQC). Using this, we numerically simulate a surface-code-based universal gate set implemented with FBQC, and verify that their thresholds are consistent with the bulk memory threshold. We find that boundaries, defects, and twists can significantly impact the logical error rate scaling, with periodic boundary conditions potentially halving the resource requirements. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme based on the teleportation of twists that may offer further resource reductions.

39 pages, 32 figures, comments welcome, v2: published version

References in corpus (22)

• Surface codes: Towards practical large-scale quantum computation
• Generalized Global Symmetries
• Multi-party entanglement in graph states
• Fault-tolerant quantum computation with high threshold in two dimensions
• Resource-efficient linear optical quantum computation
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Magic state distillation with low overhead
• Quantum Low-Density Parity-Check Codes
• Low-distance Surface Codes under Realistic Quantum Noise
• Genons, twist defects, and projective non-Abelian braiding statistics
• From three-photon GHZ states to ballistic universal quantum computation
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Dynamically Generated Logical Qubits
• Balanced Product Quantum Codes
• Foliated Quantum Codes
• A magic state's fidelity can be superior to the operations that created it
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• The role of entropy in topological quantum error correction

Cited by in corpus (34)

• Quantum error correction below the surface code threshold
• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• High-threshold quantum computing by fusing one-dimensional cluster states
• Unifying flavors of fault tolerance with the ZX calculus
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Quantum computation from dynamic automorphism codes
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Error-corrected Hadamard gate simulated at the circuit level
• Hierarchical memories: Simulating quantum LDPC codes with local gates
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• 3-Fermion topological quantum computation
• Tangling schedules eases hardware connectivity requirements for quantum error correction
• Compilation of a simple chemistry application to quantum error correction primitives
• Parity-encoding-based quantum computing with Bayesian error tracking
• Improved Pairwise Measurement-Based Surface Code
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Quantum Linear Optics via String Diagrams
• Topologically protected subradiant cavity polaritons through linewidth narrowing enabled by dissipationless edge states
• Light-Matter Interaction in the ZXW Calculus
• Piquasso: A Photonic Quantum Computer Simulation Software Platform
• Fault-tolerant structures for measurement-based quantum computation on a network
• General protocols for the efficient distillation of indistinguishable photons
• Heralding entangled optical photons from a microwave quantum processor
• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
• Characterization of errors in a CNOT between surface code patches
• Lattice surgery-based logical state teleportation via noisy links
• Machine-learning-inspired quantum control in many-body dynamics
• Quantum resource estimates for computing binary elliptic curve discrete logarithms
• Comparing Schemes for Creating Qudit Graph States from 16- & 128-dimensional Hilbert Space using Donors in Silicon
• On the learning abilities of photonic continuous-variable Born machines
• Tessellation codes: encoded quantum gates by geometric rotation
• Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes
• Optimal number of stabilizer measurement rounds in an idling surface code patch
• Quantum advantage for single-photon state characterization