Column Generation for the Optimization of Switching in Repeaterless Quantum Networks
This work addresses the optimization of switching for repeaterless quantum networks, which is crucial for improving key rates, adaptability, and cost reduction in quantum communication, though it appears incremental as it builds on existing linear programming and column generation methods.
The paper tackled the problem of identifying optimal switching configurations in repeaterless quantum networks, which is challenging due to combinatorial complexity, by introducing a graph formulation and solving it with column generation, resulting in a scalable algorithm that demonstrated effectiveness in empirical tests.
Efficient resource allocation and optical switching promise high key rates, network adaptability, and cost reduction in repeaterless quantum communication networks. However, identifying optimal switching configurations remains a significant challenge due to the combinatorial complexity. We introduce a novel graph formulation to model the physical and logical structure of repeaterless quantum networks, enabling the systematic optimization of switching strategies. The problem is posed as a linear program and solved using a column generation approach. This method enables scalable computation despite the exponential number of possible network configurations. Our results not only provide a formal foundation but also a practical algorithm for the optimization of switching. Empirical tests confirm the solver's scalability with network size, demonstrating the framework's effectiveness and laying the groundwork for future optimization of quantum network control.