Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.26736

A Syndrome-Extraction Framework for Distributed Lattice Surgery on Arbitrary Rotated Surface-Code Layouts

Pritesh Thakur, Daniel Dilley, Zain Saleem

quant-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 2 citations
arXivHTMLPDF

Abstract

Modular quantum computing is a leading candidate for scalable fault tolerant quantum computation. Performing lattice surgery using surface code patches in different modules requires the use of inter-module gates that are noisier than the local gates. Furthermore, the merged layouts during lattice surgery expose multiple directions in which hook errors can propagate to reduce the fault distance. Existing hook-avoiding schedules either increase the syndrome extraction circuit depth, or let link faults propagate into the bulk. We introduce a seam construction that allows splitting arbitrary merged rotated surface code layout into smaller patches with uniform boundaries that could keep their own hook-avoiding N/Z shaped schedule. At the seam we split weight-4 stabilizers into pairs of weight-2 stabilizers that are mediated through a Bell pair and measured within a CNOT depth of 4. We also employ the use of three-qubit $\texttt{CXX}$ gates for parity measurements at the seam to maintain the minimum CNOT depth. Through this seam construction, we confine the elevated link error at the seam, protecting the bulk from higher error rate. We also give a custom detector annotator for such seams that can find the detector space, annotate detectors in the Stim circuits, and ensure that they are suitable to use by matching decoders. We implement our construction for the logical Pauli-$XX$ measurement lattice surgery and a cross-shaped spatial junction and sweep the link error rate from $10$ times to $100$ times a fixed bulk error rate, and show that our construction gives the lowest and most stable logical error rate than the other frameworks compared here.

AI Summary

The paper addresses syndrome-extraction scheduling for distributed rotated-surface-code lattice surgery, where merged boundaries create competing hook-error constraints and inter-module gates are noisier than local gates. It constructs seams joining regions with separate hook-avoiding N/Z schedules: weight-four checks are split into two weight-two checks, combined using Bell preparation or Bell measurement. Native three-qubit $\texttt{CXX}$ gates allow four entangling-gate steps per extraction round. Each seam requires $d$ Bell pairs and $d$ additional physical qubits. The construction is evaluated for logical $XX$ measurement at $d=3,5,7,9$ and a cross-shaped junction at $d=3,5,7$, using circuit-level depolarizing noise, Stim sampling and PyMatching decoding. With bulk error $p=10^{-4}$ and link error swept from $10p$ to $100p$, it has lower sampled logical failure rates than the two direct-link scheduling baselines tested. At $d=5$ and $p_{\mathrm{link}}=10^{-2}$, the $XX$ failure rate is approximately $1.6\times10^{-5}$, versus $9.6\times10^{-4}$ and $1.2\times10^{-3}$. Fault searches give distance $d-1$, rather than the interleaving baseline’s $d$. An accompanying detector annotator discovers deterministic measurement parities by sampling and changes their basis to support matching decoding. The four-step schedule assumes native $\texttt{CXX}$ gates. Tests cover two layouts and one bulk error rate, with $10^8$ samples per point; the smallest reported rates therefore involve few failures. Stated open directions include restoring full distance, testing biased noise, and accelerating detector annotation for larger circuits. The closest measurement-teleportation alternative is not benchmarked because it assumes different hardware resources.

Little sign of AI-generated textOverclaimsMissing comparisonStrong assumptions

Central claim may not hold: The claimed applicability to arbitrary rotated surface-code layouts is not established by the two demonstrated three-region, two-seam constructions or by a general scheduling argument. The detector annotator's logical-complement test does not distinguish physical syndrome constraints from constraints mixed with a benchmark-specific deterministic logical relation, leaving correctness of the selected seam detector space insufficiently established. Elevated-noise seam CXX gates act directly on data across modules, so the ancilla-only CNOT explanation does not establish confinement of all modeled link faults to measurement errors. The numerical results omit sampling uncertainties, including a distance-nine estimate corresponding to approximately two failures, so close comparisons and universal pointwise superiority are not statistically established.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

A Syndrome-Extraction Framework for Distributed Lattice Surgery on Arbitrary Rotated Surface-Code Layouts — E8 Intelligence Research

Andrew Stewart Caldin

