Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.17999

Logical gates on Floquet codes via folds and twists

Alexandra E. Moylett, Bhargavi Jonnadula

quant-phSubmitted Dec 19, 2025• Announced Dec 23, 2025• 6 citations• Revised Jan 13, 2026 (v2)
v1 · Dec 19, 2025v2 · Jan 13, 2026
arXivHTMLPDF

Abstract

Floquet codes have recently emerged as a new family of error-correcting codes, and have drawn significant interest across both theoretical and practical quantum computing. A central open question has been how to implement logical operations on these codes. In this work, we show how two techniques from static quantum error-correcting codes can also be implemented on Floquet codes. First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates. And second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists. We discuss the requirements for these techniques, and show that they are applicable to a wide family of Floquet codes defined on colour code lattices. Through numerical benchmarking of the logical operations on the CCS Floquet code, we establish a logical-gate threshold of 0.25-0.35% and verify sub-threshold exponential error suppression. Our results show that these logical operations are robust, featuring a performance that is close to the baseline set by a quantum memory benchmark. Finally, we explain in detail how to implement logical gates on Floquet codes by operating on the embedded codes.

Comments
49 pages, 40 figures, 8 tables; v2: fixed an error in one figure, minor typo corrections

Related papers

Floquetifying the Colour Code

Alex Townsend-Teague, Julio C. Magdalena de la Fuente, Markus S. Kesselring

Floquet codes are a recently discovered type of quantum error correction code.They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time.In this work, we use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes.In particular, we find a Floquet code that is equivalent to the colour code, but has the advantage that all measurements required to implement it are of weight one or two.Notably, the qubits can even be laid out on a square lattice.This circumvents current difficulties with implementing the colour code fault-tolerantly, while preserving its advantages over other well-studied codes, and could furthermore allow one to benefit from extra features exclusive to Floquet codes.On a higher level, as in Ref. [BLN + 23], this work shines a light on the relationship between 'static' stabilizer and subsystem codes and 'dynamic' Floquet codes; at first glance the latter seems a significant generalisation of the former, but in the case of the codes that we find here, the difference is essentially just a few basic ZX-diagram deformations.

arXiv:2307.11136•Electronic Proceedings in Theoretical Computer Science•Aug 23, 2023•45 citations

Logical Operations with a Dynamical Qubit in Floquet-Bacon-Shor Code

Xuandong Sun, Longcheng Li, Zechen Guo +29 more

Quantum error correction (QEC) protects quantum systems against inevitable noises and control inaccuracies, providing a pathway toward fault-tolerant (FT) quantum computation. Stabilizer codes, including surface code and color code, have long been the focus of research and have seen significant experimental progress in recent years. Recently proposed time-dynamical QEC, including Floquet codes and generalized time-dynamical code implementations, opens up new opportunities for FT quantum computation. By employing a periodic schedule of low-weight parity checks, Floquet codes can generate additional dynamical logical qubits, offering enhanced error correction capabilities and, potentially, higher code performance. Here, we experimentally implement the Floquet-Bacon-Shor code on a superconducting quantum processor. We encode a dynamical logical qubit within a 3×3 lattice of data qubits alongside a conventional static logical qubit. We demonstrate FT encoding and measurement of the two-qubit logical states and stabilize these states using repeated error detection. We showcase universal single-qubit logical gates on the dynamical qubit. Furthermore, by implementing a logical controlled-not (cnot) gate, we entangle the dynamical and static logical qubits, generating an error-detected logical Bell state with a fidelity of 75.9%. Our results highlight the potential of Floquet codes for resource-efficient FT quantum computation.

arXiv:2503.03867•Physical Review Letters•Nov 6, 2025•3 citations

Low-Overhead Entangling Gates From Generalised Dehn Twists

Ryan Tiew, Nikolas P. Breuckmann

We generalise the implementation of logical quantum gates via Dehn twists from topological codes to the hypergraph and balanced products of cyclic codes. These generalised Dehn twists implement logical entangling gates with no additional qubit overhead andO(d)time overhead. Due to having more logical degrees of freedom in the codes, there is a richer structure of attainable logical gates compared to those for topological codes. To illustrate the scheme, we focus on families of hypergraph and balanced product codes that scale as [[18q2, 8, 2q]]q∈Nand [[18q, 8,≤ 2q]]q∈Nrespectively. For distance 6 to 12 hypergraph product codes, we find that the set of twists and fold-transversal gates generate the full logical Clifford group. For the balanced product code, we show that Dehn twists apply to codes in this family with oddq. We also show that the [[90, 8, 10]] bivariate bicycle code is a member of the balanced product code family that saturates the distance bound, and find other balanced product codes that saturate the bound up toq≤ 8 through a numerical search.

