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

• URL: http://arxiv.org/abs/2602.12685v1
• Date: Fri, 13 Feb 2026 07:39:02 GMT
• Title: Floquet implementation of a 3d fermionic toric code with full logical code space
• Authors: Yoshito Watanabe, Bianca Bannenberg, Simon Trebst,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups [0.0]
  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.
  arXiv  Detail & Related papers  (2026-01-29T15:31:44Z)
• SPAN: Spatial-Projection Alignment for Monocular 3D Object Detection [49.12928389918159]
  Existing monocular 3D detectors typically tame the pronounced nonlinear regression of 3D bounding box through decoupled prediction paradigm.<n>We propose novel Spatial-Projection Alignment (SPAN) with two pivotal components.<n>SPAN enforces an explicit global spatial constraint between the predicted and ground-truth 3D bounding boxes, thereby rectifying spatial drift caused by decoupled attribute regression.<n>3D-2D Projection Alignment ensures that the projected 3D box is aligned tightly within its corresponding 2D detection bounding box on the image plane, mitigating projection misalignment overlooked in previous works.
  arXiv  Detail & Related papers  (2025-11-10T04:48:48Z)
• GeoPurify: A Data-Efficient Geometric Distillation Framework for Open-Vocabulary 3D Segmentation [57.8059956428009]
  Recent attempts to transfer features from 2D Vision-Language Models to 3D semantic segmentation expose a persistent trade-off.<n>We propose GeoPurify that applies a small Student Affinity Network to 2D VLM-generated 3D point features using geometric priors distilled from a 3D self-supervised teacher model.<n>Benefiting from latent geometric information and the learned affinity network, GeoPurify effectively mitigates the trade-off and achieves superior data efficiency.
  arXiv  Detail & Related papers  (2025-10-02T16:37:56Z)
• Seeing 3D Through 2D Lenses: 3D Few-Shot Class-Incremental Learning via Cross-Modal Geometric Rectification [59.17489431187807]
  We propose a framework that enhances 3D geometric fidelity by leveraging CLIP's hierarchical spatial semantics.<n>Our method significantly improves 3D few-shot class-incremental learning, achieving superior geometric coherence and robustness to texture bias.
  arXiv  Detail & Related papers  (2025-09-18T13:45:08Z)
• Phases of Floquet code under local decoherence [0.0]
  Floquet code is a dynamical quantum memory with a periodically evolving logical space.<n>As a defining feature, the code exhibits an anyon automorphism after each period, giving rise to a non-trivial evolution of each logical state.<n>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.
  arXiv  Detail & Related papers  (2025-04-26T22:28:20Z)
• Universal fault tolerant quantum computation in 2D without getting tied in knots [1.796950496605906]
  We show how to perform fault-tolerant non-Clifford gates in two dimensions.<n>We formulate a path framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits.
  arXiv  Detail & Related papers  (2025-03-19T23:59:46Z)
• 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)
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models [44.99833362998488]
  Topological subsystem codes allow for quantum error correction with no time overhead, even in the presence of measurement noise. We provide a systematic construction of a class of codes in three dimensions built from abelian quantum double models in one fewer dimension. Our construction not only generalizes the recently introduced subsystem toric code, but also provides a new perspective on several aspects of the original model.
  arXiv  Detail & Related papers  (2023-05-10T18:00:01Z)
• 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)
• 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)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)
• Cylindrical and Asymmetrical 3D Convolution Networks for LiDAR Segmentation [81.02742110604161]
  State-of-the-art methods for large-scale driving-scene LiDAR segmentation often project the point clouds to 2D space and then process them via 2D convolution. We propose a new framework for the outdoor LiDAR segmentation, where cylindrical partition and asymmetrical 3D convolution networks are designed to explore the 3D geometric pat-tern. Our method achieves the 1st place in the leaderboard of Semantic KITTI and outperforms existing methods on nuScenes with a noticeable margin, about 4%.
  arXiv  Detail & Related papers  (2020-11-19T18:53:11Z)

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.