Papers › Increasing the distance of topological codes with time vortex defects
Increasing the distance of topological codes with time vortex defects
Gilad Kishony, Erez Berg
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections