Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC

TL;DR

This paper introduces a measurement-based fault-tolerant quantum computing architecture optimized for high-connectivity devices, enabling large-scale quantum computations with low classical overhead and practical resource requirements.

Contribution

It proposes a novel MB-FTQC architecture utilizing verified logical ancillas and error-correcting teleportation, tailored for near-term high-connectivity quantum hardware.

Findings

Supports megaquop-scale computation with ~10^6 T gates on thousands of qubits.

Enables gigaquop-scale computation with ~10^9 T gates on tens of thousands of qubits.

Achieves low classical overhead by simplifying decoding to logical Pauli corrections.

Abstract

We propose a measurement-based FTQC (MB-FTQC) architecture for high-connectivity platforms such as trapped ions and neutral atoms. The key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation, eliminating repeated syndrome measurements and simplifying decoding to logical Pauli corrections, thus keeping classical overhead low. To align with near-term device scales, we present two implementations benchmarked under circuit-level depolarizing noise: (i) a Steane-code version that uses analog $R_Z(\theta)$ rotations, akin to the STAR architecture [Akahoshi et al., PRX Quantum 5, 010337], aiming for the megaquop regime ($\sim 10^6$ $T$ gates) on devices with thousands of qubits; and (ii) a Golay-code version with higher-order zero-level magic-state distillation, targeting the gigaquop regime ($\sim 10^9$ $T$ gates) on devices with tens of thousands of qubits. At a physical error rate $p=10^{-4}$, the Steane path supports $5\times 10^{4}$ logical $R_Z(\theta)$ rotations, corresponding to $\sim 2.4\times 10^{6}$ $T$ gates and enabling megaquop-scale computation. With about $2{,}240$ physical qubits, it achieves $\log_{2}\mathrm{QV}=64$. The Golay path supports more than $2\times 10^{9}$ $T$ gates, enabling gigaquop-scale computation. These results suggest that our architecture can deliver practical large-scale quantum computation on near-term high-connectivity hardware without relying on resource-intensive surface codes or complex code concatenation.