Snakes on a Plane: mobile, low dimensional logical qubits on a 2D surface

arXiv:2501.02120 · quant-ph · Submitted 2025-01-03 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: I'm Kai, and with me are Mira and Lev, guest researcher.

Mira: Today's paper: "Snakes on a Plane".

Kai: Mobile, low-dimensional logical qubits on a 2D surface explore an architecture where logical qubits are represented as movable,

Mira: First, who's behind it and why it matters.

Paper summary: Kai: To wrap up "Snakes on a Plane: mobile, low dimensional logical qubits on a 2D surface," the authors Adam Siegel, Zhenyu Cai, Hamza Jnane, Balint Koczor, Shaun Pexton, Armands Strikis and Simon Benjamin have proposed this concept of using movable logical strings to navigate a 2D latticework for all-to-all connectivity in silicon spin systems.

Mira: The significance lies in their approach to managing static defects; by introducing 'snake surgery' and complementary gap filtering, they provide a mechanism to infer and correct state corruption caused by those physical imperfections during movement.

Lev: What this means for future hardware is that if these error detection protocols prove robust enough, we could potentially route logical information around damage without needing perfect static layouts.

Kai: It really boils down to the idea of achieving global logical connectivity through dynamic qubit movement, which is a powerful concept when trying to build complex quantum processors on a chip.

Mira: The implication for condensed matter theory is that it shows how topological or geometric arrangements of physical qubits can be exploited not just for static encoding, but dynamically for error management during operation.

Lev: From an error correction perspective, the paper suggests a viable path where dynamic routing and defect inference work together to keep the logical error rates manageable even in noisy environments.

Kai: Ultimately, this architecture moves us toward realizing more flexible and resilient quantum processors by treating the qubits as entities that can actively navigate their environment rather than just being fixed points.

Conclusion: Kai: So, to wrap up, we're talking about this paper that explores using movable logical strings on a 2D surface for qubit connectivity in silicon spin systems and what it actually means for the hardware we can build today.

Mira: I think the title "Snakes on a Plane" captures the core idea perfectly because it immediately brings to mind this dynamic, snake-like arrangement of qubits navigating a lattice structure.

Lev: From an error correction standpoint, that movement concept is intriguing because it suggests we can actively manage noise by physically moving the logical information around potential problems.

Kai: Exactly, and when you look at the authors—Siegel and Cai in particular—they’ve clearly put together a system where physical qubits are treated less like fixed points and more like mobile entities on a substrate.

Mira: The implication here is that we're moving beyond static encoding; we're talking about an architecture where the logical qubit itself has mobility, which could fundamentally alter how we design large-scale quantum chips.

Lev: If their proposed defect mitigation protocols hold up under real-world noise conditions, it suggests a pathway to building more resilient processors where localized damage doesn't necessarily mean total system failure.

Kai: It’s exciting because this moves the problem from just trying to fix errors after they happen to preventing them through dynamic routing during operation.

Mira: And that brings up the massive question of scalability; can we practically implement these long-distance shuttling protocols reliably on a silicon platform?

Lev: That's where it gets tough; running those complex movement algorithms on actual hardware without introducing new noise sources is the next big hurdle they have to clear.

Adam Siegel, *Zhenyu Cai, Hamza Jnane, Balint Koczor, Shaun Pexton, Armands Strikis, *Simon Benjamin

Quantum Motion Department of Materials University of Oxford Mathematical Institute Department of Physics and Astronomy University College London

quant-ph

Submitted: 2025-01-03

Updated: 2025-01-03

Comments: 27 pages, 23 figures

Journal ref: PRX Quantum 7, 010339, 25 February, 2026

DOI: 10.1103/494s-jd8h

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 80/100

The gist: Mobile, low-dimensional logical qubits on a 2D surface explore an architecture where logical qubits are represented as movable, snake-like strings that navigate a planar latticework to achieve

Key concepts

