Increasing the distance of topological codes with time vortex defects

Abstract

We propose modifying topological quantum error correcting codes by incorporating space-time defects, termed ``time vortices,'' to reduce the number of physical qubits required to achieve a desired logical error rate. A time vortex is inserted by adding a spatially varying delay to the periodic measurement sequence defining the code such that the delay accumulated on a homologically non-trivial cycle is an integer multiple of the period. We analyze this construction within the framework of the Floquet color code and optimize the embedding of the code on a torus along with the choice of the number of time vortices inserted in each direction. Asymptotically, the vortexed code requires less than half the number of qubits as the vortex-free code to reach a given code distance. We benchmark the performance of the vortexed Floquet color code by Monte Carlo simulations with a circuit-level noise model and demonstrate that the smallest vortexed code (with $30$ qubits) outperforms the vortex-free code with $42$ qubits.

16 pages, 8 figures

References in corpus (26)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Surface code quantum computing by lattice surgery
• High threshold universal quantum computation on the surface code
• Stim: a fast stabilizer circuit simulator
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Tradeoffs for reliable quantum information storage in 2D systems
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Dynamically Generated Logical Qubits
• Balanced Product Quantum Codes
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• A Fault-Tolerant Honeycomb Memory
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Floquet codes without parent subsystem codes
• Anyon condensation and the color code
• Boundaries for the Honeycomb Code
• Performance of planar Floquet codes with Majorana-based qubits
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Benchmarking the Planar Honeycomb Code
• Unifying flavors of fault tolerance with the ZX calculus
• Optimization of the surface code design for Majorana-based qubits
• Low-complexity quantum codes designed via codeword-stabilized framework
• Floquet codes with a twist
• Topological excitations at time vortices in periodically driven systems
• A graph-based formalism for surface codes and twists