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

• URL: http://arxiv.org/abs/2510.18652v1
• Date: Tue, 21 Oct 2025 14:02:20 GMT
• Title: Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC
• Authors: Yohei Ibe, Yutaka Hirano, Yasuo Ozu, Toru Kawakubo, Keisuke Fujii,
• Abstract summary: We propose a measurement-based FTQC architecture for high-connectivity platforms such as trapped ions and neutral atoms.<n>Key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation.<n>We present two implementations benchmarked under circuit-level depolarizing noise.
• Score: 2.511618458985613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Addressable fault-tolerant universal quantum gate operations for high-rate lift-connected surface codes [0.8919684307774216]
  Quantum low-density parity check (qLDPC) codes are among the leading candidates to realize error-corrected quantum memories with low qubit overhead.<n>In this work, we introduce a construction to implement all Clifford quantum gate operations on the recently introduced lift-connected surface (LCS) codes.
  arXiv  Detail & Related papers  (2025-11-13T11:01:44Z)
• Flag at origin: a modular fault-tolerant preparation for CSS codes [0.0]
  Fault-tolerant (FT) preparation of diverse logical stabilizer states in quantum error-correcting (QEC) codes is essential for FT computation.<n>This work introduces a modular construction for FT preparation circuits in CSS codes of arbitrary distance.
  arXiv  Detail & Related papers  (2025-08-19T18:47:49Z)
• Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate [1.6986469299341722]
  We propose a magic-state preparation protocol to fault-tolerantly prepare a pair of logical magic states in a quantum error-detecting code using only eight physical qubits.<n>We show that this protocol can be self-concatenated to produce extremely high-fidelity magic states with low space-time overhead.
  arXiv  Detail & Related papers  (2025-06-17T16:23:47Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Scalable projected entangled-pair state representation of random quantum circuit states [0.0]
  We show the update of projected entangled-pair states (PEPSs) in the Vidal gauge that represent random quantum circuit states.<n>We find the universal scaling behaviors of the state fidelity by treating large-scale circuits ofn leq 104$, using $chi leq 128$ on a conventional CPU.
  arXiv  Detail & Related papers  (2025-04-07T06:47:48Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [42.95092131256421]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8453577061453568]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations.<n>We show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound [44.154181086513574]
  We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ frackn = frac13 $. We demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs.
  arXiv  Detail & Related papers  (2024-10-05T11:56:15Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• LDPC-cat codes for low-overhead quantum computing in 2D [3.9373541926236766]
  Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing. An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits. We propose an architecture based on cat qubits suppressed in classical LDPC codes for phase-flips.
  arXiv  Detail & Related papers  (2024-01-17T19:00:05Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

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.