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:2504.19041 · Physical Review A

Phases of Floquet code under local decoherence

Yuchen Tang, Yimu Bao

Published Oct 27, 2025• 3 citations
arXivHTMLPDF

Abstract

Floquet code is a dynamical quantum memory with a periodically evolving logical space. As a defining feature, the code exhibits an anyon automorphism after each period, giving rise to a nontrivial evolution of each logical state. In this paper, we study the Floquet code under local decoherence and perfect measurements and demonstrate that, below the decoherence threshold, the code is in a robust phase characterized by the anyon automorphism. We first derive the three-dimensional (3D) statistical mechanics model for the maximum likelihood decoder of the two-dimensional (2D) Floquet code under local Pauli decoherence. We identify a class of two-qubit Pauli channels under which the 3D statistical mechanics model becomes decoupled 2D models and obtain the threshold for such decoherence channels. We then propose a diagnostic of the anyon automorphism in the presence of local decoherence. We analytically show that this diagnostic distinguishes the Floquet code from the toric code under repeated syndrome measurements and undergoes a phase transition at the threshold.

DOI
10.1103/sylh-bb3w

Related papers

Competing automorphisms and disordered Floquet codes

Cory T. Aitchison, Benjámin Béri

Topological order is a promising basis for quantum error correction, a key milestone towards large-scale quantum computing. Floquet codes provide a dynamical scheme for this while also exhibiting Floquet-enriched topological order where anyons periodically undergo a measurement-induced automorphism that acts uniformly in space. We study disordered Floquet codes where automorphisms have a spatiotemporally heterogeneous distribution: the automorphisms “compete.” We characterize the effect of this competition, showing how key features of the purification dynamics of mixed code states can be inferred from anyon and automorphism properties for any Abelian topological order. This perspective can explain the preservation or measurement of logical information in a dynamic automorphism (DA) code when subjected to a noise model of missing measurements. We demonstrate this using a DA color code with perturbed measurement sequences. The framework of competing automorphisms captures essential features of Floquet codes and robustness to noise, and may elucidate key mechanisms involving topological order, automorphisms, and fault tolerance.

arXiv:2410.02398•Physical review. B./Physical review. B•May 15, 2025•2 citations

Floquet implementation of a 3d fermionic toric code with full logical code space

Yoshito Watanabe, Bianca Bannenberg, Simon Trebst

Floquet quantum error-correcting codes provide an operationally economical route to fault tolerance by dynamically generating stabilizer structures using only two-body Pauli measurements. But while it is well established that stabilizer codes in higher spatial dimensions gain additional levels of intrinsic robustness, higher-dimensional Floquet codes have hitherto been explored only in limited scope. Here we introduce a 3d generalization of a Floquet code whose instantaneous stabilizer group realizes a 3d fermionic toric code, while crucially preserving all three logical qubits throughout the entire measurement sequence. One central ingredient is the identification of a 3d lattice geometry that generalizes the features of the Kekulé lattice underlying the 2d Hastings-Haah code - specifically, a structure where deleting any one edge color yields a two-color subgraph that decomposes into short, closed loops rather than homologically nontrivial chains. This loop property avoids the collapse of logical information that plagues naive sequential two-color measurement schedules on many 3d lattices. Although, for our lattice geometry, a simple 3-round cycle that sequentially measures the three types of parity checks does not expose the full error syndrome set, we show that one can append a measurement sequence to extract the missing syndromes without disturbing the logical subspace. Beyond code design, 3d tricoordinated lattice geometries define a family of 3d monitored Kitaev models, in which random measurements of the non-commuting parity checks give rise to dynamically created entangled phases with nontrivial topology. In discussing the general structure of their underlying phase diagrams and, in particular, the existence of certain quantum critical points, we again make a connection to the general preservation of logical information in time-ordered Floquet protocols.

quant-pharXiv:2602.12685•Feb 16, 2026•1 citation

Engineering 3D Floquet Codes by Rewinding

Arpit Dua, Nathanan Tantivasadakarn, Joseph Sullivan +1 more

Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of noncommuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as the three-dimensional (3D) toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of the 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of the 3D toric code up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of the 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford controlled-controlled- Z gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite depth equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to three dimensions, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code. Published by the American Physical Society 2024

arXiv:2307.13668•PRX Quantum•Apr 8, 2024•37 citations

Intrinsic Error Thresholds in Nearly Critical Toric Codes

Zack Weinstein, Samuel J. Garratt

We study the protection of information in nearly critical topological quantum codes, constructed by perturbing topological stabilizer codes towards continuous quantum phase transitions. Our focus is on the transverse-field toric code subjected to local Pauli decoherence. Despite the strong quantum fluctuations of anyons when the transverse field is tuned infinitesimally close to the critical point, we show that a finite strength of Pauli decoherence remains necessary to irreversibly destroy information encoded in the ground-state manifold. Using a replica statistical physics mapping for the coherent information, we show that decoherence can be understood as introducing a two-dimensional inter-replica defect within a three-dimensional replica statistical physics model. A field theoretical analysis shows that this defect is perturbatively irrelevant to the bulk critical point, and cannot renormalize the transverse field strength, leading to a finite error threshold. We argue that a qualitatively similar conclusion can be drawn for a broad class of nearly critical topological codes, under a variety of decoherence channels.

