Transversal Gates and Magic State Distillation in an Optimally Synthesized Spin-Qubit Shuttling Bus

• URL: http://arxiv.org/abs/2609.02641v1
• Date: Wed, 02 Sep 2026 14:17:47 GMT
• Title: Transversal Gates and Magic State Distillation in an Optimally Synthesized Spin-Qubit Shuttling Bus
• Abstract summary: Fault-tolerant quantum computing requires reliable logical qubit storage and high-fidelity logical operations between error-corrected qubits.<n>We propose a multi-qubit spin-qubit shuttling bus architecture that addresses both requirements simultaneously.<n>Results establish a principled co-design framework that bridges the physical, error-correction, and logical computation layers of the quantum stack.
• Score: 1.62107954358883
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computing requires not only reliable logical qubit storage, but also the ability to perform high-fidelity logical operations between error-corrected qubits at scale. While much of the existing literature focuses on optimizing syndrome extraction for a single logical qubit, the co-design of physical architectures that support both robust error correction and efficient logical computation remains an open challenge. In this work, we propose a multi-qubit spin-qubit shuttling bus architecture that addresses both requirements simultaneously. The architecture optimizes the physical qubit layout for syndrome extraction and supports transversal two-qubit logical gates between an arbitrary number of logical qubits, achieving all-to-all logical connectivity through coherent spin shuttling. We further propose an ancilla-sharing scheme that encodes multiple logical qubits within a single logical element, compressing the physical footprint of the processor and improving long-range gate fidelity. Extending the architecture from a one-dimensional bus to a two-dimensional grid of shuttling tracks reduces the inter-qubit distance, yielding consistent improvements in logical error. Finally, we apply the Quantum Reverse Mapping methodology at the logical level to optimize the layout of a \textit{15-to-1} magic state distillation circuit, demonstrating how the transversal capabilities of the proposed architecture can be leveraged for universal fault-tolerant computation. Taken together, these results establish a principled co-design framework that bridges the physical, error-correction, and logical computation layers of the quantum stack, and demonstrate that spin-qubit shuttling architectures are a viable and flexible substrate for scalable fault-tolerant quantum computation.

Related papers

• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• General circuit mapping algorithm for neutral atom quantum computers [1.047947389293086]
  Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform.<n> circuit execution often requires physically moving qubits, making compilation a critical optimization challenge.<n>We propose a circuit independent mathematical framework built on graph-theoretic optimization that determines the minimal number of required qubit transfers.
  arXiv  Detail & Related papers  (2026-06-18T17:21:23Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement: Shor's Algorithm, Constant-Depth CNOT Ladder, and Many-Hypercube Code [23.109092385238526]
  We propose and experimentally realize an alternative architecture which unites qubit motion and in-place entanglement via nearest-neighbor gates.<n>Our approach maintains all-to-all connectivity, while minimizing qubit motion overheads.
  arXiv  Detail & Related papers  (2025-09-16T16:55:42Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code [5.89889361990138]
  We propose a new ion-trap optimized architecture for the efficient execution of both gate and non-transversal operations.<n>By differentiating the regions for gates from those for non-transversal gates and syndrome extraction, our chip layout minimizes ion shuttling and simplifies physical implementations.
  arXiv  Detail & Related papers  (2025-01-25T12:49:07Z)
• Logical quantum processor based on reconfigurable atom arrays [27.489364850707926]
  We report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Results herald the advent of early error-corrected quantum computation.
  arXiv  Detail & Related papers  (2023-12-07T01:54:45Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Mapping quantum circuits to modular architectures with QUBO [3.0148208709026005]
  In multi-core architectures, it is crucial to minimize the amount of communication between cores when executing an algorithm. We propose for the first time a Quadratic Unconstrained Binary Optimization technique to encode the problem and the solution. Our method showed promising results and performed exceptionally well with very dense and highly-parallelized circuits.
  arXiv  Detail & Related papers  (2023-05-11T09:45:47Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.