Quantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface

Recent demonstrations indicate that silicon-spin quantum processing unit will be able to shuttle physical qubits rapidly and with high fidelity—a desirable feature for maximizing logical connectivity, supporting new codes, and routing around damage. However it may seem that shuttling at the logical level is unwise: static defects in the device may “scratch” a logical qubit as it passes, causing correlated errors to which the code is highly vulnerable. Here we explore an architecture where logical qubits are 1D strings (“snakes”) which can be moved freely over a planar latticework. Possible scratch events are inferred via monitor qubits and the complementary gap; if deemed a risk, remarkably the shuttle process can be undone in a way that negates any corruption. This leads to high levels of tolerance against shuttling-related imperfections and enables logical operations between snakes by a semitransversal method. We conclude that this approach is suitable for fault-tolerant computing in both near-term and long-term, mature-era silicon devices.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-12-17
DOI
https://doi.org/10.1103/494s-jd8h
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface

Karl J. Friston
PRX Quantum
Quantum Computing Algorithms and Architecture
article

Quantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface

Karl J. Friston
article en

Abstract

Recent demonstrations indicate that silicon-spin quantum processing unit will be able to shuttle physical qubits rapidly and with high fidelity—a desirable feature for maximizing logical connectivity, supporting new codes, and routing around damage. However it may seem that shuttling at the logical level is unwise: static defects in the device may “scratch” a logical qubit as it passes, causing correlated errors to which the code is highly vulnerable. Here we explore an architecture where logical qubits are 1D strings (“snakes”) which can be moved freely over a planar latticework. Possible scratch events are inferred via monitor qubits and the complementary gap; if deemed a risk, remarkably the shuttle process can be undone in a way that negates any corruption. This leads to high levels of tolerance against shuttling-related imperfections and enables logical operations between snakes by a semitransversal method. We conclude that this approach is suitable for fault-tolerant computing in both near-term and long-term, mature-era silicon devices.

PRX QuantumVol. 7(1)
University of Oxford (GB), Quantum Motion Technologies (United Kingdom) (GB), Mathematical Institute of the Slovak Academy of Sciences (SK), University College London (GB)
Openalex Percentile: Top 78%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum Snakes on a Plane: Mobile, Low-Dimensional Logical Qubits on a 2D Surface — Karl J. Friston · PRX Quantum (2025) | TGRS Research Map | TGRS