Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application

• URL: http://arxiv.org/abs/2609.08233v1
• Date: Tue, 08 Sep 2026 04:26:44 GMT
• Title: Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application
• Abstract summary: We study a resource-efficient approach for implementing logical fanout operations in fault-tolerant distributed quantum computing.<n>We exploit the structure of encoded blocks and the availability of encoded logical operations to construct distributed fanout circuits.
• Score: 2.720960618356385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study a resource-efficient approach for implementing logical fanout operations in fault-tolerant distributed quantum computing using transversal operations on quantum error-correcting code blocks. Logical fanout, comprising multiple controlled-NOT operations from a common control qubit to target qubits located at remote nodes, is an important primitive for distributed quantum computation but can require substantial non-local communication when implemented directly between encoded blocks. We exploit the structure of encoded blocks and the availability of transversal logical operations to construct distributed fanout circuits that reduce the required non-local operations while preserving the logical action of the fanout operation. The construction is developed for encoded quantum information and illustrated using Bivariate Bicycle (BB)-code blocks. We analyze the resulting physical gate, entanglement, circuit-depth, and ancilla requirements. The approach provides a systematic method for implementing large logical fanout operations across distributed error-corrected quantum processors. Also, we study a distributed implementation of the global gate GCZ involving logical qubits (encoded using BB-code blocks), exploiting the concurrency in transversal distributed fanouts.

Related papers

• Need One Bell-pair Only (NOBOL) for Low-Overhead Fault-Tolerant Quantum Computing [18.543220644724755]
  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.<n>We describe various circuit realizations of NOBOL, including a depth-optimal circuit with logarithmic depth in terms of the size of the logical operators.
  arXiv  Detail & Related papers  (2026-09-01T22:02:03Z)
• 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)
• Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits [0.0]
  We develop techniques for qubit allocation using an exemplar color code family.<n>We show that a 10% reduction in processor-nonlocal gates is achievable in a setting where syndrome extraction occurs after every logical gate.
  arXiv  Detail & Related papers  (2026-04-23T14:25:55Z)
• Addressable gate-based logical computation with quantum LDPC codes [0.0]
  High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge.<n>We introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual qubits encoded within one or more quantum LDPC codes.
  arXiv  Detail & Related papers  (2025-11-08T20:26:24Z)
• Planar Fault-Tolerant Quantum Computation with Low Overhead [5.232949916418351]
  We introduce code craft, a framework for designing fault-tolerant logical operations on planar BB codes.<n>We show that logical operations, including controlled-NOT gates, state transfers, and Pauli measurements, can be efficiently implemented within this framework.
  arXiv  Detail & Related papers  (2025-06-22T15:07:03Z)
• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits [31.25958618453706]
  We demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit.<n>We achieve an improvement in the value of the decoded $ZZ$ logical two-qubit observable compared to a similar non-encoded circuit.
  arXiv  Detail & Related papers  (2025-01-08T16:49:27Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• 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)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)
• Entangling logical qubits with lattice surgery [47.037230560588604]
  We show the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information processor. In particular, we demonstrate entanglement between two logical qubits and we implement logical state teleportation.
  arXiv  Detail & Related papers  (2020-06-04T18:00: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.