Logical Qubits as Snakes
Logical qubits are not fixed but are represented as 1D strings or 'snakes' of physical qubits. These snakes can be moved freely across a 2D latticework, enabling the global relocation of logical information and allowing the system to bypass potentially defective physical links.
Snake Surgery
This is a protocol used to mitigate errors caused by static defects while shuttling logical qubits. It involves using monitor qubits and analyzing the complementary gap to detect defect-related events, allowing researchers to 'reverse time' and retrieve the qubit's state before the defect occurred.
Complementary Gap Filtering
This technique filters out errors by measuring the length difference between error strings that yield opposite logical outcomes. By selecting only those error strings where a specific distance parameter is met, it effectively rejects erroneous shuttling links, significantly reducing the logical error rate.
All-to-All Connectivity
The architecture is designed to provide all-to-all connectivity between logical qubits through long-distance shuttling. This allows any two logical qubits to interact directly. The system achieves this connectivity as long as the defect rate in shuttling links stays below a certain threshold.

Terminology

Summary

Mobile, low-dimensional logical qubits on a 2D surface explore an architecture where logical qubits are represented as movable, snake-like strings that navigate a planar latticework to achieve all-to-all connectivity and enhanced damage tolerance in silicon spin qubit systems.

The gist

Logical qubits are 1D strings (‘snakes’) that can be moved freely over a planar latticework, allowing for the global movement of logical qubits at the device scale and the exclusion of potentially defective links, while mitigating errors caused by static defects through protocols like 'snake surgery'.

How it works

  1. The architecture utilizes a 2D latticework formed of low-dimensional array strands that occasionally meet at junctions or run parallel, tailored for silicon spin qubits. Logical qubits are embodied as strings of physical qubits local to a given region of the latticework.

  2. Interaction between logical snakes is facilitated by a semi-transversal method, which enables all-to-all connectivity at the logical level and allows for the implementation of two-qubit gates transversally or semi-transversally.

  3. To mitigate errors caused by static defects 'scratching' a logical qubit during shuttling, a protocol called 'snake surgery' is introduced. This involves using monitor qubits and the complimentary gap to infer defect-related events, allowing one to reverse time and retrieve the logical qubit’s state before the defect occurred.

  4. The system employs two primary detection schemes: continual evaluation of the effective magnetic field landscape via monitor qubits, and analysis of the stabiliser measurements signature by computing the syndrome’s complementary gap.

Error Mitigation Strategies

(a) Mitigating Charge Noise:

Charge noise is a dominant source of noise in silicon spin qubits, causing fluctuations in the g-factor landscape. This can lead to either slow and small variations or sudden and severe phase errors. The paper proposes a protocol that is highly effective by utilizing two defect detection schemes: one based on monitor qubits to evaluate the effective magnetic field landscape, and another analyzing the stabiliser measurements signature via the complementary gap.

(b) Defect Detection Protocols:

The system employs two primary detection schemes:

  1. A continual evaluation of the effective magnetic field landscape via monitor qubits to detect if a shuttling link is defective, which informs a robust shuttling protocol called 'snake surgery'.

  2. Analysis of the stabiliser measurements signature by computing the syndrome’s complementary gap, which allows for distinguishing between stabiliser signatures arising from defects or normal circuit noise.

(c) Complementary Gap Filtering:

The complementary gap measures the length difference between the shortest error strings explaining a syndrome but yielding opposite logical outcomes. The selection rule for post-selection is set as 'g ≥ gmin', where gmin is a distance-dependent parameter, specifically chosen as (d + 1)/2 to achieve a rejection rate of 3-5% of shuttling links, which is considered the desired tolerance. This filtering significantly shrinks the logical error rate by enhancing the decoder's performance.

Universal Computation and Connectivity

(a) Logical Level Connectivity:

