OmniQEC: discovering practical quantum error-correcting codes by an AI scientist

• URL: http://arxiv.org/abs/2607.25865v1
• Date: Tue, 28 Jul 2026 15:31:26 GMT
• Title: OmniQEC: discovering practical quantum error-correcting codes by an AI scientist
• Abstract summary: We introduce OmniQEC, an efficient AI scientist for discovering Quantum error correction codes.<n>At its core, OmniQEC combines a self-evolving reasoning mechanism with a slow--fast synergistic workflow.<n>The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets.
• Score: 20.09408539282161
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing. However, discovering QEC codes that remain effective is challenging, as logical performance depends on the interplay between code structure, hardware, syndrome extraction, and decoding, which often impose competing requirements. Here we introduce OmniQEC, an efficient AI scientist for discovering QEC codes suited to deployment on modern quantum processors. OmniQEC formulates QEC design as an iterative discovery process in which an orchestrator, implemented by advanced large language models (LLMs), coordinates code generation, code-level screening, syndrome-extraction synthesis, and decoder-based circuit evaluation. At its core, OmniQEC combines a self-evolving reasoning mechanism with a slow--fast synergistic workflow: a fast loop explores candidates using inexpensive code-level proxies, whereas a slow loop performs physically grounded circuit-level evaluation and feeds the resulting evidence back into the search. We evaluate OmniQEC across four qLDPC construction families, three LLM backends, and $14$ total-physical-qubit budgets per backend. The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\![72,12,6]\!]$ and $[\![144,12,12]\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively. The discovered codes are hardware-friendly and may be of independent interest for practical QEC implementation. These findings pave the way towards LLM-assisted QEC discovery grounded in physically informed code--circuit--decoder co-design.

Related papers

• Quantum Compiler Design for Fault-Tolerant Quantum Computing [14.739903011159207]
  This survey presents a full-stack view of compiler design for QEC-protected quantum computation.<n>We organize existing work into three interacting layers: logical-level QEC compilation, physical-level QEC realization, and runtime integration.
  arXiv  Detail & Related papers  (2026-09-15T17:05:49Z)
• Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware [2.8712862578745018]
  We introduce a family of qLDPC "barbell" codes accompanied by a realistic chip layout that supports all required two-qubit interactions.<n>We find that, with a modest overhead of $30$ data qubits per logical qubit, barbell codes can preserve information at a physical noise strength of $10-4$ for several trillion QEC cycles.
  arXiv  Detail & Related papers  (2026-06-04T12:01:24Z)
• Real-Time Quantum Error Correction System Stack: Architecture, Algorithms, and Engineering Practice [5.934193075751239]
  Quantum error correction (QEC) is transitioning from physical feasibility demonstrations to systems engineering challenges.<n>Google has achieved below-latency performance on distance-5/7 surface codes.<n>Riverlane and Rigetti have demonstrated hardware-integrated low-threshold feedback loops.
  arXiv  Detail & Related papers  (2026-05-29T02:51:46Z)
• Computing with many encoded logical qubits beyond break-even [1.2694967390354854]
  High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits.<n>We demonstrate computations that outperform their unencoded counterparts in the high-rate.<n>We provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-scale computation.
  arXiv  Detail & Related papers  (2026-02-25T18:59:52Z)
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes [12.687083899824314]
  Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms. We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC) Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
  arXiv  Detail & Related papers  (2023-05-25T06:23:32Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)

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.