Table of Contents
Fetching ...

Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise

Aygul Azatovna Galimova

TL;DR

This work constructs hyperbolic and semi-hyperbolic Floquet codes from $\{8,3\}$, $\{10,3\}$, and $\{12,3\}$ tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and distribute them across QPUs via spectral bisection.

Abstract

Distributing qubits across quantum processing units (QPUs) connected by shared entanglement enables scaling beyond monolithic architectures. Hyperbolic Floquet codes use only weight-2 measurements and are good candidates for distributed quantum error correcting codes. We construct hyperbolic and semi-hyperbolic Floquet codes from $\{8,3\}$, $\{10,3\}$, and $\{12,3\}$ tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and distribute them across QPUs via spectral bisection. The $\{10,3\}$ and $\{12,3\}$ families are new to hyperbolic Floquet codes. We simulate these distributed codes under four noise models: depolarizing, SDEM3, correlated EM3, and erasure. With depolarizing noise ($p_{\text{local}} = 0.03\%$), fine-grained codes achieve non-local pseudo-thresholds up to 3.0\% for $\{8,3\}$, 3.0\% for $\{10,3\}$, and 1.75\% for $\{12,3\}$. Correlated EM3 yields pseudo-thresholds up to 0.75\% for $\{8,3\}$, 0.75\% for $\{10,3\}$, and 0.50\% for $\{12,3\}$; crossing-based thresholds from same-$k$ families are ${\sim}1.75$--$2.9\%$ across all tessellations. Using the SDEM3 model, fine-grained codes achieve distributed pseudo-thresholds of 1.75\% for $\{8,3\}$, 1.25\% for $\{10,3\}$, and 1.00\% for $\{12,3\}$. Under erasure noise motivated by spin-optical architectures, thresholds at 1\% local loss are 35--40\% for $\{8,3\}$, 30--35\% for $\{10,3\}$, and 25--30\% for $\{12,3\}$.

Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise

TL;DR

This work constructs hyperbolic and semi-hyperbolic Floquet codes from , , and tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and distribute them across QPUs via spectral bisection.

Abstract

Distributing qubits across quantum processing units (QPUs) connected by shared entanglement enables scaling beyond monolithic architectures. Hyperbolic Floquet codes use only weight-2 measurements and are good candidates for distributed quantum error correcting codes. We construct hyperbolic and semi-hyperbolic Floquet codes from , , and tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and distribute them across QPUs via spectral bisection. The and families are new to hyperbolic Floquet codes. We simulate these distributed codes under four noise models: depolarizing, SDEM3, correlated EM3, and erasure. With depolarizing noise (), fine-grained codes achieve non-local pseudo-thresholds up to 3.0\% for , 3.0\% for , and 1.75\% for . Correlated EM3 yields pseudo-thresholds up to 0.75\% for , 0.75\% for , and 0.50\% for ; crossing-based thresholds from same- families are -- across all tessellations. Using the SDEM3 model, fine-grained codes achieve distributed pseudo-thresholds of 1.75\% for , 1.25\% for , and 1.00\% for . Under erasure noise motivated by spin-optical architectures, thresholds at 1\% local loss are 35--40\% for , 30--35\% for , and 25--30\% for .
Paper Structure (38 sections, 5 theorems, 20 equations, 14 tables)

This paper contains 38 sections, 5 theorems, 20 equations, 14 tables.

Key Result

Proposition 1

For a surface code on a genus-$g$ surface with $V$ vertices, $E$ edges, and $F$ faces: using the Euler characteristic $\chi = V - E + F = 2 - 2g$. The $F$ face stabilizers satisfy one linear dependency ($\prod_f S_f^Z = I$) and therefore have rank $F - 1$. The $V$ vertex stabilizers satisfy one dependency ($\prod_v S_v^X = I$) and have rank $V - 1$breuckmann2016constructions.

Theorems & Definitions (18)

  • Definition 1: Stabilizer Code
  • Definition 2: Logical Operators
  • Definition 3: Code Distance
  • Definition 4: CSS Code
  • Definition 5: Plaquette and Vertex Stabilizers
  • Proposition 1: Number of Logical Qubits
  • Definition 6: Floquet Face Stabilizer
  • Definition 7: Fundamental Domain
  • Definition 8: Schläfli Symbol
  • Theorem 1: Hyperbolic Condition
  • ...and 8 more