Surrogate-guided optimization in quantum networks
arXiv:2407.17195 · doi:10.1038/s41534-025-01048-3
Abstract
We propose an optimization algorithm to improve the design and performance of quantum communication networks. When physical architectures become too complex for analytical methods, numerical simulation becomes essential to study quantum network behavior. Although highly informative, these simulations involve complex numerical functions without known analytical forms, making traditional optimization techniques that assume continuity, differentiability, or convexity inapplicable. Additionally, quantum network simulations are computationally demanding, rendering global approaches like Simulated Annealing or genetic algorithms, which require extensive function evaluations, impractical. We introduce a more efficient optimization workflow using machine learning models, which serve as surrogates for a given objective function. We demonstrate the effectiveness of our approach by applying it to three well-known optimization problems in quantum networking: quantum memory allocation for multiple network nodes, tuning an experimental parameter in all physical links of a quantum entanglement switch, and finding efficient protocol settings within a large asymmetric quantum network. The solutions found by our algorithm consistently outperform those obtained with our baseline approaches -- Simulated Annealing and Bayesian optimization -- in the allotted time limit by up to 18\% and 20\%, respectively. Our framework thus allows for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.
20 pages (including supplementary notes), 12 figures
References in corpus (25)
- Mixed State Entanglement and Quantum Error Correction
- Quantum-enhanced measurements: beating the standard quantum limit
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- On-the-fly Closed-loop Autonomous Materials Discovery via Bayesian Active Learning
- Quantum repeaters: From quantum networks to the quantum internet
- Deterministic delivery of remote entanglement on a quantum network
- Deep UQ: Learning deep neural network surrogate models for high dimensional uncertainty quantification
- Universal blind quantum computation
- COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Setting
- Quantum Clock Synchronization Based on Shared Prior Entanglement
- Coherence time of over a second in a telecom-compatible quantum memory storage material
- Unconditionally verifiable blind computation
- A Link Layer Protocol for Quantum Networks
- NetSquid, a NETwork Simulator for QUantum Information using Discrete events
- BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization
- System Design for a Long-Line Quantum Repeater
- Designing a Quantum Network Protocol
- SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks
- Machine learning for long-distance quantum communication
- Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
- Policies for elementary links in a quantum network
- Optimizing Entanglement Generation and Distribution Using Genetic Algorithms
- Requirements for a processing-node quantum repeater on a real-world fiber grid
- Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
- Performance metrics for the continuous distribution of entanglement in multi-user quantum networks