A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
- URL: http://arxiv.org/abs/2601.21863v1
- Date: Thu, 29 Jan 2026 15:31:44 GMT
- Title: A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
- Authors: Jelena Mackeprang, Jonas Helsen,
- Abstract summary: We show that the BK theorem holds for a definition of Floquet codes based on locally conjugate stabiliser groups.<n>We introduce and define a class of generalised unitaries in Floquet codes that need not preserve the codespace at each time step.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Bravyi-König (BK) theorem is an important no-go theorem for the dynamics of topological stabiliser quantum error correcting codes. It states that any logical operation on a $D$-dimensional topological stabiliser code that can be implemented by a short-depth circuit acts on the codespace as an element of the $D$-th level of the Clifford hierarchy. In recent years, a new type of quantum error correcting codes based on Pauli stabilisers, dubbed Floquet codes, has been introduced. In Floquet codes, syndrome measurements are arranged such that they dynamically generate a codespace at each time step. Here, we show that the BK theorem holds for a definition of Floquet codes based on locally conjugate stabiliser groups. Moreover, we introduce and define a class of generalised unitaries in Floquet codes that need not preserve the codespace at each time step, but that combined with the measurements constitute a valid logical operation. We derive a canonical form of these generalised unitaries and show that the BK theorem holds for them too.
Related papers
- Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
arXiv Detail & Related papers (2026-02-27T19:00:00Z) - Floquet implementation of a 3d fermionic toric code with full logical code space [0.0]
We introduce a 3d generalization of a Floquet code whose instantaneous stabilizer group realizes a 3d fermionic toric code.<n>We show that one can append a measurement sequence to extract the missing syndromes without disturbing the logical subspace.
arXiv Detail & Related papers (2026-02-13T07:39:02Z) - Logical gates on Floquet codes via folds and twists [45.88028371034407]
We show how two techniques from static quantum error-correcting codes can be implemented on Floquet codes.<n>First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates.<n>Second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists.
arXiv Detail & Related papers (2025-12-19T19:00:06Z) - Quantum Error Correction with Superpositions of Squeezed Fock States [36.94429692322632]
We propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as $proptoexp(-7r)$.<n>This code achieves high-precision error correction for both single-photon loss and dephasing, even at moderate squeezing levels.
arXiv Detail & Related papers (2025-10-05T13:52:08Z) - Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
arXiv Detail & Related papers (2025-02-20T17:16:28Z) - Puncturing Quantum Stabilizer Codes [28.796017729194713]
We generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed.<n>We present several ways to utilize this for the search of codes with good or even optimal parameters.
arXiv Detail & Related papers (2024-10-23T10:31:34Z) - Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts.
A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z) - Engineering 3D Floquet codes by rewinding [0.0]
Floquet codes are quantum error-correcting codes with dynamically generated logical qubits.
We utilize the interpretation of measurements in terms of condensation of topological excitations.
We show that rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups.
arXiv Detail & Related papers (2023-07-25T17:27:40Z) - Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions.
This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
arXiv Detail & Related papers (2023-04-05T20:28:04Z) - Floquet codes and phases in twist-defect networks [2.793095554369282]
We introduce a class of models, dubbed paired twist-defect networks, that generalize the structure of Kitaev's honeycomb model.
We show that the Honeycomb Floquet code of Haah and Hastings is governed by an irrational value of the chiral Floquet index.
arXiv Detail & Related papers (2023-03-30T19:05:20Z) - Topological error correcting processes from fixed-point path integrals [0.7873629568804646]
We analyze and construct topological quantum error correcting codes as dynamical circuits of geometrically local channels and measurements.
We derive two new error-correcting codes, namely a Floquet version of the $3+1$-dimensional toric code using only 2-body measurements, and a dynamic code based on the double-semion string-net path integral.
arXiv Detail & Related papers (2023-03-29T02:32:18Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.