arXiv:2411.03302•IEEE Transactions on Information Theory•May 19, 2025•7 citations

Simple Construction of Qudit Floquet Codes on a Family of Lattices

Andrew Tanggara, Mile Gu, Kishor Bharti

Dynamical quantum error-correcting codes (QECC) offer wider possibilities in how one can protect logical quantum information from noise and perform fault-tolerant quantum computation compared to static QECCs. A family of dynamical QECCs called the ``Floquet codes'' consists of a periodic sequence of two-body measurements that enables error-correction on many-body systems, relaxing hardware implementation requirements and improving error-correction reliability. Existing results on Floquet codes has been focused on qubits, two-level quantum systems, with very little attention given on higher dimensional quantum systems, or qudits. We bridge this gap by proposing a simple, yet general construction of qudit Floquet codes based on a simple set of conditions on the sequence two-body measurements defining the code. Moreover, this construction applies to a large family of configurations of qudits on the vertices of a three-colorable lattice which connectivity represented by the edges. We show that this construction includes the existing constructions of both qubit and qudit Floquet codes as special cases. In addition, any qudit Floquet code obtained by our construction achieves a rate of encoded logical qudits over physical qudits approaching $\frac{1}{2}$ as the number of physical qudits in total and on the faces of the lattice grows larger, as opposed to vanishing rate in existing qudit Floquet code constructions.

arXiv:2410.02022•Oct 2, 2024•11 citations

Fault-tolerant hyperbolic Floquet quantum error correcting codes

Ali Fahimniya, Hossein Dehghani, Kishor Bharti +4 more

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

arXiv:2309.10033•Quantum•Sep 5, 2025•34 citations

Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

Theerapat Tansuwannont, Tim Chan, Ryuji Takagi

To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a logical gate on a subset of logical qubits within a high-rate code$\unicode{x2014}$in a fault-tolerant manner can be challenging and may require ancilla qubits. Transversal and fold-transversal gates could provide a means to fault-tolerantly implement logical gates using a constant-depth circuit without ancilla qubits, but available gates of these types could be limited depending on the code and might not be addressable. In this work, we study a family of $[\![n=2^m,k={m \choose m/2}\approx n/\sqrt{π\log_2(n)/2},d=2^{m/2}=\sqrt{n}]\!]$ self-dual quantum Reed$\unicode{x2013}$Muller codes, where $m$ is a positive even number. For any code in this family, we construct a generating set of the full logical Clifford group comprising only transversal and fold-transversal gates, thus enabling the implementation of any addressable Clifford gate. To our knowledge, this is the first known construction of the full logical Clifford group using only transversal and fold-transversal gates without requiring ancilla qubits for a family of codes in which $k$ grows near-linearly in $n$.

