Locating Rydberg decay error in the swap leakage reduction circuit protocol
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Achieving fault-tolerant quantum computing with neutral atoms necessitates addressing inherent errors, particularly leakage from Rydberg states during the implementation of multi-qubit gates. Such leakage induces two-qubit error chains, which degrades the error distance and compromise the performance of error correction. While existing solutions, such as hardware-specific protocols (Erasure Conversion) and circuit-based protocols, have demonstrated favorable error distances (d_e = d for pure Rydberg decay) and high error thresholds, they rely on significant additional hardware resources. In this work, we propose a hardware-efficient approach to deal with Rydberg decay errors using SWAP-LRU, augmented by final leakage detection to locate errors. No additional resource is needed to remove leakage and renew atoms. When all leakage can be detected, we propose a located decoder and demonstrate a high error threshold of 2.33% per CNOT gate and demonstrate improved error distances for pure Rydberg decay, outperforming traditional Pauli error models. Furthermore, we introduce an alternative but more hardware-efficient solution, critical decoder. It only requires one type of leakage to be detected, yet effectively eliminates the damaging effects of Rydberg decay on sub-threshold scaling. Our findings provide new insights into located error and pave the way for a resource-efficient strategy to achieve fault-tolerant quantum computation with neutral atom arrays.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it