Modular quantum computing is a leading candidate for scalable fault tolerant quantum computation. Performing lattice surgery using surface code patches in different modules requires the use of inter-module gates that are noisier than the local gates. Furthermore, the merged layouts during lattice surgery expose multiple directions in which hook errors can propagate to reduce the fault distance. Existing hook-avoiding schedules either increase the syndrome extraction circuit depth, or let link faults propagate into the bulk. We introduce a seam construction that allows splitting arbitrary merged rotated surface code layout into smaller patches with uniform boundaries that could keep their own hook-avoiding N/Z shaped schedule. At the seam we split weight-4 stabilizers into pairs of weight-2 stabilizers that are mediated through a Bell pair and measured within a CNOT depth of 4. We also employ the use of three-qubit $\texttt{CXX}$ gates for parity measurements at the seam to maintain the Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

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

Yuga Hirai, Shota Ikari, Yosuke Ueno +1 more

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.

quant-pharXiv:2603.01628•Mar 3, 2026•11 citations

MERLIN SCIENCE — A Syndrome-Extraction Framework for Distributed Lattice Surgery on Arb — E8 Intelligence Research

Andrew Stewart Caldin

# MERLIN SCIENCE NARRATION The finding: we've solved the hook-error problem in modular quantum computing by splitting merged surface code layouts at a seam using two-qubit measurements mediated through Bell pairs, which keeps logical error rates stable even when link errors run a hundred times noisier than bulk errors. Here's the context. Modular quantum computing scales by linking independent quantum processors through noisy inter-module gates. When you perform lattice surgery to merge surface code patches, you create configurations where errors can propagate in multiple directions, especially hook errors that kill your fault distance. Existing methods either bloat your syndrome extraction circuits or let those errors corrupt the bulk code itself. You're stuck choosing between two bad options. What we did: we constructed a seam that acts as a barrier. When you merge rotated surface codes, instead of letting weight-four stabilizers span the boundary unsupervised, we split them into Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Surface code off-the-hook: diagonal syndrome-extraction scheduling

Gilad Kishony, Austin Fowler

In the rotated surface code, hook errors (errors on auxiliary qubits midway through syndrome extraction that propagate to correlated two-qubit data errors) can reduce the circuit-level code distance by a factor of two if the extraction schedule is poorly chosen. The traditional approach uses N-shaped and Z-shaped schedules, selecting the orientation in each plaquette to avoid hook errors aligned with logical operators. However, this becomes increasingly complex within lattice surgery primitives with varied boundary geometries, and requires a 7-step schedule to avoid gate collisions. We propose the diagonal schedule, which orients hook errors along the diagonal of each plaquette. These diagonal errors crucially never align with logical operators regardless of boundary orientation, achieving full code distance. The diagonal schedule is globally uniform: all X-type plaquettes use one schedule and all Z-type plaquettes use another, eliminating geometry-dependent planning. On hardware supporting parallel measurement, reset, and gate operations, the schedule achieves a minimal period of 6 time steps, compared to 7 for the traditional approach. We demonstrate effectiveness for memory experiments, spatial junctions, spatial Hadamard gates, and patch rotation, showing equivalent or improved logical error rates while simplifying circuit construction.

quant-pharXiv:2602.09099•Feb 11, 2026•20 citations

Patchwork: automated lattice surgery and space-time partitioning for real-time decoding

Christopher Chamberland, Muyuan Li, Scott Thornton +3 more

We introduce patchwork, a lattice-surgery compiler for arbitrary multi-qubit Pauli measurements on a prescribed narrow-corridor two-dimensional surface-code layout. Systematic geometric rules simplify stabilizer placement and gate scheduling, including for logical $Y$ measurements implemented using twist defects. We introduce measurement circuits and schedules that, together with protruding lobes of $Y$-extension patches, preserve the full effective code distance for all numerically tested code distances. To support parallel decoding, we develop a wavefront algorithm that partitions merged lattice-surgery patches into space-time commit, buffer, and cleanup regions. Simulations of three sequential multi-qubit Pauli measurements acting on ten logical qubits show that staged decoding achieves total failure probabilities close to those of monolithic decoding over the parameters tested. These methods provide an automated framework for fault-tolerant lattice surgery and a route toward scalable, real-time decoding.

quant-pharXiv:2610.22112•Oct 16, 2026•1 citation

Lattice surgery with Bell measurements: Modular fault-tolerant quantum computation at low entanglement cost

