Table of Contents
Fetching ...

Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing

Aygul Azatovna Galimova

TL;DR

Hyperbolic and semi-hyperbolic Floquet codes are constructed from $\{8,3\}$, $\{10,3\}$, and $\{12,3\}$ tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and evaluated under four noise models.

Abstract

Tailoring error correcting codes to the structure of the physical noise can reduce the overhead of fault-tolerant quantum computation. Hyperbolic Floquet codes use only weight-2 measurements and can be implemented directly on hardware with native pair measurements. 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. The $\{10,3\}$ and $\{12,3\}$ families are new to hyperbolic Floquet codes. We evaluate these codes under four noise models: phenomenological, ancilla Entangling Measurement (EM3), Single-step Depolarizing EM3 (SDEM3), and erasure. Under phenomenological noise, specific-logical threshold crossings occur near $p_e \approx 0.3$--$0.5\%$ for $\{8,3\}$ ($k=6$--$56$) and $0.15$--$0.2\%$ for $\{10,3\}$ ($k=12$--$146$). EM3 ancilla noise yields a threshold of ${\sim}1.5\%$ for all three families. SDEM3 is a depolarizing noise model motivated by Majorana tetron architectures; fine-grained codes achieve thresholds of ${\sim}1.0$--$1.2\%$ for all three families. The erasure model captures detected photon loss on spin-optical links; fine-grained codes achieve erasure thresholds of ${\sim}8.5$--$9\%$ for $\{8,3\}$, ${\sim}7$--$8\%$ for $\{10,3\}$, and ${\sim}6.5$--$8\%$ for $\{12,3\}$. Photon loss is the dominant error source in photon-mediated quantum computing. Under the full three-parameter SPOQC-2 noise model, the $\{8,3\}$ codes achieve a 2D fault-tolerant area $2.2\times$ that of the surface code compiled to pair measurements while encoding $k = 10$ logical qubits. In a companion paper, we evaluate the same code families in a distributed setting.

Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing

TL;DR

Hyperbolic and semi-hyperbolic Floquet codes are constructed from , , and tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and evaluated under four noise models.

Abstract

Tailoring error correcting codes to the structure of the physical noise can reduce the overhead of fault-tolerant quantum computation. Hyperbolic Floquet codes use only weight-2 measurements and can be implemented directly on hardware with native pair measurements. We construct hyperbolic and semi-hyperbolic Floquet codes from , , and tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm. The and families are new to hyperbolic Floquet codes. We evaluate these codes under four noise models: phenomenological, ancilla Entangling Measurement (EM3), Single-step Depolarizing EM3 (SDEM3), and erasure. Under phenomenological noise, specific-logical threshold crossings occur near -- for (--) and -- for (--). EM3 ancilla noise yields a threshold of for all three families. SDEM3 is a depolarizing noise model motivated by Majorana tetron architectures; fine-grained codes achieve thresholds of -- for all three families. The erasure model captures detected photon loss on spin-optical links; fine-grained codes achieve erasure thresholds of -- for , -- for , and -- for . Photon loss is the dominant error source in photon-mediated quantum computing. Under the full three-parameter SPOQC-2 noise model, the codes achieve a 2D fault-tolerant area that of the surface code compiled to pair measurements while encoding logical qubits. In a companion paper, we evaluate the same code families in a distributed setting.
Paper Structure (46 sections, 5 theorems, 21 equations, 14 tables)

This paper contains 46 sections, 5 theorems, 21 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