Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent

• URL: http://arxiv.org/abs/2607.04462v1
• Date: Sun, 05 Jul 2026 19:07:48 GMT
• Title: Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent
• Abstract summary: We formulate LDPC encoder preparation as a circuit-resynthesis problem.<n>We seek a lower-cost equivalent circuit that can be routed efficiently on the target hardware.<n>We show that encoder-matrix resynthesis is an effective compiler-level tool for preparing quantum LDPC code states.
• Score: 7.519872646378835
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum low-density parity-check (LDPC) codes are a promising route to fault-tolerant quantum computation, but their use requires efficient preparation of encoded states. Standard encoder constructions generate circuits through fixed algebraic procedures, yet the resulting circuit can contain substantial redundancy. We formulate LDPC encoder preparation as a circuit-resynthesis problem: given the linear-reversible matrix implemented by the encoder's CNOT block, we seek a lower-cost equivalent circuit that can be routed efficiently on the target hardware and which mitigates noise. We propose a novel optimization approach referred as two-sided Hamming descent and a noise-aware optimization pipeline for this task. Across several families of Calderbank-Shor-Steane (CSS) LDPC encoders, including Bivariate Bicycle, hypergraph-product, and entanglement-assisted codes, the proposed pipeline produces substantially smaller and shallower encoder circuits than the standard constructions and the synthesis baselines considered, cutting gate counts by 53.8% in aggregate across the benchmark and by up to 68% on the Bivariate Bicycle family. The gains remain visible after routing, where the two-qubit depth is reduced by up to 71% and translate into higher-fidelity state preparation under circuit-level noise. On the Bivariate Bicycle family, live-range scheduling further reduces routed preparation failure by up to 13.7% without adding two-qubit gates to the selected circuit. These results indicate that encoder-matrix resynthesis, combined with hardware-calibrated selection and scheduling, is an effective compiler-level tool for preparing quantum LDPC code states.

Related papers

• Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search [6.754749859345508]
  Entment-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices.<n>Their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits)
  arXiv  Detail & Related papers  (2026-06-09T21:57:07Z)
• 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)
• Networked Realization of Quantum LDPC Codes [0.8594140167290097]
  QLDPC codes with good parameters are promising candidates for low-overhead fault-tolerant quantum computing.<n>Their non-local stabilizers require long-range connectivity and frequent qubit movement.<n>We propose and study the networked implementation of better QLDPC codes.
  arXiv  Detail & Related papers  (2026-04-27T22:06:59Z)
• Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures [1.5531887595047786]
  Quantum low-density parity-check codes offer superior encoding rates and large code distance compared to surface codes.<n>Long-range stabilizer measurements pose significant challenges for implementation on realistic hardware with limited connectivity.<n>We introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations.
  arXiv  Detail & Related papers  (2026-04-20T18:14:28Z)
• BWTA: Accurate and Efficient Binarized Transformer by Algorithm-Hardware Co-design [71.97035034203275]
  We analyze zero-point distortion in binarization and propose a Binary Weights & Ternary Activations (BWTA) quantization scheme.<n>For training, we propose Smooth Multi-Stage Quantization, combining a Levelwise Degradation Strategy and a MagnitudeAlignment Projection Factor.<n>Experiments show that BWTA approaches full-precision performance for Transformer-based models, with an average 3.5% drop on GLUE and less than 2% drop on five tasks.
  arXiv  Detail & Related papers  (2026-04-05T04:25:07Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes [0.9558392439655014]
  Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation.<n>A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy.<n>For real-time decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation.<n>We propose degeneracy cutting (DC), an efficient post-processing technique for the BP decoder that operates on information restricted to the support of each stabilizer
  arXiv  Detail & Related papers  (2025-10-09T18:01:30Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• 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)

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.