cond-mat.stat-mechCross-listedarXiv:2603.14098•Mar 17, 2026•4 citations

Robust decoding in monitored dynamics of open quantum systems with Z_2 symmetry

Yaodong Li, Matthew P. A. Fisher

We explore a class of quantum circuit models with local decoherence (noise) and local projective measurements, each respecting a global Z_2 symmetry. The model supports a spin glass phase where the Z_2 symmetry is spontaneously broken (not possible in an equilibrium 1d system), a paramagnetic phase characterized by a divergent susceptibility, and an intermediate trivial phase. All three phases are also stable to Z_2-symmetric local unitary gates, and the dynamical phase transitions between the phases are in the percolation universality class. The open circuit dynamics can be purified by explicitly introducing a bath with its own scrambling dynamics, as in [Bao, Choi, Altman, arXiv:2102.09164], which does not change any of the universal physics. Within the spin glass phase the circuit dynamics can be interpreted as a quantum repetition code, with each stabilizer of the code measured stochastically at a finite rate, and the decoherences as effective bit-flip errors. Motivated by the geometry of the spin glass phase, we devise a novel decoding algorithm for recovering an arbitrary initial qubit state in the code space, assuming knowledge of the history of the measurement outcomes, and the ability of performing local Pauli measurements and gates on the final state. For a circuit with L^d qubits running for time T, the time needed to execute the decoder scales as O(L^d T) (with dimensionality d). With this decoder in hand, we find that the information of the initial encoded qubit state can be retained (and then recovered) for a time logarithmic in L for a 1d circuit, and for a time at least linear in L in 2d below a finite error threshold. For both the repetition and toric codes, we compare and contrast our decoding algorithm with earlier algorithms that map the error model to the random bond Ising model.

•Aug 11, 2021•5 citations

Floquet Majorana XYZ Codes with Tunable Logical Dynamics

Xinyu Sun, Hong Yao

We construct Floquet codes from the Majorana XYZ subsystem code with local realizations both in qubits and directly in microscopic Majorana modes with lattice size $L\times L$. For a three-step cycle, odd $L$ supports one static logical qubit, whereas even $L$ supports two. For even $L$ with $L=4n+2$, both logical qubits admit time-independent Pauli representatives. For $L=4n$, by contrast, one Pauli of the second logical qubit remains fixed throughout the cycle, while every representative of its conjugate must evolve through the measurement cycle. This distinction follows from a parity-dependent algebraic obstruction and disappears when the cycle is reduced to two steps, which restores a fully static logical pair. Thus, the same encoded logical degree of freedom can be switched between static and partially dynamical forms by the measurement schedule. With one open direction, suitable protocols can be implemented using only local Majorana parity measurements. To our knowledge, this is the first Floquet-code family with both a local qubit representation and a direct microscopic Majorana realization.

