Simulation Results for a Quantum Satellite Network Routing Algorithm

A 1.8 MB dataset by András Mihály, last updated April 9, 2026, containing simulation results for a novel entanglement-swapping algorithm designed for quantum satellite networks. The algorithm aims to alleviate memory saturation bottlenecks by utilizing leftover entanglement in quantum memories. It was evaluated through simulations on both static fibre-based and dynamic satellite networks.

Use Cases

• Benchmarking quantum network routing algorithms based on entanglement generation rates and memory capacity constraints described in the paper.
• Analyzing the impact of the SwapWithToUse algorithm variant on long-range network connectivity as mentioned in the evaluation.
• Simulating dynamic satellite network performance under short visibility windows, a key constraint highlighted in the description.
• Studying the effect of independent entanglement swap pairs, selected via line graphs and maximum-cardinality matching, on network efficiency.

Strengths

• Dataset is 1.8 MB, indicating a manageable download size.
• Released under a permissive CC-BY-4.0 license, allowing for broad reuse.
• Associated with a specific, peer-reviewed algorithm (SwapWithToUse) described in the paper.

Limitations

• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Description metadata is limited; actual data quality requires manual inspection after download.

Provenance

Source

figshare, author András Mihály.

Collection Method

Likely contains results from simulations of quantum network routing algorithms.

Time Range

null

Freshness

Last updated 2026-04 09 08:31:17; freshness should be verified.

Geography

null