The Quantum Age of IT

Jeff Lemire

Charlotte D. Shelton

Christopher A. Fuchs

Ozgur Ercetin, Zafer Gedik

Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold Fmin. A renewal formulation links slot-level success probability to long-run average FA, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. Fidelity-Age thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.

Jay Liebowitz

Robert R. Tucci

We propose a new inequality that we call the conditional ageing inequality (CAIN). The CAIN is a slight generalization to non-equilibrium situations of the Second Law of thermodynamics. The goal of this paper is to study the consequences of the CAIN. We use the CAIN to discuss Maxwell demon processes (i.e., thermodynamic processes with feedback.) In particular, we apply the CAIN to four cases of the Szilard engine: for a classical or a quantum system with either one or two correlated particles. Besides proposing this new inequality that we call the CAIN, another novel feature of this paper is that we use quantum Bayesian networks for our analysis of Maxwell demon processes.