⚛️ quantum physics

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

This paper introduces a 3d Floquet code based on a novel tricoordinated lattice geometry that dynamically realizes a 3d fermionic toric code while preserving all three logical qubits throughout the measurement sequence, overcoming the logical information collapse typical of naive higher-dimensional schedules and establishing connections to monitored Kitaev models with nontrivial topological phases.

Original authors: Yoshito Watanabe, Bianca Bannenberg, Simon Trebst

Published 2026-03-27

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Yoshito Watanabe, Bianca Bannenberg, Simon Trebst

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to build a super-secure vault to store a precious secret (quantum information). The problem is that the vault is constantly being shaken by earthquakes (noise and errors), and if you try to check the locks too often, you might accidentally break the vault open yourself.

This paper introduces a clever new design for such a vault, specifically for a 3D world, using a method called a Floquet Code. Here is the story of how they did it, explained simply.

1. The Problem: The "Shaky" Vault

In the world of quantum computers, information is fragile. To protect it, scientists use "error-correcting codes." Think of these as a grid of locks (stabilizers) that hold the information in place.

The Old Way: To check if a lock is broken, you usually need to measure four locks at once. This is hard to do in real life because it requires complex machinery.
The New Way (Floquet): Instead of checking four locks at once, imagine checking them two at a time, one after another, in a repeating rhythm. It's like a dance: Step 1, Step 2, Step 3, repeat. This is much easier to build.

2. The 2D Success Story: The Honeycomb Dance

Scientists previously figured out how to do this dance on a flat, 2D surface (like a honeycomb pattern). They colored the edges of the honeycomb with three colors: Red, Blue, and Green.

They measure all Red links, then all Blue, then all Green, and repeat.
The Magic Trick: If you remove all the Red links, the remaining Blue and Green links break into tiny, isolated loops. They don't stretch across the whole floor. This is crucial because if a link stretched all the way across, measuring it would accidentally destroy the secret inside.

3. The 3D Challenge: Building a Tower

The researchers wanted to take this dance and build it in 3D (a tower or a cube). Why? Because 3D vaults are naturally more robust and can store more secrets (three "logical qubits" instead of just one or two).

However, they hit a wall. When they tried to build a 3D version of the honeycomb dance:

The Trap: In many 3D shapes, if you remove the "Red" links, the remaining "Blue and Green" links don't break into tiny loops. Instead, they form long, infinite chains that snake through the entire building.
The Consequence: If you try to measure these long chains, you accidentally measure the "secret" itself, and the vault collapses. The information is lost.

4. The Solution: The "3D Kekulé-Kitaev" Lattice

The authors (Watanabe, Bannenberg, and Trebst) invented a brand-new 3D shape to solve this. Think of it as a very specific, twisted 3D grid made of squares and octagons.

The Geometry: They designed this shape so that no matter which color of link you remove (Red, Blue, or Green), the remaining links always break into tiny, closed loops. There are no long chains.
The Result: Because the remaining links are just tiny loops, you can measure them without ever touching the main secret. This allows them to preserve three distinct secrets (logical qubits) throughout the entire dance.

5. The 10-Step Dance (The Protocol)

In the 2D version, the dance was simple: Red $\to$ Blue $\to$ Green $\to$ Repeat (3 steps).
In their new 3D version, a simple 3-step dance wasn't enough to catch all the errors. It was like trying to check a 3D building with only three cameras; you'd miss some blind spots.

So, they choreographed a 10-step dance:

They do the basic Red $\to$ Blue $\to$ Green cycle.
Then, they add extra, specialized steps to check the "blind spots" (specific types of loops they missed).
By the time they finish the 10 steps, they have a complete map of all errors, but they haven't touched the secrets.
The dance repeats, keeping the vault secure forever.

6. The "Random" Connection: The Phase Diagram

The paper also looked at what happens if you don't follow the strict dance, but instead measure links randomly (like a chaotic storm hitting the vault).

