Skip to content
Preprint

Need One Bell-pair Only (NOBOL) for Low-Overhead Fault-Tolerant Quantum Computing

Sep 2026 · 0 citations · 34 references
Physics

TL;DR

This paper proposes NOBOL, a novel approach that requires only one Bell pair to perform a logical CNOT operation on two distant qubits encoded in arbitrary CSS codes and describes various circuit realizations of NOBOL, including a depth-optimal circuit with logarithmic depth in terms of the size of the logical operators.

Abstract

Fault-tolerant quantum computation fundamentally relies on encoding a logical qubit into a structured block of physical qubits, typically in the tens to hundreds. As a trade-off for improved fault-tolerance, logical gate operations will incur a linear overhead in terms of both the amount of time and quantum resources than before. For example, in monolithic quantum computing, performing a gate operation on two distant logical qubits will first require using a linear number of SWAP operations in order to move the logical qubits next to each other; while in distributed quantum computing, doing so will first require a linear number of ancilla qubits in order to form entanglement connections (or a logical Bell pair). In this paper, we focus on significantly reducing the overhead involved in logical CNOT operations, a fundamental primitive. We propose NOBOL, a novel approach that requires only one Bell pair to perform a logical CNOT operation on two distant qubits encoded in arbitrary CSS codes. More importantly, NOBOL only requires performing gate operations on the logical X or Z operator subsets of the logical qubits. For many CSS codes, such as the surface code, these subsets are significantly smaller than the size of the code itself. In this paper, we describe various circuit realizations of NOBOL, including a depth-optimal circuit with logarithmic depth in terms of the size of the logical operators. Finally, we propose effective methods to contain error propagation without incurring much additional overhead. Since NOBOL can be effectively applied to a wide range of quantum error-correcting (QEC) codes and, in addition, is agnostic to qubit modalities and effective for various architectures, including those based on either a monolithic QPU or distributed QPUs.

View source

Similar papers

Preprint Sep 2026

Error Correction in a Distributed Quantum Computer

The first experimental demonstration of distributed quantum error detection and correction is reported, providing an experimental foundation for quantum error correction (QEC) across modular quantum architectures.

E. M. Ainley, A. Agrawal, T. Araki et al. · 2 citations
Preprint Sep 2026

Modular fault-tolerant quantum computing on a non-CSS code

This work implements for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer, and demonstrates the smallest quantum error-correcting (QEC) code capable of cor...

R. Freund, F. Butt, Cesar Benito et al. · 0 citations
Preprint Sep 2026

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

A principled co-design framework is established that bridges the physical, error-correction, and logical computation layers of the quantum stack, and demonstrates that spin-qubit shuttling architectures are a viable and flexible substrate for scalable fault-tolerant quantum computation.

Pau Escofet, Andrii Semenov, Niall Murphy et al. · 0 citations
Preprint Sep 2026

Experimental validation of a compact fault-tolerant architecture for trapped ions

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, a...

Noah F. Berthusen, Ali Lavasani, Asmae Benhemou et al. · 2 citations
Preprint Sep 2026

Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem

Recently, a hybrid qudit-qubit algorithm [1] was presented for solving the integer programming problem with a polynomial quantum advantage. In this work, we investigate the algorithm [1] to understand the role of qudits ($d$-dimensional quantum system) by conducting a comparative resource analysis with its qubit-only i...

Kapil Goswami, Rick Mukherjee, P. Schmelcher · 0 citations

Blueprint for fault-tolerant quantum computation with topological qubit arrays

A concrete device roadmap toward a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits is described, along with the associated protocols for demonstrations of single-qubit benchmarking, Clifford gate execution, quantum error detection.

D. Aasen, M. Aghaee, Zulfi Alam et al. · 5 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.