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.
Optimized compilation for distributed quantum computing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
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
-
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.