Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection

• URL: http://arxiv.org/abs/2601.13313v1
• Date: Mon, 19 Jan 2026 19:00:03 GMT
• Title: Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection
• Authors: Erik Weilandt, Tom Peham, Robert Wille,
• Abstract summary: We propose a general, automated synthesis methodology for fault-tolerant state preparation circuits.<n>We apply the proposed methods to arbitrary Calderbank-Shor-Steane (CSS) codes up to a distance of seven.
• Score: 4.561664406615985
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant state preparation is essential for reliable quantum error correction, particularly in Steane-type error correction, which relies on robust ancilla states for syndrome readout. One method of fault-tolerant state preparation is to initialize multiple ancilla states and check them against each other to detect problematic errors. In the worst case, the number of states required for successful initialization grows polynomially with the code distance, but it has been shown that this can be reduced to constant ancilla overhead-in the best case, only four states are required. However, existing techniques for finding low-overhead initialization schemes are limited to codes with large symmetry groups, such as the Golay code. In this work, we propose a general, automated synthesis methodology for Steane-type fault-tolerant state preparation circuits that applies to arbitrary Calderbank-Shor-Steane (CSS) codes and does not rely on code symmetries. We apply the proposed methods to various CSS codes up to a distance of seven and simulate the successful fault-tolerant initialization of logical basis states under circuit-level depolarizing noise. The circuits synthesized using the proposed methodology provide an important step towards experimental realizations of high-fidelity ancilla states for near-term demonstration of fault-tolerant quantum computation.

Related papers

• Fault-tolerant preparation of arbitrary logical states in the cat code [2.188273064906527]
  We present a complete framework for the fault-tolerant preparation of arbitrary logical states encoded in the four-legged cat code.<n>This framework is engineered to suppress the dominant incoherent errors, including excitation decay and dephasing in both the bosonic mode and the ancilla.<n>A scaling analysis confirms that the logical error rate grows nearly quadratically with the physical error rate, confirming that all first-order errors are fully suppressed.
  arXiv  Detail & Related papers  (2026-02-19T15:07:46Z)
• 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)
• 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)
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes [4.2955091080396075]
  We propose an automated approach for fault-tolerant state preparation circuits for arbitrary CSS codes.<n>We provide a general construction for non-deterministic state preparation circuits beyond distance 3.<n>The resulting methods are publicly available as part of the Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-08-21T18:00:01Z)
• 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)
• Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates [37.94431794242543]
  Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits and a favourable logical error rate. Transversal Injection is a new method of preparing logical non-Pauliigen estates that can be used as resource states for quantum computation.
  arXiv  Detail & Related papers  (2023-12-27T03:32:03Z)
• Mitigating Temporal Fragility in the XY Surface Code [3.4746204759424715]
  We propose a new logical state preparation protocol based on locally entangling qubits into small Greenberger-Horne-Zeilinger-like states. We prove that in this new procedure $O(sqrtn)$ high-rate errors along a single lattice boundary can cause a logical failure.
  arXiv  Detail & Related papers  (2023-10-26T18:00:02Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Measurement-free preparation of grid states [0.0]
  The Gottesman-Kitaev-Preskill code is a promising approach towards fault-tolerant quantum computing. For the code to be fault tolerant, the quality of the grid states has to be extremely high. Here we propose a measurement-free preparation protocol which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice.
  arXiv  Detail & Related papers  (2019-12-29T13:12:46Z)

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.