Reproduce “An on-demand resource allocation algorithm for a quantum network hub and its performance analysis” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Scarlett Gauthier, Thirupathaiah Vasantam, Gayane Vardoyan

Researchers from QuTech and Durham University developed an on-demand resource allocation algorithm for memory-less Entanglement Generation Switches (EGS) in quantum networks, providing analytical formulas for demand blocking probability that are insensitive to call duration distributions. Their analysis shows that a "jump-over blocking" mechanism yields lower blocking probabilities and higher total entanglement generated than strict resource reservation, and increasing communication qubits beyond two per node offers diminishing returns.

Key insights

  • The demand blocking probability for an EGS operating in strict resource reservation mode is insensitive to the underlying statistical distributions of attempt and calibration period durations, depending only on their mean values.
  • Under high load, the "jump-over blocking" service model, which allows EGS resource relinquishment during idle periods, yields lower blocking probabilities and a greater total amount of entanglement generated compared to strict resource reservation.
  • Increasing the number of communication qubits per node from one to two significantly reduces blocking probability, but further increases (e.g., to three or more) provide limited additional benefit, indicating diminishing returns.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.