quant-pharXiv:2609.10683•Sep 11, 2026•0 citations
Floquet code is a dynamical quantum memory with a periodically evolving logical space. As a defining feature, the code exhibits an anyon automorphism after each period, giving rise to a nontrivial evolution of each logical state. In this paper, we study the Floquet code under local decoherence and perfect measurements and demonstrate that, below the decoherence threshold, the code is in a robust phase characterized by the anyon automorphism. We first derive the three-dimensional (3D) statistical mechanics model for the maximum likelihood decoder of the two-dimensional (2D) Floquet code under local Pauli decoherence. We identify a class of two-qubit Pauli channels under which the 3D statistical mechanics model becomes decoupled 2D models and obtain the threshold for such decoherence channels. We then propose a diagnostic of the anyon automorphism in the presence of local decoherence. We analytically show that this diagnostic distinguishes the Floquet code from the toric code under repeated syndrome measurements and undergoes a phase transition at the threshold.
Topological order is a promising basis for quantum error correction, a key milestone towards large-scale quantum computing. Floquet codes provide a dynamical scheme for this while also exhibiting Floquet-enriched topological order where anyons periodically undergo a measurement-induced automorphism that acts uniformly in space. We study disordered Floquet codes where automorphisms have a spatiotemporally heterogeneous distribution: the automorphisms “compete.” We characterize the effect of this competition, showing how key features of the purification dynamics of mixed code states can be inferred from anyon and automorphism properties for any Abelian topological order. This perspective can explain the preservation or measurement of logical information in a dynamic automorphism (DA) code when subjected to a noise model of missing measurements. We demonstrate this using a DA color code with perturbed measurement sequences. The framework of competing automorphisms captures essential features of Floquet codes and robustness to noise, and may elucidate key mechanisms involving topological order, automorphisms, and fault tolerance.
Floquet quantum error-correcting codes provide an operationally economical route to fault tolerance by dynamically generating stabilizer structures using only two-body Pauli measurements. But while it is well established that stabilizer codes in higher spatial dimensions gain additional levels of intrinsic robustness, higher-dimensional Floquet codes have hitherto been explored only in limited scope. Here we introduce a 3d generalization of a Floquet code whose instantaneous stabilizer group realizes a 3d fermionic toric code, while crucially preserving all three logical qubits throughout the entire measurement sequence. One central ingredient is the identification of a 3d lattice geometry that generalizes the features of the Kekulé lattice underlying the 2d Hastings-Haah code - specifically, a structure where deleting any one edge color yields a two-color subgraph that decomposes into short, closed loops rather than homologically nontrivial chains. This loop property avoids the collapse of logical information that plagues naive sequential two-color measurement schedules on many 3d lattices. Although, for our lattice geometry, a simple 3-round cycle that sequentially measures the three types of parity checks does not expose the full error syndrome set, we show that one can append a measurement sequence to extract the missing syndromes without disturbing the logical subspace. Beyond code design, 3d tricoordinated lattice geometries define a family of 3d monitored Kitaev models, in which random measurements of the non-commuting parity checks give rise to dynamically created entangled phases with nontrivial topology. In discussing the general structure of their underlying phase diagrams and, in particular, the existence of certain quantum critical points, we again make a connection to the general preservation of logical information in time-ordered Floquet protocols.
Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of noncommuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as the three-dimensional (3D) toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of the 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of the 3D toric code up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of the 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford controlled-controlled- Z gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite depth equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to three dimensions, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code. Published by the American Physical Society 2024
We study the protection of information in nearly critical topological quantum codes, constructed by perturbing topological stabilizer codes towards continuous quantum phase transitions. Our focus is on the transverse-field toric code subjected to local Pauli decoherence. Despite the strong quantum fluctuations of anyons when the transverse field is tuned infinitesimally close to the critical point, we show that a finite strength of Pauli decoherence remains necessary to irreversibly destroy information encoded in the ground-state manifold. Using a replica statistical physics mapping for the coherent information, we show that decoherence can be understood as introducing a two-dimensional inter-replica defect within a three-dimensional replica statistical physics model. A field theoretical analysis shows that this defect is perturbatively irrelevant to the bulk critical point, and cannot renormalize the transverse field strength, leading to a finite error threshold. We argue that a qualitatively similar conclusion can be drawn for a broad class of nearly critical topological codes, under a variety of decoherence channels.
We explore a class of quantum circuit models with local decoherence (noise) and local projective measurements, each respecting a global Z_2 symmetry. The model supports a spin glass phase where the Z_2 symmetry is spontaneously broken (not possible in an equilibrium 1d system), a paramagnetic phase characterized by a divergent susceptibility, and an intermediate trivial phase. All three phases are also stable to Z_2-symmetric local unitary gates, and the dynamical phase transitions between the phases are in the percolation universality class. The open circuit dynamics can be purified by explicitly introducing a bath with its own scrambling dynamics, as in [Bao, Choi, Altman, arXiv:2102.09164], which does not change any of the universal physics. Within the spin glass phase the circuit dynamics can be interpreted as a quantum repetition code, with each stabilizer of the code measured stochastically at a finite rate, and the decoherences as effective bit-flip errors. Motivated by the geometry of the spin glass phase, we devise a novel decoding algorithm for recovering an arbitrary initial qubit state in the code space, assuming knowledge of the history of the measurement outcomes, and the ability of performing local Pauli measurements and gates on the final state. For a circuit with L^d qubits running for time T, the time needed to execute the decoder scales as O(L^d T) (with dimensionality d). With this decoder in hand, we find that the information of the initial encoded qubit state can be retained (and then recovered) for a time logarithmic in L for a 1d circuit, and for a time at least linear in L in 2d below a finite error threshold. For both the repetition and toric codes, we compare and contrast our decoding algorithm with earlier algorithms that map the error model to the random bond Ising model.
We construct Floquet codes from the Majorana XYZ subsystem code with local realizations both in qubits and directly in microscopic Majorana modes with lattice size L×LL\times LL×L. For a three-step cycle, odd LLL supports one static logical qubit, whereas even LLL supports two. For even LLL with L=4n+2L=4n+2L=4n+2, both logical qubits admit time-independent Pauli representatives. For L=4nL=4nL=4n, by contrast, one Pauli of the second logical qubit remains fixed throughout the cycle, while every representative of its conjugate must evolve through the measurement cycle. This distinction follows from a parity-dependent algebraic obstruction and disappears when the cycle is reduced to two steps, which restores a fully static logical pair. Thus, the same encoded logical degree of freedom can be switched between static and partially dynamical forms by the measurement schedule. With one open direction, suitable protocols can be implemented using only local Majorana parity measurements. To our knowledge, this is the first Floquet-code family with both a local qubit representation and a direct microscopic Majorana realization.