They found that if the shape of the vault is "wrong" (like the ones with long chains), the random storm destroys the order.
But with their special "3D Kekulé" shape, the vault stays stable even in the chaos.
This proves that the geometry of the building is just as important as the security guards. If the building is designed right, the secrets survive even when the guards are acting randomly.

Summary Analogy

Imagine you are trying to keep three balls floating in the air (the secrets) while a windstorm (errors) tries to knock them down.

Old 3D attempts: The wind would blow through the room in long tunnels, knocking the balls out of the air.
This new design: The room is built with so many small, isolated nooks and crannies (the tiny loops) that the wind gets trapped in small pockets. It can't form a long tunnel to knock the balls out.
The 10-step dance: It's a specific routine of fans blowing in different directions to keep the balls floating, ensuring that even if the wind is chaotic, the routine catches every gust.

Why does this matter?
This is a major step toward building a real, fault-tolerant quantum computer. It shows that we can store more information (3 qubits) in a 3D space using simple, easy-to-build measurements, provided we design the "architecture" of the computer correctly.

1. Problem Statement

The paper addresses the challenge of constructing Floquet quantum error-correcting codes in three spatial dimensions (3D) that maintain full logical code space (preserving all logical qubits) throughout a dynamic measurement sequence.

Context: While 2D Floquet codes (e.g., the Hastings-Haah code on a Kekulé honeycomb lattice) successfully generate stabilizer codes using only two-body Pauli measurements, extending this to 3D is non-trivial.
The Obstacle: In many known 3D tricoordinated lattices (e.g., hyperhoneycomb), removing edges of a single color (bond type) leaves behind homologically non-trivial chains (bi-infinite loops). In a sequential measurement schedule (e.g., $z \to x \to y$ ), measuring two colors at a time generates operators that coincide with logical operators, causing the collapse of the logical subspace.
Goal: Design a 3D lattice geometry and measurement protocol that realizes a 3D Fermionic Toric Code (fTC) as an Instantaneous Stabilizer Group (ISG) while preserving all three logical qubits and enabling full error syndrome extraction.

2. Methodology

A. Lattice Design: The 3D Kekulé-Kitaev Lattice

The authors construct a novel 3D tricoordinated lattice (the 3D Kekulé-Kitaev lattice) based on specific geometric constraints:

Tricoordination: Every vertex connects exactly three edges.
3-Edge Coloring: Edges are colored $x, y, z$ such that no two edges of the same color meet at a vertex.
The "Finite-Loop" Property (Crucial Innovation): Removing any single color must leave a subgraph composed only of finite, closed loops, with no homologically non-trivial chains.
- Construction: The lattice consists of stacked square-octagon layers coupled by vertical $z$ -type bonds. The unit cell contains 24 sites (12 per layer). The edge coloring doubles the translation period, resulting in a 96-site unit cell.
- Geometry: The lattice features both coplanar plaquettes ( $p_1, p_2, p_3$ ) and non-coplanar plaquettes ( $p_4, p_5, p_6$ ) involving out-of-plane bonds.

B. Measurement Schedule

The authors design a periodic measurement sequence to extract syndromes without disturbing the logical subspace:

Base Cycle: A standard $z \to x \to y$ cycle.
Syndrome Extraction Issue: In 3D, the naive 3-round cycle does not expose all plaquette syndromes (specifically missing $p_2$ and some $p_4, p_6$ ).
Solution: The authors append additional selective measurement rounds to the base cycle, creating a 10-round cycle:
1. Full $z$ round.
2. Full $x$ round.
3. Full $y$ round.
4. Selective $z$ (intra-unit-cell).
5. Full $x$ round.
6. Selective $z$ (restricted to $p_2$ plaquettes).
7. Selective $y$ (restricted to $p_2$ plaquettes).
8. Full $x$ round.
9. Selective $z$ (inter-unit-cell).
10. Full $y$ round.
Result: This schedule allows the extraction of all error syndromes (via direct measurement or volume constraints) while ensuring the logical operators remain unmeasured.

