Fault-tolerant interfaces for quantum LDPC codes

• URL: http://arxiv.org/abs/2602.16948v1
• Date: Wed, 18 Feb 2026 23:25:29 GMT
• Title: Fault-tolerant interfaces for quantum LDPC codes
• Authors: Matthias Christandl, Omar Fawzi, Ashutosh Goswami,
• Abstract summary: We show that fault-tolerant quantum state preparation can be achieved with constant space overhead.<n>We construct fault-tolerant interfaces that decrease the level of protection for quantum low-density parity-check codes.
• Score: 8.49301882142233
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The preparation of a quantum state using a noisy quantum computer (gate noise strength $δ$), will necessarily affect an O($δ$)-fraction of the qubits, no matter which protocol is used. Here, we show that fault-tolerant quantum state preparation can be achieved with constant space overhead improving on previous constructions requiring polylogarithmic overhead. To achieve this, we add to the toolbox of fault-tolerant schemes for circuits with quantum input and output. More specifically, we construct fault-tolerant interfaces that decrease the level of protection for quantum low-density parity-check (LDPC) codes. When information is encoded in multiple code blocks, our interfaces have constant space overhead. In our decoder construction that change the level of protection by an arbitrary amount, we circumvent bottlenecks to error pileup and overhead by gradual lowering of the level of encoding at the same time as we increase the number of blocks on which decoding is carried out simultaneously.

Related papers

• Demonstrating Noise-adapted Quantum Error Correction With Break-Even Performance [2.7568215535428937]
  We develop a noise-adapted 3-qubit quantum error correction scheme for IBM quantum hardware.<n>We show that the scheme can break-even against native amplitude-damping (AD) noise.<n>Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity.
  arXiv  Detail & Related papers  (2026-03-04T19:50:16Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes [2.048226951354646]
  A major challenge in fault-tolerant quantum computation is to reduce both space overhead and time overhead.<n>We show that a protocol using non-vanishing-rate quantum low-density parity-check codes achieves constant space overhead and polylogarithmic time overhead.
  arXiv  Detail & Related papers  (2024-11-06T06:06:36Z)
• Fault-Tolerant Quantum LDPC Encoders [0.0]
  We propose fault-tolerant encoders for quantum low-density parity (LDPC) codes. By grouping qubits within a quantum code over contiguous blocks, we show how preshared entanglement can be applied.
  arXiv  Detail & Related papers  (2024-05-12T10:16:43Z)
• 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)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation [2.3020018305241337]
  Protocols for fault-tolerant quantum computation demand excessive space overheads.<n>We introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing.<n>Our protocol is fault tolerant even if a decoder has a non-constant runtime.
  arXiv  Detail & Related papers  (2022-07-18T18:00:00Z)
• Low-overhead fault-tolerant quantum computing using long-range connectivity [2.867517731896504]
  Scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check codes. We estimate order-of-magnitude improvements in the overheads for processing around one hundred logical qubits.
  arXiv  Detail & Related papers  (2021-10-20T21:49:48Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.