High-rate qLDPC processors

• URL: http://arxiv.org/abs/2607.28795v1
• Date: Thu, 30 Jul 2026 19:43:04 GMT
• Title: High-rate qLDPC processors
• Abstract summary: We introduce a family of qLDPC processor codes of encoding rate $20%$ and check weight $9$, based on non-abelian groups.<n>Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware.
• Score: 2.9793870820216486
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode remains a challenge. We introduce mitten codes, a family of qLDPC processor codes of encoding rate $20\%$ and check weight $9$, based on non-abelian groups. Their non-abelian structure evades distance bounds constraining abelian counterparts, allowing mitten codes to reach distance $18$ and beyond with just a few hundred data qubits. The logical operators of a mitten code are related by the group action, yielding a modular, low-overhead logical toolkit: full Clifford operations follow from bridging two reusable seed surgery gadgets or from a single fixed extractor. Furthermore, qLDPC processors based on mitten codes support high-rate surgery that executes many logical measurements in parallel, and parallel magic-state injection into all logical qubits at once. Under circuit-level noise, with our fast decoder, the $[\![300,60,14]\!]$ mitten code achieves, without extrapolation, a block logical error rate of ${\sim}10^{-11}$ per round at $0.1\%$ physical error rate (PER), while the $[\![ 975,195,\leq 24 ]\!]$ code reaches ${\sim}10^{-8}$ at $0.4\%$ PER. Decoding $15$ billion surgery experiments on the $[\![540,108,18]\!]$ code at $0.1\%$ PER, we observe only two logical failures, demonstrating a qLDPC processor capable of running ${\sim}10^{10}$ logical operations. Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware. Discovered by an end-to-end design pipeline built on sQetch, a distance estimator orders of magnitude faster than existing tools, and mapping efficiently onto near-term neutral atom and superconducting hardware, mitten codes open a practical path toward fault-tolerant quantum computation.

Related papers

• Multi-agent discovery of practical quantum LDPC codes [2.763808510474517]
  Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks.<n>Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes.
  arXiv  Detail & Related papers  (2026-08-10T01:32:34Z)
• Quantum error correction at ultra-low overhead [0.0]
  Suppressing errors is the central challenge for useful large-scale quantum computing.<n>We introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes.<n>Results bring demonstrations of ultra-low overhead quantum error correction within the reach of near-term quantum processors.
  arXiv  Detail & Related papers  (2026-08-03T18:13:57Z)
• Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes [4.569242390849337]
  Scheme achieves constant qubit overhead and a time overhead of $O(da+o(1))$ for any $[[n,k,d]]$ qLDPC code with constant encoding rate and distance $d = Omega(n1/a)$.<n>Results establish a new paradigm for accelerating fault-tolerant quantum computation on qLDPC codes, while maintaining low overhead and broad applicability.
  arXiv  Detail & Related papers  (2025-10-22T10:15:40Z)
• Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC [2.511618458985613]
  We propose a measurement-based FTQC architecture for high-connectivity platforms such as trapped ions and neutral atoms.<n>Key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation.<n>We present two implementations benchmarked under circuit-level depolarizing noise.
  arXiv  Detail & Related papers  (2025-10-21T14:02:20Z)
• Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees [5.090189387045667]
  We introduce a generic and scalable method for magic state injection into logical qubits encoded in qLDPC codes.<n>A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure.
  arXiv  Detail & Related papers  (2025-05-11T13:44:10Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
  Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes.<n>We present a code surgery scheme, applicable to any qubit stabiliser low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
  arXiv  Detail & Related papers  (2025-03-06T22:05: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 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)
• 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)
• Hardware-Aware Parallel Prompt Decoding for Memory-Efficient Acceleration of LLM Inference [23.633481089469836]
  Auto-regressive decoding of Large Language Models (LLMs) results in significant overheads in their hardware performance.<n>We propose a novel parallel prompt decoding that requires only $0.0002$% trainable parameters, enabling efficient training on a single A100-40GB GPU in just 16 hours.<n>Our approach demonstrates up to 2.49$times$ speedup and maintains a minimal memory overhead of just $0.0004$%.
  arXiv  Detail & Related papers  (2024-05-28T22:19:30Z)
• LDPC-cat codes for low-overhead quantum computing in 2D [3.9373541926236766]
  Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing. An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits. We propose an architecture based on cat qubits suppressed in classical LDPC codes for phase-flips.
  arXiv  Detail & Related papers  (2024-01-17T19:00:05Z)
• 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.