Folds and Twists Enable Logical Operations on Floquet Codes with 0.25 Fidelity

The pursuit of reliable quantum computation demands robust methods for correcting errors, and recent attention has focused on a promising new family of error-correcting codes known as Floquet codes. Alexandra E. Moylett and Bhargavi Jonnadula, both from Nu Quantum Ltd., and their colleagues demonstrate a significant advance in this field by establishing techniques for performing logical operations on these codes. The team successfully implements fold-transversal operations and Dehn twists, methods previously used in static quantum error correction, to create logical Hadamard and S gates within Floquet codes. This achievement is particularly noteworthy because it unlocks the potential for practical quantum computation, evidenced by a demonstrated logical-gate threshold of 0.25-0.35% and error suppression comparable to established quantum memory benchmarks.

Scientists are establishing techniques for performing logical operations on these codes, unlocking the potential for practical quantum computation. A demonstrated logical-gate threshold of 0.35% and error suppression comparable to established quantum memory benchmarks highlights this progress.

Floquet Code Logic via Geometric Transformations

Scientists have developed a novel approach to implementing logical operations on Floquet codes by adapting techniques from static quantum error-correcting codes. This allows for the creation of logical Hadamard and S gates through fold-transversal operations and Dehn twists, a geometric transformation applied to the code space. The team engineered a method for constructing Floquet codes on colour code lattices, confirming its applicability to various lattices, including those accommodating hardware imperfections. Numerical benchmarking on the CCS Floquet code established a logical-gate threshold of 0. Researchers demonstrate two key methods, fold-transversal operations and Dehn twists, enabling the creation of logical Hadamard and S gates, essential components for quantum computation. Experiments established a logical-gate threshold of 0.35%, indicating the level of physical error that can be tolerated while maintaining reliable logical operations. Simulations at a physical error rate of 0.05% achieved logical error rates of approximately 10 -6 with 294 physical qubits, confirming sub-threshold exponential error suppression, a crucial step towards building practical quantum computers.

Floquet Code Gates and Error Suppression

New methods for performing logical operations on Floquet codes have been demonstrated, adapting techniques originally designed for static codes. Researchers successfully implemented logical Hadamard and S gates within Floquet codes using fold-transversal operations and Dehn twists. Numerical simulations using the CCS Floquet code established a logical-gate threshold of 0.35% and confirmed exponential error suppression below this threshold, indicating robust performance comparable to existing quantum memory implementations. These techniques are applicable to a broad range of Floquet codes defined on colour code lattices, offering a pathway towards more complex quantum computations.

👉 More information
🗞 Logical gates on Floquet codes via folds and twists
🧠 ArXiv: https://arxiv.org/abs/2512.17999

Rohail T.

Rohail T.

As a quantum scientist exploring the frontiers of physics and technology. My work focuses on uncovering how quantum mechanics, computing, and emerging technologies are transforming our understanding of reality. I share research-driven insights that make complex ideas in quantum science clear, engaging, and relevant to the modern world.

Latest Posts by Rohail T.:

Angular Rejection Filtering Achieves Enhanced Security for Continuous-Variable Quantum Communications

Angular Rejection Filtering Achieves Enhanced Security for Continuous-Variable Quantum Communications

January 6, 2026
Faster Recommendation Models, KernelEvolve Enables 100% Optimization across AI Accelerators

Faster Recommendation Models, KernelEvolve Enables 100% Optimization across AI Accelerators

January 6, 2026
Rxnbench Benchmark Advances Large Language Models with Full-Document and Scheme QA

Rxnbench Benchmark Advances Large Language Models with Full-Document and Scheme QA

January 6, 2026