Tesseract: A Search-Based Decoder for Quantum Error Correction

• URL: http://arxiv.org/abs/2503.10988v1
• Date: Fri, 14 Mar 2025 01:23:53 GMT
• Title: Tesseract: A Search-Based Decoder for Quantum Error Correction
• Authors: Laleh Aghababaie Beni, Oscar Higgott, Noah Shutty,
• Abstract summary: Tesseract is a Most-Likely Error decoder for low-density-parity-check quantum error-correcting codes.<n>We show that Tesseract is significantly faster than integer programming while retaining moderate physical error rates.<n>We also find that Tesseract can decode protocols for surface codes on neutral atom quantum computers.
• Score: 0.029541734875307393
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tesseract is a Most-Likely Error decoder designed for low-density-parity-check quantum error-correcting codes. Tesseract conducts a search through a graph on the set of all subsets of errors to find the lowest cost subset of errors consistent with the input syndrome. Although this graph is exponentially large, the search can be made efficient in practice for random errors using $A^*$ search technique along with a few pruning heuristics. We show through benchmark circuits for surface, color, and bivariate-bicycle codes that Tesseract is significantly faster than integer programming-based decoders while retaining comparable accuracy at moderate physical error rates. We also find that Tesseract can decode transversal CNOT protocols for surface codes on neutral atom quantum computers. Finally, we compare surface code and bivariate bicycle code circuits, finding that the [[144,12,12]] bivariate bicycle code is $14\times$ to $19\times$ more efficient than surface codes using our most-likely error decoding, whereas using correlated matching and BP+OSD decoders would have implied only a $10\times$ improvement. Assuming instead that long-range couplers are $10\times$ noisier, the improvement drops to around $4\times$ using Tesseract or $2\times$ using correlated matching and BP+OSD.

Related papers

• Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes [0.42542143904778074]
  We present a recurrent, transformer-based neural network designed to decode circuit-level noise on Bi Bicycle (BB) codes. For the $[[72,12,6]]$ BB code, at a physical error rate of $p=0.1%$, our model achieves a logical error rate almost $5$ times lower than belief propagation. These results demonstrate that machine learning decoders can out-perform conventional decoders on QLDPC codes.
  arXiv  Detail & Related papers  (2025-04-17T15:57:16Z)
• Single-shot and two-shot decoding with generalized bicycle codes [0.027042267806481293]
  Generalized-bicycle (GB) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators.<n>We constructed several short GB codes with relatively large dimensions, distances, and syndrome, also admitting fault-tolerant near-time-optimal syndrome measurement schedules.
  arXiv  Detail & Related papers  (2025-02-26T18:54:19Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  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)
• Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates [0.0]
  Quantum computers will require resource-efficient error-correcting codes. Instead of distance, a more useful qubit-saving metric would be based on logical error rates. We find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes.
  arXiv  Detail & Related papers  (2024-09-23T07:27:20Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• The closed-branch decoder for quantum LDPC codes [0.0]
  Real-time decoding is a necessity for implementing arbitrary quantum computations on the logical level. We present a new decoder for Quantum Low Density Parity Check (QLDPC) codes, named the closed-branch decoder.
  arXiv  Detail & Related papers  (2024-02-02T16:22:32Z)
• 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)
• Exact results on finite size corrections for surface codes tailored to biased noise [0.0]
  We study the XY and XZZX surface codes under phase-biased noise. We find exact solutions at a special disordered point. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate.
  arXiv  Detail & Related papers  (2024-01-08T16:38:56Z)
• 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)
• Instantaneous Grammatical Error Correction with Shallow Aggressive Decoding [57.08875260900373]
  We propose Shallow Aggressive Decoding (SAD) to improve the online inference efficiency of the Transformer for instantaneous Grammatical Error Correction (GEC) SAD aggressively decodes as many tokens as possible in parallel instead of always decoding only one token in each step to improve computational parallelism. Experiments in both English and Chinese GEC benchmarks show that aggressive decoding could yield the same predictions but with a significant speedup for online inference.
  arXiv  Detail & Related papers  (2021-06-09T10:30:59Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

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.