Hyperbolic Floquet code with graph-edge syndromes

• URL: http://arxiv.org/abs/2509.24110v1
• Date: Sun, 28 Sep 2025 23:03:17 GMT
• Title: Hyperbolic Floquet code with graph-edge syndromes
• Authors: Hideyuki Ozawa, Isamu Kudo, Yuki Takeuchi, Tsuyoshi Yoshida,
• Abstract summary: Floquet codes are stabilizer-based codes in which low-weight parity measurements are applied in a time-periodic schedule.<n>Parity measurements in our code consist of the repetitions of six-step measurements on (semi-)hyperbolic three-colorable tilings.<n>Our code on the regular $8,3$ lattice has the following three advantages: (i) parity measurements are weight-2, (ii) for the numbers $k$ and $n$ of logical and physical qubits, respectively, the encoding rate is finite.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction would be a primitive for demonstrating quantum advantage in a realistic noisy environment. Floquet codes are a class of dynamically generated, stabilizer-based codes in which low-weight parity measurements are applied in a time-periodic schedule. Furthermore, for several Floquet codes, the encoding rate becomes finite even for an infinitely large qubit number. However, despite these advantageous properties, existing Floquet codes require handling more intricate, often hypergraph-structured syndromes from the decoding perspective, which makes decoding comparatively demanding. We give a concrete method for solving this issue by proposing hyperbolic color Floquet (HCF) code. To this end, we simultaneously take advantage of hyperbolic Floquet and Floquet color codes. Parity measurements in our code consist of the repetitions of six-step measurements on (semi-)hyperbolic three-colorable tilings. Since each step just measures $X \otimes X$ or $Z \otimes Z$, our code on the regular $\{8,3\}$ lattice has the following three advantages: (i) parity measurements are weight-2, (ii) for the numbers $k$ and $n$ of logical and physical qubits, respectively, the encoding rate is finite, i.e., $\lim_{n \to \infty} k/n = 1/8$, and (iii) the code distance is proportional to $\log n$. From the above property, each single-fault event generally affects at most two detectors, which implies ``graph-edge'' syndromes, and hence decoding with a minimum-weight perfect matching (MWPM) decoder is efficient and virtually scales near-linearly in the number of physical qubits $n$. This is a stark contrast to several known Floquet codes because their parity measurements repeat the measurements of $X\!\otimes\!X$, $Y\!\otimes\!Y$, and $Z\!\otimes\!Z$, and thus the syndromes are represented as a hypergraph, which basically requires decoders with longer decoding time.

Related papers

• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Tailoring Dynamical Codes for Biased Noise: The X$^3$Z$^3$ Floquet Code [0.0]
  We propose the X$3$Z$3$ Floquet code, a dynamical code with improved performance under biased noise.<n>Our work establishes the X$3$Z$3$ code as a prime quantum error-correcting code, particularly for devices with reduced connectivity.
  arXiv  Detail & Related papers  (2024-11-07T18:49:16Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Linear-time Minimum Bayes Risk Decoding with Reference Aggregation [52.1701152610258]
  Minimum Bayes Risk (MBR) decoding is a text generation technique that has been shown to improve the quality of machine translations. It requires the pairwise calculation of a utility metric, which has quadratic complexity. We propose to approximate pairwise metric scores with scores calculated against aggregated reference representations.
  arXiv  Detail & Related papers  (2024-02-06T18:59:30Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.4527817188861902]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes"<n>One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code.<n>At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes [7.059472280274009]
  We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling.
  arXiv  Detail & Related papers  (2023-08-07T17:54:45Z)
• Floquetifying the Colour Code [0.0]
  We use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. This work shines a light on the relationship between'static' stabilizer and subsystem codes and 'dynamic' Floquet codes.
  arXiv  Detail & Related papers  (2023-07-20T17:01:16Z)
• Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
  A fault-tolerant quantum computer must decode and correct errors faster than they appear. We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup. The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
  arXiv  Detail & Related papers  (2023-01-20T04:23:00Z)

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.