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.
Introduction: The Qubit Overhead Challenge
Building a fault-tolerant quantum computer is currently a "numbers game" with a high entry price. To protect a single "logical" qubit of information, current architectures require dozens or even hundreds of noisy "physical" qubits. This qubit overhead is a primary bottleneck for scaling quantum processors.
Topological codes, such as surface or color codes, arrange qubits on a 2D lattice and detect errors through local "stabilizer" measurements. The robustness of these codes is characterized by the code distance ($D$), representing the minimum number of physical errors required to cause a logical failure. Traditionally, increasing $D$ necessitates adding more physical qubits ($N$). This research explores a novel method to increase $D$ without a proportional increase in $N$.
The Time Vortex Mechanism
The authors focus on Floquet codes, where measurement checks occur in a periodic sequence over time. Their innovation is the "time vortex": a spatially varying delay introduced into the measurement schedule.
As shown in the lattice above, as one traverses a cycle on the torus, these delays accumulate. By the time the path returns to its starting point, the measurement sequence has shifted by a full period ($T$). This creates a "shear" in the space-time lattice of the code's detectors. In a standard code, undetectable errors might follow short, direct paths. By "vortexing" the time dimension, these error paths are effectively stretched, forcing them to become longer and thereby increasing the code distance.
Efficiency and Performance
The primary benefit of this approach is a dramatic reduction in resource requirements. In the limit of large systems, the code distance in a vortexed Floquet color code is approximately 1.46 times larger than the standard configuration for the same number of qubits.
Asymptotically, the "vortexed" code achieves a ratio of qubits to distance squared ($N/D^2$) of approximately 2.11, compared to 4.5 for the standard vortex-free version. This represents a 50% qubit discount, allowing for the same level of protection with less than half the physical hardware. Simulations using the Stim simulator and PyMatching decoder confirm these gains even at small scales: a vortexed code with only 30 qubits was shown to outperform a standard 42-qubit code.
Limitations and Future Outlook
While promising, the time vortex technique introduces a trade-off: idling noise. Because the schedule is delayed, some qubits must remain idle while waiting for their measurement step. On hardware platforms with high idling error rates, this could potentially offset the topological gains. Furthermore, while the number of gates remains constant, the total time required for a full round of error correction increases.
Future research may extend this "time vortex" logic to other code families, such as Low-Density Parity-Check (LDPC) codes, potentially further lowering the threshold for practical, fault-tolerant quantum computation.
Summary updated