LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density

• URL: http://arxiv.org/abs/2607.01887v1
• Date: Thu, 02 Jul 2026 08:38:27 GMT
• Title: LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density
• Abstract summary: Long-lived logical qubits are essential for fault-tolerant quantum computation.<n>Traditional error correction protocols rely on performing specific syndrome circuits.<n>We show that flexible circuits within the LUCI framework can maintain space-time distance in the presence of isolated or broken components.
• Score: 1.2547224747420167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Long-lived logical qubits are essential for fault-tolerant quantum computation. However, the practical performance of traditional error correction protocols relies on performing specific syndrome circuits, causing vulnerability to hardware defects and imposing rigid connectivity constraints. Recent theoretical findings have proposed that flexible subroutine circuits within the LUCI framework can maintain space-time distance in the presence of isolated or broken components, albeit at the expense of temporal distance. However, these approaches have solely targeted defect avoidance and have not yet been demonstrated to suppress errors with reduced temporal distances on physical hardware. In this work, we propose a reset-free scenario for the LUCI framework and experimentally benchmark it on IBM quantum hardware. By asymmetrically scaling the $X$ or $Z$ distance, we compare our reset-free approach against the standard surface code and successfully demonstrate error suppression ratios for targeted logical Pauli errors. Remarkably, despite a nearly halved syndrome density in time, which requires two subroutine rounds for full syndrome extraction, the LUCI framework remains competitive with the rotated surface code implementation. In the LUCI framework, we observe error suppression of $1.75(10)$ for logical $X$ errors and $1.93(12)$ for logical $Z$ errors, whereas the standard approach yields $ 1.58(13)$ and $2.44(7)$, respectively. These results demonstrate that dynamic codes outperform standard methods by avoiding highly noisy components, even without physical defects, while preserving logical boundaries. Our findings challenge the conventional dependency on static fault-tolerant architectures by verifying the feasibility and efficacy of the LUCI framework on physical hardware and pave the way for hybrid, hardware-compatible code designs in quantum computing.

Related papers

• WISER: Systematic Design-Space Exploration of Fault-Tolerant Global Control Trapped-Ions [0.2676349883103403]
  Trapped-ion quantum computers are a leading candidate for scalable fault-tolerant quantum computing.<n>We present WISE, a cross-layer architectural design-space exploration framework for globally controlled trapped-ion systems.
  arXiv  Detail & Related papers  (2026-09-11T21:22:31Z)
• Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits [0.0]
  Constant-rate quantum low-density parity-check (LDPC) codes promise fault-tolerant quantum computation with constant spatial overhead in the limit.<n>We introduce a new family of quantum LDPC codes with design rate $1/5$ and check weight $9$ that approaches the teraquop memory regime per qubit-round with several hundred physical qubits.
  arXiv  Detail & Related papers  (2026-07-30T03:55:43Z)
• How LLMs Fail and Generalize in RTL Coding for Hardware Design? [56.361436215029045]
  We introduce a new error taxonomy grounded in problem solvability, inspired by cognitive theory.<n>Our taxonomy categorizes failures into syntactic, semantic, solvable functional, and unsolvable functional types.
  arXiv  Detail & Related papers  (2026-04-26T14:34:49Z)
• A Theory-guided Weighted $L^2$ Loss for solving the BGK model via Physics-informed neural networks [0.0]
  We introduce a velocity-weighted $L2$ loss function designed to effectively penalize errors in the high-velocity regions.<n>We show that employing this weighted PINN loss leads to superior accuracy and robustness across various benchmarks compared to the standard approach.
  arXiv  Detail & Related papers  (2026-04-04T11:13:18Z)
• Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques [0.0]
  We show that intelligent ancilla management improves error suppression by up to 2.4$times$ compared to standard approaches.<n>Our implementations achieve logical error rates as low as $5.1 times 10-5$ under realistic noise conditions.<n>These results provide immediately deployable tools for near-term quantum devices.
  arXiv  Detail & Related papers  (2026-01-10T00:10:52Z)
• Automated Compilation Including Dropouts: Tolerating Defective Components in Stabiliser Codes [0.0]
  Utility-scale solid-state quantum devices will need to fabricate quantum devices at scale using imperfect processes.<n>By introducing tolerance to fabrication defects into the design of quantum devices, we can improve the yield of usable quantum chips and lower the cost of useful systems.<n>ACID is a framework that works in the ancilla-free (or middle-out') paradigm, to generate syndrome extraction circuits.
  arXiv  Detail & Related papers  (2025-12-01T17:55:20Z)
• 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)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• 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)
• LUCI in the Surface Code with Dropouts [0.3105392140394824]
  We present LUCI, a framework for constructing fault-tolerant circuits. LUCI can be used to adapt surface code circuits with latticesically imperfect qubit couplers. We show that LUCI requires roughly fewer physical qubits to reach relevant one-in-a-trillion logical codeblock error rates.
  arXiv  Detail & Related papers  (2024-10-18T22:29:37Z)
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation [36.3664581543528]
  We show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds.<n>Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space-time cost of practical fault-tolerant quantum computation by over an order of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers.<n>The square-lattice surface code has become the workhorse to address this challenge.<n>In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)

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.