Quantify interpolation error in reused demand lookup tables

Quantify the interpolation error incurred when lookup tables computed for nearby requested link counts are used to approximate the minimum-separation violation probability across different physical configurations.

Background

The analytical framework precomputes the conditional probability of a minimum-separation violation as a function of the PGA ingress and packet-generation probability. These lookup tables are computed for each physical configuration, including the entanglement-generation rate, coherence-window size, and requested link count.

The paper observes that when the expected number of link arrivals within the coherence window is large, changing the requested link count by one produces only a small change in the associated z-score. This suggests that lookup tables for nearby link counts might be reused through interpolation, but the accuracy of that approximation has not been quantified.

References

In regimes where $\lambda w$ is large, a unit change in $s$ produces only a small shift in $z$-score ($\Delta z = 1/\sqrt{\lambda w}$), suggesting that tables computed for nearby~$s$ values may provide reasonable approximations without recomputation. Quantifying the interpolation error across configurations is left to future work.

— Tools for Reducing Service Time in Near-Term Quantum Networks  (2608.20954 - Smith et al., 21 Aug 2026) in Section V-B, “Demand Lookup Tables”