Trond Hjerpekjøn Haug, Timo Hillmann, Anton Frisk Kockum +1 more

Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the noise can be confined to the interface. Finding protocols that implement the quantum links between modules as efficiently as possible is essential because inter-module entanglement is challenging to produce at a similar rate and fidelity as local entanglement. We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements. The protocol simultaneously confines the link noise and requires only half as many module-crossing gates as previously proposed protocols. To mitigate distance-reducing hook errors, we introduce a strategy of alternating the gate sequence between rounds of syndrome measurement, which prevents multiple hooks from simultaneously aligning with a logical operator in the code. We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state. Circuit-level simulations under depolarizing noise show that the logical error suppression for a given entanglement rate between modules is consistently stronger compared to the best-performing alternative protocols for a wide range of link noise, with a typical 40% entanglement resource saving for a constant logical error rate. Our approach to protocol design is applicable to any quantum circuit that must be divided across processor modules and can therefore guide development of resource-efficient modular quantum computation beyond the surface code.

arXiv:2510.13541•Oct 15, 2025•15 citations
Modular quantum computing is a leading candidate for scalable fault tolerant quantum computation. Performing lattice surgery using surface code patches in different modules requires the use of inter-module gates that are noisier than the local gates. Furthermore, the merged layouts during lattice surgery expose multiple directions in which hook errors can propagate to reduce the fault distance. Existing hook-avoiding schedules either increase the syndrome extraction circuit depth, or let link faults propagate into the bulk. We introduce a seam construction that allows splitting arbitrary merged rotated surface code layout into smaller patches with uniform boundaries that could keep their own hook-avoiding N/Z shaped schedule. At the seam we split weight-4 stabilizers into pairs of weight-2 stabilizers that are mediated through a Bell pair and measured within a CNOT depth of 4. We also employ the use of three-qubit CXX\texttt{CXX}CXX gates for parity measurements at the seam to maintain the minimum CNOT depth. Through this seam construction, we confine the elevated link error at the seam, protecting the bulk from higher error rate. We also give a custom detector annotator for such seams that can find the detector space, annotate detectors in the Stim circuits, and ensure that they are suitable to use by matching decoders. We implement our construction for the logical Pauli-XXXXXX measurement lattice surgery and a cross-shaped spatial junction and sweep the link error rate from 101010 times to 100100100 times a fixed bulk error rate, and show that our construction gives the lowest and most stable logical error rate than the other frameworks compared here.
The paper addresses syndrome-extraction scheduling for distributed rotated-surface-code lattice surgery, where merged boundaries create competing hook-error constraints and inter-module gates are noisier than local gates. It constructs seams joining regions with separate hook-avoiding N/Z schedules: weight-four checks are split into two weight-two checks, combined using Bell preparation or Bell measurement. Native three-qubit CXX\texttt{CXX}CXX gates allow four entangling-gate steps per extraction round. Each seam requires ddd Bell pairs and ddd additional physical qubits.
The construction is evaluated for logical XXXXXX measurement at d=3,5,7,9d=3,5,7,9d=3,5,7,9 and a cross-shaped junction at d=3,5,7d=3,5,7d=3,5,7, using circuit-level depolarizing noise, Stim sampling and PyMatching decoding. With bulk error p=10−4p=10^{-4}p=10−4 and link error swept from 10p10p10p to 100p100p100p, it has lower sampled logical failure rates than the two direct-link scheduling baselines tested. At d=5d=5d=5 and plink=10−2p_{\mathrm{link}}=10^{-2}plink​=10−2, the XXXXXX failure rate is approximately 1.6×10−51.6\times10^{-5}1.6×10−5, versus 9.6×10−49.6\times10^{-4}9.6×10−4 and 1.2×10−31.2\times10^{-3}1.2×10−3. Fault searches give distance d−1d-1d−1, rather than the interleaving baseline’s ddd. An accompanying detector annotator discovers deterministic measurement parities by sampling and changes their basis to support matching decoding.
The four-step schedule assumes native CXX\texttt{CXX}CXX gates. Tests cover two layouts and one bulk error rate, with 10810^8108 samples per point; the smallest reported rates therefore involve few failures. Stated open directions include restoring full distance, testing biased noise, and accelerating detector annotation for larger circuits. The closest measurement-teleportation alternative is not benchmarked because it assumes different hardware resources.
Modular quantum computing is a leading candidate for scalable fault tolerant quantum computation. Performing lattice surgery using surface code patches in different modules requires the use of inter-module gates that are noisier than the local gates. Furthermore, the merged layouts during lattice surgery expose multiple directions in which hook errors can propagate to reduce the fault distance. Existing hook-avoiding schedules either increase the syndrome extraction circuit depth, or let link faults propagate into the bulk. We introduce a seam construction that allows splitting arbitrary merged rotated surface code layout into smaller patches with uniform boundaries that could keep their own hook-avoiding N/Z shaped schedule. At the seam we split weight-4 stabilizers into pairs of weight-2 stabilizers that are mediated through a Bell pair and measured within a CNOT depth of 4. We also employ the use of three-qubit CXX\texttt{CXX}CXX gates for parity measurements at the seam to maintain the Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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 ddd 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 ddd, whereas the best existing minimum-depth approach achieves d−1d-1d−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.
# MERLIN SCIENCE NARRATION The finding: we've solved the hook-error problem in modular quantum computing by splitting merged surface code layouts at a seam using two-qubit measurements mediated through Bell pairs, which keeps logical error rates stable even when link errors run a hundred times noisier than bulk errors. Here's the context. Modular quantum computing scales by linking independent quantum processors through noisy inter-module gates. When you perform lattice surgery to merge surface code patches, you create configurations where errors can propagate in multiple directions, especially hook errors that kill your fault distance. Existing methods either bloat your syndrome extraction circuits or let those errors corrupt the bulk code itself. You're stuck choosing between two bad options. What we did: we constructed a seam that acts as a barrier. When you merge rotated surface codes, instead of letting weight-four stabilizers span the boundary unsupervised, we split them into Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
In the rotated surface code, hook errors (errors on auxiliary qubits midway through syndrome extraction that propagate to correlated two-qubit data errors) can reduce the circuit-level code distance by a factor of two if the extraction schedule is poorly chosen. The traditional approach uses N-shaped and Z-shaped schedules, selecting the orientation in each plaquette to avoid hook errors aligned with logical operators. However, this becomes increasingly complex within lattice surgery primitives with varied boundary geometries, and requires a 7-step schedule to avoid gate collisions. We propose the diagonal schedule, which orients hook errors along the diagonal of each plaquette. These diagonal errors crucially never align with logical operators regardless of boundary orientation, achieving full code distance. The diagonal schedule is globally uniform: all X-type plaquettes use one schedule and all Z-type plaquettes use another, eliminating geometry-dependent planning. On hardware supporting parallel measurement, reset, and gate operations, the schedule achieves a minimal period of 6 time steps, compared to 7 for the traditional approach. We demonstrate effectiveness for memory experiments, spatial junctions, spatial Hadamard gates, and patch rotation, showing equivalent or improved logical error rates while simplifying circuit construction.
We introduce patchwork, a lattice-surgery compiler for arbitrary multi-qubit Pauli measurements on a prescribed narrow-corridor two-dimensional surface-code layout. Systematic geometric rules simplify stabilizer placement and gate scheduling, including for logical YYY measurements implemented using twist defects. We introduce measurement circuits and schedules that, together with protruding lobes of YYY-extension patches, preserve the full effective code distance for all numerically tested code distances. To support parallel decoding, we develop a wavefront algorithm that partitions merged lattice-surgery patches into space-time commit, buffer, and cleanup regions. Simulations of three sequential multi-qubit Pauli measurements acting on ten logical qubits show that staged decoding achieves total failure probabilities close to those of monolithic decoding over the parameters tested. These methods provide an automated framework for fault-tolerant lattice surgery and a route toward scalable, real-time decoding.
Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the noise can be confined to the interface. Finding protocols that implement the quantum links between modules as efficiently as possible is essential because inter-module entanglement is challenging to produce at a similar rate and fidelity as local entanglement. We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements. The protocol simultaneously confines the link noise and requires only half as many module-crossing gates as previously proposed protocols. To mitigate distance-reducing hook errors, we introduce a strategy of alternating the gate sequence between rounds of syndrome measurement, which prevents multiple hooks from simultaneously aligning with a logical operator in the code. We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state. Circuit-level simulations under depolarizing noise show that the logical error suppression for a given entanglement rate between modules is consistently stronger compared to the best-performing alternative protocols for a wide range of link noise, with a typical 40% entanglement resource saving for a constant logical error rate. Our approach to protocol design is applicable to any quantum circuit that must be divided across processor modules and can therefore guide development of resource-efficient modular quantum computation beyond the surface code.