Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2605.15266v1
• Date: Thu, 14 May 2026 18:00:01 GMT
• Title: Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
• Abstract summary: 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.
• Score: 4.561664406615985
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of efficient general-state encoding circuits an important problem, particularly with respect to two-qubit gate count and circuit depth. Yet the synthesis of such encoders has been studied less extensively than general Clifford circuit synthesis or the preparation of specific logical Pauli-eigenstates. In this work, we develop methods for synthesizing efficient encoders for arbitrary stabilizer codes. We formulate encoder synthesis as a search over stabilizer tableaus and introduce greedy and rollout-based algorithms that exploit the freedom among stabilizer-equivalent realizations of the same encoding isometry. For code families with a modular structure, such as generalized concatenated and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders, and we use SMT-based exact synthesis to obtain optimal local circuits for small instances. We further evaluate the proposed methods on a broad set of stabilizer codes, including holographic and quantum low-density parity-check (qLDPC) codes, and compare them against recent encoder-synthesis methods and existing constructions from the literature, obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth. Our results support the optimization of encoded-state preparation in several fault-tolerant quantum-computing schemes, and all methods are openly available as part of the Munich Quantum Toolkit.

Related papers

• Disassembling qLDPC codes for depth-optimal parity-check circuits [0.0]
  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.
  arXiv  Detail & Related papers  (2026-08-20T11:33:26Z)
• Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent [7.519872646378835]
  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.
  arXiv  Detail & Related papers  (2026-07-05T19:07:48Z)
• 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)
• GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes [3.088254741965685]
  GeneCS is a resource-efficient compiler for synthesizing code surgery protocols for arbitrary stabilizer codes.<n> Experimental results show that GeneCS achieves an average reduction of over $85%$ in ancillary qubits.
  arXiv  Detail & Related papers  (2026-05-20T21:17:42Z)
• Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction [11.02232592575343]
  Fault injection attacks deliberately inject faults into a device via physical channels to disturb its regular execution.<n>We formalize the optimal code circuit problem (OptiCC) based on two domain-specific minimization objectives on individual inputs and parity size.<n>We then propose a novel algorithm CiSC for solving OptiCC, prioritizing the minimization of individual inputs.
  arXiv  Detail & Related papers  (2026-04-04T06:46:43Z)
• Optimal Compilation of Syndrome Extraction Circuits for General Quantum LDPC Codes [24.459036277770007]
  We propose Auto-Stabilizer-Check (ASC), a universal compilation framework that generates depth-optimal syndrome extraction circuits for arbitrary qLDPC codes.<n> ASC reduces circuit depth by approximately 50% and achieves an average 7x-8x suppression of the logical error rate for general qLDPC codes.
  arXiv  Detail & Related papers  (2026-03-23T02:43:38Z)
• 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)
• Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability [4.2955091080396075]
  We focus on the problem of automatically synthesizing fault-tolerant circuits for a broad class of quantum codes.<n>We utilize methods based on techniques from classical circuit design, such as satisfiability solving.<n>We demonstrate the correct fault-tolerant behavior of the synthesized circuits using circuit-level noise simulations.
  arXiv  Detail & Related papers  (2025-01-09T19:06:01Z)
• 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)
• 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)
• 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)
• 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)
• Conservation laws and quantum error correction: towards a generalised matching decoder [2.1756081703276]
  We explore decoding algorithms for the surface code, a prototypical quantum low-density parity-check code. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. We propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties.
  arXiv  Detail & Related papers  (2022-07-13T18:00:00Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)

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.