quant-pharXiv:2602.09788•Feb 11, 2026•16 citations
Floquet codes have recently emerged as a new family of error-correcting codes, and have drawn significant interest across both theoretical and practical quantum computing. A central open question has been how to implement logical operations on these codes. In this work, we show how two techniques from static quantum error-correcting codes can also be implemented on Floquet codes. First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates. And second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists. We discuss the requirements for these techniques, and show that they are applicable to a wide family of Floquet codes defined on colour code lattices. Through numerical benchmarking of the logical operations on the CCS Floquet code, we establish a logical-gate threshold of 0.25-0.35% and verify sub-threshold exponential error suppression. Our results show that these logical operations are robust, featuring a performance that is close to the baseline set by a quantum memory benchmark. Finally, we explain in detail how to implement logical gates on Floquet codes by operating on the embedded codes.
Floquet codes are a recently discovered type of quantum error correction code.They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time.In this work, we use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes.In particular, we find a Floquet code that is equivalent to the colour code, but has the advantage that all measurements required to implement it are of weight one or two.Notably, the qubits can even be laid out on a square lattice.This circumvents current difficulties with implementing the colour code fault-tolerantly, while preserving its advantages over other well-studied codes, and could furthermore allow one to benefit from extra features exclusive to Floquet codes.On a higher level, as in Ref. [BLN + 23], this work shines a light on the relationship between 'static' stabilizer and subsystem codes and 'dynamic' Floquet codes; at first glance the latter seems a significant generalisation of the former, but in the case of the codes that we find here, the difference is essentially just a few basic ZX-diagram deformations.
Quantum error correction (QEC) protects quantum systems against inevitable noises and control inaccuracies, providing a pathway toward fault-tolerant (FT) quantum computation. Stabilizer codes, including surface code and color code, have long been the focus of research and have seen significant experimental progress in recent years. Recently proposed time-dynamical QEC, including Floquet codes and generalized time-dynamical code implementations, opens up new opportunities for FT quantum computation. By employing a periodic schedule of low-weight parity checks, Floquet codes can generate additional dynamical logical qubits, offering enhanced error correction capabilities and, potentially, higher code performance. Here, we experimentally implement the Floquet-Bacon-Shor code on a superconducting quantum processor. We encode a dynamical logical qubit within a 3×3 lattice of data qubits alongside a conventional static logical qubit. We demonstrate FT encoding and measurement of the two-qubit logical states and stabilize these states using repeated error detection. We showcase universal single-qubit logical gates on the dynamical qubit. Furthermore, by implementing a logical controlled-not (cnot) gate, we entangle the dynamical and static logical qubits, generating an error-detected logical Bell state with a fidelity of 75.9%. Our results highlight the potential of Floquet codes for resource-efficient FT quantum computation.
We generalise the implementation of logical quantum gates via Dehn twists from topological codes to the hypergraph and balanced products of cyclic codes. These generalised Dehn twists implement logical entangling gates with no additional qubit overhead andO(d)time overhead. Due to having more logical degrees of freedom in the codes, there is a richer structure of attainable logical gates compared to those for topological codes. To illustrate the scheme, we focus on families of hypergraph and balanced product codes that scale as [[18q2, 8, 2q]]q∈Nand [[18q, 8,≤ 2q]]q∈Nrespectively. For distance 6 to 12 hypergraph product codes, we find that the set of twists and fold-transversal gates generate the full logical Clifford group. For the balanced product code, we show that Dehn twists apply to codes in this family with oddq. We also show that the [[90, 8, 10]] bivariate bicycle code is a member of the balanced product code family that saturates the distance bound, and find other balanced product codes that saturate the bound up toq≤ 8 through a numerical search.
Dynamical quantum error-correcting codes (QECC) offer wider possibilities in how one can protect logical quantum information from noise and perform fault-tolerant quantum computation compared to static QECCs. A family of dynamical QECCs called the ``Floquet codes'' consists of a periodic sequence of two-body measurements that enables error-correction on many-body systems, relaxing hardware implementation requirements and improving error-correction reliability. Existing results on Floquet codes has been focused on qubits, two-level quantum systems, with very little attention given on higher dimensional quantum systems, or qudits. We bridge this gap by proposing a simple, yet general construction of qudit Floquet codes based on a simple set of conditions on the sequence two-body measurements defining the code. Moreover, this construction applies to a large family of configurations of qudits on the vertices of a three-colorable lattice which connectivity represented by the edges. We show that this construction includes the existing constructions of both qubit and qudit Floquet codes as special cases. In addition, any qudit Floquet code obtained by our construction achieves a rate of encoded logical qudits over physical qudits approaching 12\frac{1}{2}21​ as the number of physical qudits in total and on the faces of the lattice grows larger, as opposed to vanishing rate in existing qudit Floquet code constructions.
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a logical gate on a subset of logical qubits within a high-rate code$\unicode{x2014}$in a fault-tolerant manner can be challenging and may require ancilla qubits. Transversal and fold-transversal gates could provide a means to fault-tolerantly implement logical gates using a constant-depth circuit without ancilla qubits, but available gates of these types could be limited depending on the code and might not be addressable. In this work, we study a family of [ ⁣[n=2m,k=(mm/2)≈n/πlog⁡2(n)/2,d=2m/2=n] ⁣][\![n=2^m,k={m \choose m/2}\approx n/\sqrt{π\log_2(n)/2},d=2^{m/2}=\sqrt{n}]\!][[n=2m,k=(m/2m​)≈n/πlog2​(n)/2​,d=2m/2=n​]] self-dual quantum Reed$\unicode{x2013}$Muller codes, where mmm is a positive even number. For any code in this family, we construct a generating set of the full logical Clifford group comprising only transversal and fold-transversal gates, thus enabling the implementation of any addressable Clifford gate. To our knowledge, this is the first known construction of the full logical Clifford group using only transversal and fold-transversal gates without requiring ancilla qubits for a family of codes in which kkk grows near-linearly in nnn.