No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth

• URL: http://arxiv.org/abs/2603.01628v1
• Date: Mon, 02 Mar 2026 09:05:21 GMT
• Title: No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth
• Authors: Yuga Hirai, Shota Ikari, Yosuke Ueno, Yasunari Suzuki,
• Abstract summary: Hook errors are a major challenge in implementing logical operations with the surface code.<n>We propose the ZX interleaving syndrome extraction, which preserves the full fault distance $d$ for any surface-code layout.<n>The proposed method may serve as an indispensable technique for practical fault-tolerant quantum computation.
• Score: 0.1679937788852768
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hook errors are a major challenge in implementing logical operations with the surface code, because they can reduce the fault distance below the code distance. This motivates syndrome-extraction circuits that suppress hook-error effects for the stabilizer layouts that appear during logical operations. However, the existing methods either increase circuit depth or require simultaneous execution of measurements and CNOT gates, both of which introduce additional overheads and degrade the threshold. We propose the ZX interleaving syndrome extraction, which preserves the full fault distance $d$ for any surface-code layout with regular stabilizer tiles at minimum depth, i.e., four layers of CNOT gates, without requiring additional circuit depth or simultaneous execution of measurements and CNOT gates. The key idea is to interleave the Z and X stabilizer tiles so that hook-error edges in the decoding graph are shortened and effectively eliminated. Numerical simulations under uniform depolarizing noise for memory and lattice-surgery experiments confirm that the proposed method achieves a full fault distance of $d$, whereas the best existing minimum-depth approach achieves $d-1$. Since the full fault distance is achievable for any regular tiling layout of the surface code, the proposed method may serve as an indispensable technique for practical fault-tolerant quantum computation.

Related papers

• Surface code off-the-hook: diagonal syndrome-extraction scheduling [0.0]
  Hook errors can reduce circuit-level code distance by a factor of two if the extraction schedule is poorly chosen.<n>Traditional approach uses N-shaped and Z-shaped schedules, selecting the orientation in each plaquette to avoid hook errors aligned with logical operators.<n>We propose the diagonal schedule, which orients hook errors along the diagonal of each plaquette.
  arXiv  Detail & Related papers  (2026-02-09T19:00:02Z)
• 3D Stacked Surface-Code Architecture for Measurement-Free Fault-Tolerant Quantum Error Correction [0.15293427903448018]
  Mid-circuit measurements are a major bottleneck for superconducting quantum processors because they are slower and noisier than gates.<n>Measurement-free quantum error correction (mfec) replaces repeated measurements and classical feed-forward by coherent quantum feedback.<n>Existing mfec protocols suffer from severe connectivity overhead when mapped to planar surface-code architectures.<n>This work introduces a 3D stacked surface-code architecture for measurement-free fault-tolerant quantum error correction.
  arXiv  Detail & Related papers  (2026-01-20T06:32:28Z)
• Unitary fault-tolerant encoding of Pauli states in surface codes [0.8314040122511801]
  We present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes.<n>Our work bridges the gap between measurement-based and unitary encodings of surface-code states.
  arXiv  Detail & Related papers  (2026-01-08T17:00:25Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• 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)
• 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)
• Global Context Aggregation Network for Lightweight Saliency Detection of Surface Defects [70.48554424894728]
  We develop a Global Context Aggregation Network (GCANet) for lightweight saliency detection of surface defects on the encoder-decoder structure. First, we introduce a novel transformer encoder on the top layer of the lightweight backbone, which captures global context information through a novel Depth-wise Self-Attention (DSA) module. The experimental results on three public defect datasets demonstrate that the proposed network achieves a better trade-off between accuracy and running efficiency compared with other 17 state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-09-22T06:19:11Z)
• 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)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning [52.76230802067506]
  A novel model-free algorithm is proposed to minimize regret in episodic reinforcement learning. The proposed algorithm employs an em early-settled reference update rule, with the aid of two Q-learning sequences. The design principle of our early-settled variance reduction method might be of independent interest to other RL settings.
  arXiv  Detail & Related papers  (2021-10-09T21:13:48Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

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.