Automated Flag-based Fault-Tolerant State Preparation using Integer Linear Programming

• URL: http://arxiv.org/abs/2607.22498v1
• Date: Fri, 24 Jul 2026 17:11:09 GMT
• Title: Automated Flag-based Fault-Tolerant State Preparation using Integer Linear Programming
• Abstract summary: Post-selected stabilizer state preparation is a necessary subroutine in fault-tolerant quantum computation.<n>We use circuit gauge operator formalism to express the construction of flag circuits as an integer linear program.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Post-selected stabilizer state preparation is a necessary subroutine in fault-tolerant quantum computation, both for initialization of logical qubits, and for logical-ancilla-based error correction gadgets (e.g. Steane and Knill). Therefore, reducing the number of gates needed to prepare a stabilizer state fault-tolerantly can simultaneously reduce time-to-solution and increase reliability. For small, low-distance codes such as the [[7, 1, 3]] Steane code, circuits with low gate counts can be found by inspection. This becomes impractical for larger codes, necessitating automation. There are two state-of-the-art methods for automated fault-tolerant state preparation, SAT-based stabilizer measurement and flag-at-origin. In this work, we optimize state preparation circuits using the circuit gauge operator formalism to express the construction of flag circuits as an integer linear program. This allows the construction of circuits with equal or lower gate count than the state of the art, while detecting up to three errors. We use this technique to derive a Steane error correction gadget for the [[24, 10, 4]] two-block group algebra code, and test it on Quantinuum's System Model H2 quantum computer with 10,000 shots, resulting in a logical block error rate ~0.00014 (~0.000014 per logical qubit), with ~1.6% of the shots post-selected due to weight-two errors.

Related papers

• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Fail fast: techniques to probe rare events in quantum error correction [0.9159338434295846]
  We develop three techniques to characterize the rare-event regime for general quantum low-density parity-check codes under circuit noise.<n>We observe strong low-error-rate performance with the recently proposed Relay decoder.
  arXiv  Detail & Related papers  (2025-11-19T06:57:29Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• 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)
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code [2.5553228515450765]
  We implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer. We observe arithmetic errors with a rate of $sim 1.1 times 10-3$ for the fault-tolerant circuit and $sim 9.5 times 10-3$ for the unencoded circuit.
  arXiv  Detail & Related papers  (2023-09-18T15:56:14Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors [67.47400131519277]
  A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. Some circuits did not satisfy the fault tolerance criterion. It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
  arXiv  Detail & Related papers  (2021-12-08T01:52:36Z)
• Realization of real-time fault-tolerant quantum error correction [0.0]
  We use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit. We measure an average logical SPAM error of $1.7(6) times 10-3$, compared to the average physical SPAM error $2.4(8) times 10-3$ of our qubits.
  arXiv  Detail & Related papers  (2021-07-15T17:57:59Z)
• 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)
• Low-overhead pieceable fault-tolerant construction of logical controlled-phase circuit for degenerate quantum code [11.106110829349221]
  We search for a non-transversal but fault-tolerant construction of a logical controlled-phase gate for quantum code. We find a 3-piece fault-tolerant logical CZ circuit on this code.
  arXiv  Detail & Related papers  (2021-05-15T04:06:12Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

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.