Disassembling qLDPC codes for depth-optimal parity-check circuits

• URL: http://arxiv.org/abs/2608.19917v1
• Date: Thu, 20 Aug 2026 11:33:26 GMT
• Title: Disassembling qLDPC codes for depth-optimal parity-check circuits
• Abstract summary: Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing.<n>But their practical implementation requires efficient circuits for syndrome extraction.<n>We show that these symmetries can be exploited to design syndrome-extraction circuits from the underlying components.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing, but their practical implementation requires efficient circuits for syndrome extraction. Many qLDPC families are assembled from a small set of components through explicit constructions that imprint edge symmetries on their Tanner graphs. We show that these symmetries can be exploited to design syndrome-extraction circuits from the underlying components, rather than from the full quantum code. For Lifted Product and Balanced Product codes this approach yields an analytical construction with provably optimal or near-optimal CNOT depth. For Quantum Tanner codes it produces depth-optimal circuits on every instance we test, including codes up to nearly 600 data qubits.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• 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)
• Full Extractors for Logical Processing in Hypergraph Product Codes [4.143735438840213]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories.<n>We construct full extractors -- surgery systems capable of measuring arbitrary logical Pauli operators on a code block.<n>For a distance 10 HGP code, circuit-level noise simulations yield logical measurement error rates of approximately $10-6$ at a physical error rate of 0.1%.
  arXiv  Detail & Related papers  (2026-06-02T11:25:18Z)
• Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation [4.561664406615985]
  We develop methods for synthesizing efficient encoders for arbitrary stabilizer codes.<n>For families with a modular structure, such as tableaud and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders.<n>We obtain improvements of up to 43% in two-qubit gate count and up to 70% in depth.
  arXiv  Detail & Related papers  (2026-05-14T18:00:01Z)
• QUITS: A modular Qldpc code circUIT Simulator [0.6383572393537065]
  QUITS is a modular and flexible circuit-level simulator for QLDPC codes.<n>We introduce a syndrome extraction circuit improved from Tremblay, Delfosse, and Beverland.<n>We evaluate the performance of state-of-the-art QLDPC codes and decoders under various settings.
  arXiv  Detail & Related papers  (2025-04-03T15:14:13Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• 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)
• Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays [5.542275446319411]
  We propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays. Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale.
  arXiv  Detail & Related papers  (2023-08-16T19:47:17Z)
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices [45.997444794696676]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.<n>One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.<n>We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.<n>We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
  arXiv  Detail & Related papers  (2023-08-16T08:24:06Z)
• 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)
• 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)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.