Optimized Measurement Schedules for the Surface Code with Dropout

• URL: http://arxiv.org/abs/2512.10871v1
• Date: Thu, 11 Dec 2025 18:02:39 GMT
• Title: Optimized Measurement Schedules for the Surface Code with Dropout
• Abstract summary: Recent work has shown that fabrication defects can be well-handled using a strategy relying on the mid-error-correction-cycle state.<n>We quantify the impact of the choice of a more complete set of gauge operators, as well as a new method for excising effectively unused qubits.
• Score: 0.10279607451688234
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent work has shown that fabrication defects can be well-handled using a strategy relying on the mid-error-correction-cycle state. In this work we present two improvements to the original prescription. First, we quantify the impact of the choice of a more complete set of gauge operators originally proposed for the hex-grid surface code on the standard square-grid surface code, as well as a new method for excising effectively unused qubits. Second, we leverage the expressivity of the LUCI framework as an intermediate representation, using integer linear programming to find performant physical circuits from the large space of valid LUCI circuits. We show that on the $d = 11$ surface code at $1\%(3\%)$ dropout rate for qubits and couplers, these optimizations allow for a total improvement of $14.5\%(23.6\%)$ over $4d$ round of syndrome extraction using the SI1000 noise model at $0.1\%$ noise.

Related papers

• X-Z Round Scheduling for the Surface Code with Defects under Biased Noise [1.6832709987512862]
  Fault-tolerant Quantum Computing relies on Quantum Error Correction (QEC) codes that encode logical qubits across many physical qubits to detect and correct errors.<n>The fabrication of solid-state quantum processors introduces hardware defects, resulting in defective qubits and couplers that must be discarded.<n>We investigate the optimal $X$-to-$Z$ checks round-scheduling ratio under biased noise systems.
  arXiv  Detail & Related papers  (2026-08-06T01:46:14Z)
• Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices [0.0]
  Tile codes are a family of planar quantum low-density parity-check (qLDPC) codes with weight-6 stabilizers and open boundary conditions.<n>We show that routed tile codes require fewer physical qubits per logical qubit than the surface code at sufficiently low physical error rates.
  arXiv  Detail & Related papers  (2026-07-07T06:50:27Z)
• A Denser Planar Surface Code [0.7669816560862509]
  We present a quantum code implementable on a regular $2$D hex grid with an estimated encoding rate up to $4.5times$ of that of a rotated surface code patch.<n>We demonstrate a space-efficient architecture for computing on densely packed logical qubits.
  arXiv  Detail & Related papers  (2026-05-28T18:27:34Z)
• Automated Compilation Including Dropouts: Tolerating Defective Components in Stabiliser Codes [0.0]
  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.
  arXiv  Detail & Related papers  (2025-12-01T17:55:20Z)
• 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)
• Scalable 3D Registration via Truncated Entry-wise Absolute Residuals [65.04922801371363]
  A $3$D registration approach can process more than ten million ($107$) point pairs with over $99%$ random outliers. We call our method TEAR, as it involves minimizing an outlier-robust loss that computes Truncated Entry-wise Absolute Residuals.
  arXiv  Detail & Related papers  (2024-04-01T04:43:39Z)
• 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)
• Improved Pairwise Measurement-Based Surface Code [0.0]
  We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements. This realization gains substantial advantages over prior pairwise measurement-based realizations of the surface code.
  arXiv  Detail & Related papers  (2023-10-19T17:59:55Z)
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes [7.059472280274009]
  We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling.
  arXiv  Detail & Related papers  (2023-08-07T17:54:45Z)
• Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods [57.050204432302195]
  This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(sigma / sqrtT)$ convergence when the oracle feedback is with variance $sigma2$, and improves its convergence to $O( 1 / T3)$ with deterministic oracles.
  arXiv  Detail & Related papers  (2022-11-03T14:12:51Z)
• Performance of surface codes in realistic quantum hardware [0.24466725954625884]
  Surface codes are generally studied based on the assumption that each of the qubits that make up the surface code lattice suffers noise that is independent and identically distributed (i.i.d.) We introduce independent non-identically distributed (i.ni.d.) noise model, a decoherence model that accounts for the non-uniform behaviour of the docoherence parameters of qubits. We consider and describe two methods which enhance the performance of planar codes under i.ni.d. noise.
  arXiv  Detail & Related papers  (2022-03-29T15:57:23Z)
• Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum Computing [0.09236074230806578]
  We propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors. Our results show that our proposed decoding method achieves $sim10 times$ and $sim2 times$ higher values of pseudo-threshold and threshold respectively. We show that usage of more sophisticated ML models with higher training/testing time, do not provide significant improvement in the decoder performance.
  arXiv  Detail & Related papers  (2021-10-21T04:54:44Z)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)
• Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation [107.06364966905821]
  We study the exploration-exploitation dilemma in the linear quadratic regulator (LQR) setting. Inspired by the extended value iteration algorithm used in optimistic algorithms for finite MDPs, we propose to relax the optimistic optimization of ofulq. We show that an $epsilon$-optimistic controller can be computed efficiently by solving at most $Obig(log (1/epsilon)big)$ Riccati equations.
  arXiv  Detail & Related papers  (2020-07-13T16:30:47Z)

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.