C. Logical Operators and Fermionic Nature

Logical Qubits: The model encodes three logical qubits on a 3-torus.
Operators:
- Line Operators (Inner Logical): Non-contractible loops of bond operators (e.g., $Z$ on $z$ -bonds). These commute with all checks and are round-independent.
- Membrane Operators (Outer Logical): Transverse surfaces.
Fermionic Statistics: The point-like excitations (endpoints of open strings) exhibit fermionic self-statistics. This is diagnosed via the $T$ -junction exchange algebra, where exchanging two charges around a trivalent vertex yields a $-1$ phase. This distinguishes the 3D fTC from the bosonic toric code.

D. Random Measurement Dynamics (Monitored Kitaev Models)

Beyond error correction, the authors analyze the system as a monitored Kitaev model where bond types are measured randomly with probabilities $(p_x, p_y, p_z)$ .

Phase Diagram: They map the entanglement scaling ( $S \sim L^{d-1}$ vs. $S \sim L^{d-1} \log L$ ) to identify phases.
Criticality Criterion: They establish a geometric link: if removing a color leaves only finite loops, the edge of the phase diagram (where that color is absent) is non-critical (no percolation transition). If it leaves infinite chains, the edge is critical.

3. Key Contributions

First Full 3D Floquet Code: Introduction of the first Floquet code in 3D that preserves all three logical qubits throughout the entire measurement cycle. Previous 3D attempts (e.g., on hyperhoneycomb lattices) could only preserve a single logical qubit.
Novel Lattice Geometry: The design of the 3D Kekulé-Kitaev lattice, which satisfies the "finite-loop" condition for all three colors, solving the logical collapse problem inherent in other 3D lattices.
10-Round Syndrome Extraction: A concrete measurement protocol that overcomes the limitation of the naive 3-round cycle by adding selective rounds to extract missing syndromes ( $p_2, p_4, p_6$ ) without disturbing the code space.
Geometric-Phase Connection: A rigorous demonstration that the geometric property of "finite-loop subgraphs" (required for logical preservation in Floquet codes) directly correlates with the absence of critical points along the edges of the random measurement phase diagram.

4. Results

Stabilizer Group: The Instantaneous Stabilizer Group (ISG) at specific times in the cycle is equivalent to the 3D Fermionic Toric Code (fTC).
Logical Preservation: Numerical simulations and operator algebra confirm that the 10-round cycle implements a trivial logical automorphism, meaning the logical information is perfectly preserved (up to Clifford frame changes) after one full cycle.
Phase Diagrams:
- Hyperhoneycomb Lattice: Exhibits percolation critical points at the midpoints of the phase diagram edges (consistent with the presence of infinite chains when one color is removed).
- 3D Kekulé Lattice: Shows no critical points along the edges of the phase diagram (consistent with the finite-loop property). The critical region is confined to the center of the diagram.
Entanglement Scaling: The system exhibits an area-law phase near the corners (single-color dominance) and an extended critical region in the center with $S \sim L^2 \log L$ scaling.

5. Significance

Fault Tolerance: This work provides a viable pathway to 3D fault-tolerant quantum computing with reduced operational overhead (using only 2-body measurements). The preservation of three logical qubits is crucial for implementing non-Clifford gates (like the CCZ gate), which naturally act on triples of qubits in 3D topological codes.
Theoretical Insight: It bridges the gap between Floquet error correction and monitored quantum dynamics. The paper suggests that the geometric constraints required for a stable Floquet code (finite loops) are the same constraints that prevent percolation transitions in random measurement dynamics.
Future Directions: The authors propose that this platform could be used to study emergent symmetries, multi-copy parent models (analogous to color codes), and measurement-based quantum computation (MBQC) in higher dimensions.

In summary, the paper successfully generalizes the 2D Floquet code concept to 3D by engineering a specific lattice geometry that avoids logical collapse, thereby enabling a robust, fully functional 3D fermionic topological code with active error correction capabilities.