Optimization of the surface code design for Majorana-based qubits

Abstract

The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT gates between the data qubits with nearest-neighbor ancilla qubits. Here, we present surface code error-correction schemes using $\text{only}$ Pauli measurements on single qubits and on pairs of nearest-neighbor qubits. In particular, we provide several qubit layouts that offer favorable trade-offs between qubit overhead, circuit depth and connectivity degree. We also develop minimized measurement sequences for syndrome extraction, enabling reduced logical error rates and improved fault-tolerance thresholds. Our work applies to topologically protected qubits realized with Majorana zero modes and to similar systems in which multi-qubit Pauli measurements rather than CNOT gates are the native operations.

arXiv commentAdded overhead analysis

References in corpus (17)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Fault-tolerant quantum computation with high threshold in two dimensions
• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• High threshold universal quantum computation on the surface code
• Roadmap to Majorana surface codes
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Simulation of rare events in quantum error correction
• Modeling noise and error correction for Majorana-based quantum computing
• Generating Fault-Tolerant Cluster States from Crystal Structures
• A decoding algorithm for CSS codes using the X/Z correlations
• Fault-tolerant Compass Codes
• Noise threshold and resource cost of fault-tolerant quantum computing with Majorana fermions in hybrid systems
• Characterization of universal two-qubit Hamiltonians

Cited by in corpus (25)

• Stim: a fast stabilizer circuit simulator
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• A Fault-Tolerant Honeycomb Memory
• Calibrated decoders for experimental quantum error correction
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Surface code compilation via edge-disjoint paths
• Boundaries for the Honeycomb Code
• Performance of planar Floquet codes with Majorana-based qubits
• Benchmarking the Planar Honeycomb Code
• Tailored XZZX codes for biased noise
• A decoder for the triangular color code by matching on a Möbius strip
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Tailoring fusion-based error correction for high thresholds to biased fusion failures
• A Pair Measurement Surface Code on Pentagons
• Achieving fault tolerance on capped color codes with few ancillas
• Optimizing quantum error correction protocols with erasure qubits
• Fault-tolerant quantum architectures based on erasure qubits
• Improved Pairwise Measurement-Based Surface Code
• Fault-tolerant hyperbolic Floquet quantum error correcting codes
• Improved quantum error correction using soft information
• Quantum error correction for long chains of trapped ions
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Increasing the distance of topological codes with time vortex defects
• Interplay of Tilt and Axion Fields in Topological Superconductors: Anisotropy in the Meissner Effect