Related papers: On Utility-optimal Entanglement Routing in Quantum…
The key objective of the Quantum Internet is the distribution and manipulation of entanglement to enable unprecedented applications. This requires a radical departure from classical Internet design principles, such as the end-to-end…
Combinatorial optimization problems have attracted much interest in the quantum computing community in the recent years as a potential testbed to showcase quantum advantage. In this paper, we show how to exploit multilevel carriers of…
In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater…
Optimization of electricity surplus is a crucial element for transmission power networks to reduce costs and efficiently use the available electricity across the network. In this paper we showed how to optimize such a network with quantum…
The concave utility in the Network Utility Maximization (NUM) problem is only suitable for elastic flows. However, the networks with the multiclass traffic, the utility of inelastic traffic is usually represented by the sigmoidal function…
Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss. The first step towards enabling quantum networks is the integration of quantum repeaters into optical…
Resource allocation of wide-area internet networks is inherently a combinatorial optimization problem that if solved quickly, could provide near real-time adaptive control of internet-protocol traffic ensuring increased network efficacy and…
Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal-dual method.…
Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. In this paper, we consider how a quantum network-nodes equipped with limited quantum…
Quantum Key Distribution (QKD) networks require routing methodologies capable of jointly optimizing latency, secret key generation rate, congestion, finite capacity and operational security constraints under dynamically evolving traffic…
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple…
We explore the near-term intersection of quantum computing with the transport sector. To support near-term integration, we introduce a framework for assessing the suitability of transport optimization problems for obtaining potential…
The network utility maximization problem (NUM) for multi-path is a problem which is non-strictly convex and non-separable. Using Jensen's inequality, we approximate the NUM to a strictly convex and separable problem which can be solved…
This thesis focuses on the intersection of mathematical and computational optimization and quantum information. Main contributions are open-source software code: A hybrid approach mixing "traditional" nonconvex and convex methods can make…
We introduce QuARC, Quantum Adaptive Routing using Clusters, a novel clustering-based entanglement routing protocol that leverages redundant, multi-path routing through multi-particle projective quantum measurements to enable…
The quantum internet is one of the frontiers of quantum information science. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The…
Network Utility Maximization (NUM) studies the problems of allocating traffic rates to network users in order to maximize the users' total utility subject to network resource constraints. In this paper, we propose a new NUM framework,…
Wireless Multihop Networks (WMHNs) have to strike a trade-off among diverse and often conflicting Quality-of-Service (QoS) requirements. The resultant solutions may be included by the Pareto Front under the concept of Pareto Optimality.…
In quantum networks multipath entanglement purification (MEP) between a pair of source-destination nodes can substantially strengthen their entanglement connection. An efficient MEP strategy can therefore increase the size of the network…
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing…