Towards Optimal Routing Strategies for qLDPC codes on Silicon Spin Qubits
Abstract
One of the major challenges of implementing high-rate quantum error correction codes, like qLDPC codes, is realizing the required long-range interactions. Spin qubit platforms can provide this connectivity by shuttling qubits next to each other whenever they need to interact. When doing this, the performance of the code depends on the shuttling strategy. We study memory experiments of the [[144,12,12]] bivariate bicycle (Gross) code on two shuttling grids for future spin qubit devices: a square grid and a square grid with diagonals. We compare three shuttling strategies, structured and random initial layouts, and a range of shuttling noise models spanning best- and worst-case scenarios. The best strategy minimizes the longest distance travelled rather than the total distance. The initial layout has only a weak effect, whereas adding diagonals to the grid reduces the logical error rate by up to two orders of magnitude which may have implications for future hardware design.
Related
- Disassembling qLDPC codes for depth-optimal parity-check circuits
- Phantom Codes: Hardness, Rate Optimal qLDPC Constructions, and Distance Limits
- Characterization of Radiation-Induced Errors in Superconducting Qubits Protected with Various Gap-Engineering Strategies
- Geodesic-based optimal control for leakage suppression in superconducting qubits
- Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits
BibTeX
@misc{incertimedici2026towards,
title = {{Towards Optimal Routing Strategies for qLDPC codes on Silicon Spin Qubits}},
author = {Merlin Incerti-Medici and Minh T. P. Nguyen and Stefano Bosco and James R. Wootton and Daniel Bultrini},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02972},
eprint = {2611.02972},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02972},
}
RIS
TY - UNPB
TI - Towards Optimal Routing Strategies for qLDPC codes on Silicon Spin Qubits
AU - Merlin Incerti-Medici
AU - Minh T. P. Nguyen
AU - Stefano Bosco
AU - James R. Wootton
AU - Daniel Bultrini
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02972
UR - https://arxiv.org/abs/2611.02972
AB - One of the major challenges of implementing high-rate quantum error correction codes, like qLDPC codes, is realizing the required long-range interactions. Spin qubit platforms can provide this connectivity by shuttling qubits next to each other whenever they need to interact. When doing this, the performance of the code depends on the shuttling strategy. We study memory experiments of the [[144,12,12]] bivariate bicycle (Gross) code on two shuttling grids for future spin qubit devices: a square grid and a square grid with diagonals. We compare three shuttling strategies, structured and random initial layouts, and a range of shuttling noise models spanning best- and worst-case scenarios. The best strategy minimizes the longest distance travelled rather than the total distance. The initial layout has only a weak effect, whereas adding diagonals to the grid reduces the logical error rate by up to two orders of magnitude which may have implications for future hardware design.
ER -