Automated Compilation Including Dropouts: Tolerating Defective Components in Stabiliser Codes

• URL: http://arxiv.org/abs/2512.01943v1
• Date: Mon, 01 Dec 2025 17:55:20 GMT
• Title: Automated Compilation Including Dropouts: Tolerating Defective Components in Stabiliser Codes
• Abstract summary: Utility-scale solid-state quantum devices will need to fabricate quantum devices at scale using imperfect processes.<n>By introducing tolerance to fabrication defects into the design of quantum devices, we can improve the yield of usable quantum chips and lower the cost of useful systems.<n>ACID is a framework that works in the ancilla-free (or middle-out') paradigm, to generate syndrome extraction circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Utility-scale solid-state quantum devices will need to fabricate quantum devices at scale using imperfect processes. By introducing tolerance to fabrication defects into the design of the quantum devices, we can improve the yield of usable quantum chips and lower the cost of useful systems. Automated Compilation Including Dropouts (ACID) is a framework that works in the ancilla-free (or `middle-out') paradigm, to generate syndrome extraction circuits for general stabiliser codes in the presence of defective couplers or qubits. In the ancilla-free paradigm, we do not designate particular qubits as measurement ancillas, instead measuring stabilisers using any of the data qubits in their support. This approach leads to a great deal of flexibility in how syndrome extraction circuits can be implemented. ACID works by constructing and solving an optimisation problem within the ancilla-free paradigm to find a short syndrome extraction circuit. Applied to the surface code, ACID produces syndrome-extraction circuits of depth between $1\times$ (no overhead) and $1.5\times$ relative to the depth of defect-free circuits. The LUCI algorithm, the best prior art, yielded a $2 \times$ overhead, so ACID offers a significant time saving. The yield of surface code chips with a logical error rate at most $10\times$ the dropout-free baseline is up to $3\times$ higher using ACID than using LUCI. I demonstrate the broad applicability of ACID by compiling syndrome extraction circuits for bivariate bicycle codes and the colour code. For these circuits, we incur a circuit-depth overhead of between $1\times$ (no overhead) and $2.5\times$ relative to defect-free circuits. I believe this work is the first to simulate both of these families of codes in the presence of fabrication defects.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density [1.2547224747420167]
  Long-lived logical qubits are essential for fault-tolerant quantum computation.<n>Traditional error correction protocols rely on performing specific syndrome circuits.<n>We show that flexible circuits within the LUCI framework can maintain space-time distance in the presence of isolated or broken components.
  arXiv  Detail & Related papers  (2026-07-02T08:38:27Z)
• From I/O to Code with Discovery Agent [103.88427301265669]
  We propose DIO-Agent, a discovery agent for IO2Code.<n>Our method frames IO2Code as an evolutionary search over discrete program space.<n>Extensive experiments show that DIO-Agent consistently outperforms both traditional program-by-example method and SOTA evolution-agent baselines.
  arXiv  Detail & Related papers  (2026-05-14T18:57:32Z)
• 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)
• High-performance syndrome extraction circuits for quantum codes [1.9899603776429056]
  We present a framework for analysing and designing syndrome-extraction circuits (SECs)<n>Our approach is based on left-right circuits, a general design for SECs which maintain low depth by staggering $X$ and $Z$ checks without interleaving gates.
  arXiv  Detail & Related papers  (2026-03-05T18:50:46Z)
• Quantum Circuit Pre-Synthesis: Learning Local Edits to Reduce $T$-count [1.6195650245658724]
  Local synthesis approaches are commonly used to compile large circuits by decomposing them into substructures.<n>We propose textscQ-PreSyn, a strategy that, given a set of local edits preserving circuit equivalence, uses a RL agent to identify effective sequences.<n> Experimental results show up to a $20%$ reduction in $T$-count on circuits with up to 25 qubits.
  arXiv  Detail & Related papers  (2026-01-27T15:58:05Z)
• Towards Minimal Fault-tolerant Error-Correction Sequence with Quantum Hamming Codes [13.76585151018803]
  High overhead of fault-tolerant measurement sequences (FTMSs) poses a major challenge for implementing quantum stabilizer codes.<n>Here, we address this problem by constructing efficient FTMSs for the class of quantum Hamming codes $[![2r-1, 2r-1-2r, 3]!]$ with $r=3k+1$.<n>Our key result demonstrates that the sequence length can be reduced to exactly $2r+1$-only one additional measurement beyond the original non-fault-tolerant sequence.
  arXiv  Detail & Related papers  (2026-01-15T03:40:13Z)
• Towards self-correcting quantum codes for neutral atom arrays [2.1874189959020427]
  "ZSZ codes" are low-overhead quantum error-correcting codes based on the group $mathbbZ_ell rtimes mathbbZ_m$.<n>We benchmark the performance of this code family under local "self-correcting" decoders.<n>These results suggest that ZSZ codes are promising candidates for scalable self-correcting quantum memories.
  arXiv  Detail & Related papers  (2025-07-29T00:08:26Z)
• 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)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• 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)
• Faster-than-Clifford Simulations of Entanglement Purification Circuits and Their Full-stack Optimization [0.0]
  We develop a simulation algorithm for distillation circuits with gate-simulation complexity of $mathcalO(1)$ steps. It enabled us to use a simple discrete optimization algorithm to design purification circuits from $n$ raw Bell pairs to $k$ purified pairs. The resulting purification circuits are the best-known purification circuits for finite-size noisy hardware.
  arXiv  Detail & Related papers  (2023-07-12T18:00:00Z)
• Approximate Autonomous Quantum Error Correction with Reinforcement Learning [4.015029887580199]
  Autonomous quantum error correction (AQEC) protects logical qubits by engineered dissipation. Bosonic code spaces, where single-photon loss represents the dominant source of error, are promising candidates for AQEC. We propose a bosonic code for approximate AQEC by relaxing the Knill-Laflamme conditions.
  arXiv  Detail & Related papers  (2022-12-22T12:42:52Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes [0.0]
  We establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. For local-expander quantum codes, we prove that any syndrome extraction circuit implemented with local Clifford gates has depth at least $Omega(n/sqrtN)$. This suggests that quantum LDPC codes are impractical with 2D local quantum hardware.
  arXiv  Detail & Related papers  (2021-09-29T17:52:16Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• A hardware-efficient leakage-reduction scheme for quantum error correction with superconducting transmon qubits [1.6328866317851185]
  Leakage outside of the qubit computational subspace poses a threatening challenge to quantum error correction (QEC) We propose a scheme using two leakage-reduction units (LRUs) that mitigate these issues for a transmon-based surface code. We show that this leads to a significant reduction of the logical error rate.
  arXiv  Detail & Related papers  (2021-02-16T18:21:41Z)

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.