Multi-gate teleportation reduces remote gate entanglement cost to one ebit with fault-tolerance bound n_max = ceil(d/2) for distance-d surface codes; standard MWPM decoders match or beat sequential teleportation at high network-to-local noise ratios without custom design.
Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance under circuit level noise by varying the number of processors and a scaling factor that captures the additional noise associated with nonlocal operations. We use Monte Carlo simulations with BP+OSD decoding and extend the previously known BB code ansatz to the distributed setting. Our results provide architectural insight and design considerations for distributed BB codes in modular quantum computing architectures.
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A modular end-to-end simulation framework jointly models surface-code operations, QPU connectivity, and network constraints to produce execution latency and logical error rate estimates, revealing network-dependent operating regimes for distributed quantum computing.
citing papers explorer
-
Design rules for fault-tolerant multi-gate teleportation
Multi-gate teleportation reduces remote gate entanglement cost to one ebit with fault-tolerance bound n_max = ceil(d/2) for distance-d surface codes; standard MWPM decoders match or beat sequential teleportation at high network-to-local noise ratios without custom design.
-
Impact of Network Constraints on Fault-Tolerant Distributed Quantum Computing
A modular end-to-end simulation framework jointly models surface-code operations, QPU connectivity, and network constraints to produce execution latency and logical error rate estimates, revealing network-dependent operating regimes for distributed quantum computing.