The architecture boasts an all-to-all connectivity at the logical level, enabled by long-distance shuttling of logical qubits. The connectivity graph forms a (rotated) square lattice where interaction edges represent connections between adjacent white tiles (logical qubits). All-to-all connectivity is guaranteed as long as the proportion of defective shuttling links remains below 50%, based on side and bond percolation thresholds for the square lattice.

(b) Universal Set of Gates:

The universal set advocated is the classic set:

  1. CNOT, H, S, T gates.

  2. Transversal gates can be implemented via interaction edges where two logical snakes are made adjacent, which is more efficient than lattice surgery for CNOT gates.

  3. Hadamard gates can be applied transversally or via gate teleportation using a transversal H gate and measurement in the Z basis.

  4. The CY gate can be decomposed as S·CNOT·S†, with implementations for S and T gates adopted via conventional choices involving gate teleportation and additional magic state distillation.

(c) Semi-transversal CNOT Gates:

To address the scaling problem of transversal CNOTs requiring shuttling distances of O(d 2), a semi-transversal gate protocol is employed. This involves performing transversal operations in discrete batches while concurrently stabilising all physical qubits not actively involved in the interaction, thereby reducing the cumulative impact of shuttling noise.

Platform Choice and Performance

(a) Platform Suitability:

Silicon spin qubits are identified as a promising platform due to their high coherence times, scalability, compatibility with advanced manufacturing, and demonstrated two-qubit gate fidelities above 99%. 2×N arrays of silicon spin qubits have already been demonstrated.

Improvements for AI systems

Here are the specific improvements an AI system could implement based on this research, along with its resulting capabilities:

The core improvement is the development of a novel fault-tolerant quantum computing architecture suitable for silicon spin qubits, specifically leveraging snakes on a plane logic and sophisticated defect detection protocols.

Specifically, the improved AI system can perform the following functions:

  1. Extended Quantum Computation via Logical Qubit Shuttling:

  2. High-Fidelity Universal Gate Implementation:

  3. Active Defect Mitigation (Snake Surgery):

  4. Adaptive Noise Characterization and Real-Time Error Correction:

The resulting improved AI system can do the following:

The AI system can perform the following specific actions:

  1. Perform complex, long-distance quantum operations across a 2D latticework of silicon spin qubits without accumulating correlated errors, by dynamically routing logical snakes around detected defects.

  2. Execute a universal set of quantum gates (CNOT, Hadamard, S, T) with reduced time overhead by utilizing semi-transversal gate protocols that batch transversal operations and concurrently stabilize non-involved qubits.

  3. Detect the presence of static defects (pin charges) in real-time by analyzing monitor qubit measurements and the complementary gap signature of stabilizer measurements. Upon detection, it can initiate a snake surgery protocol to reverse time and retrieve the logical state before corruption occurs, effectively canceling defect-induced errors if they are phase-like.

  4. Dynamically adjust its error tolerance based on noise conditions by implementing adaptive filtering:

  5. Estimate the precise phase shift of shuttling links (Task ii) using advanced monitor qubit measurement techniques to optimally sense rotation angles up to and beyond the surface code threshold, allowing for dynamic rejection of noisy routes;

  6. Optimize quantum circuit performance by dynamically selecting the most robust encoding (e.g., Singlet-Triplet encoding) based on real-time charge noise models;

  7. Minimize overall logical error rates by balancing two detection strategies: post-selection based on high complementary gaps (which drastically shrinks the error probability for non-defective links) and monitor qubit detection, ensuring near-perfect resilience against catastrophic events.

Abstract

Recent demonstrations indicate that silicon-spin QPUs will be able to shuttle physical qubits rapidly and with high fidelity - a desirable feature for maximising 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 complimentary gap; if deemed a risk, remarkably the shuttle process can be undone in a way that negates any corruption. Interaction between logical snakes is facilitated by a semi-transversal method. We obtain encouraging estimates for the tolerable levels of shuttling-related imperfections.

Sources

Related papers