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.
Optimized compilation for distributed quantum computing
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
Global optimization minimizes gate counts and compilation overhead in distributed quantum circuits, local optimization reduces non-local gates, and hybrid approaches balance both at the cost of much higher compilation time.
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.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
-
Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings
Global optimization minimizes gate counts and compilation overhead in distributed quantum circuits, local optimization reduces non-local gates, and hybrid approaches balance both at the cost of much higher compilation time.