New stationary randomized and Lyapunov-based policies achieve constant-factor optimal Age of Information in interference-coupled multi-AP WLANs, with simulations showing 50% reduction over single-AP baselines.
Qubit Allocation for Dis- tributed Quantum Computing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative 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.
citing papers explorer
-
Optimizing Information Freshness for Wireless Local Area Networks with Multiple APs
New stationary randomized and Lyapunov-based policies achieve constant-factor optimal Age of Information in interference-coupled multi-AP WLANs, with simulations showing 50% reduction over single-AP baselines.
-
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.