Quantum
Circuit-aware protection against burst errors in lattice surgery
Publication: quant-ph updates on arXiv.org
Author: Jaebum Kim
Source published: 13/11/2026, 05:00:00 UTC
Briefing created: 13/11/2026, 08:06:04 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 13/11/2026, 07:43:24 UTC.
Briefings
A new arXiv preprint presents three static protection layouts for lattice surgery, comparing their impact on burst error risk during simulated CNOT operations. At distance 9, a specific typed layout reduced excess risk by 38% relative to a deep geometric band, while at distance 13, the advantage disappeared under oracle decoding. The study attributes performance differences to temporal boundary errors and ancilla faults interacting to increase shallow-band risk.
Key points
- At distance 9, a specific static protection layout reduced burst-induced excess risk by 38% relative to a deep geometric band under correlated background, without providing decoder impact parameters.
- At distance 13, the advantage of the typed layout over the deep geometric band was not resolved under oracle decoding, and a five-round burst cap reversed the shallow-band ordering.
Context
This research addresses the challenge of protecting logical operations in large-scale quantum computing against high-energy impacts that disturb many superconducting qubits simultaneously. The findings are critical for optimizing protection placement within lattice surgery, where measurements change as patches merge and split, exposing different ancillas and temporal boundaries to burst errors.
Limitations
Results are based on a simulated lattice-surgery CNOT with limited parameters; the study does not account for oracle decoding or five-round burst caps. The reported risk reduction percentages are estimates with uncertainty ranges, and the specific physical mechanisms linking ancilla faults to temporal boundary errors remain unverified in this preprint.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 13/11/2026, 08:06:04 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeig3aldo4lxwar5jtlcmdudpz63t43wgt3cx3jitknebh4mg2x5q54