• Quantum Physics [Submitted on 24 Feb 2026] Title:Telemetry-Based Server Selection in the Quantum Internet via Cross-Layer Runtime Estimation View PDF HTML (experimental)Abstract:The Quantum Internet will allow clients to delegate quantum workloads to remote servers over heterogeneous networks, but choosing the server that minimizes end-to-end execution time is difficult because server processing, feedforward classical communication, and entanglement distribution can overlap in protocol-dependent ways and shift the runtime bottleneck. • We propose $T_{\max}$, a lightweight runtime score that sums coarse telemetry from multiple layers to obtain a conservative ranking for online server selection without calibrating weights for each deployment. • Using NetSquid discrete-event simulations of a modified parameter-blind VQE (PB-VQE) workload, we evaluate $T_{\max}$ on pools of 10,000 heterogeneous candidates (selecting among up to 100 per decision) across crossover and bottleneck-dominated regimes, including temporal jitter scenarios and jobs with multiple shots. • $T_{\max}$ achieves single-digit mean regret normalized by the oracle (below 10%) in both regimes and remains in the single-digit range under classical communication latency jitter for multi-shot jobs, while performance degrades for single-shot jobs under severe jitter. • To connect performance to deployment planning, we derive an operating map based on requirements relating distance and entanglement rate requirements to protocol

Article Summaries:

  • Quantum Physics [Submitted on 24 Feb 2026] Title:Telemetry-Based Server Selection in the Quantum Internet via Cross-Layer Runtime Estimation View PDF HTML (experimental)Abstract:The Quantum Internet will allow clients to delegate quantum workloads to remote servers over heterogeneous networks, but choosing the server that minimizes end-to-end execution time is difficult because server processing, feedforward classical communication, and entanglement distribution can overlap in protocol-dependent ways and shift the runtime bottleneck. We propose $T_{\max}$, a lightweight runtime score that sums

Sources: