Convexification of the Quantum Network Utility Maximisation Problem
Sounak Kar, Stephanie Wehner

TL;DR
This paper introduces a convexification approach for the quantum network utility maximisation problem, enabling efficient optimal resource allocation in quantum networks with heterogeneous entanglement measures.
Contribution
It formulates QNUM as a convex optimization problem using geometric programming techniques, allowing efficient solutions in complex quantum network scenarios.
Findings
QNUM can be formulated as a convex problem under certain conditions.
Convexification preserves problem structure across heterogeneous routes.
Efficient computation of optimal resource allocation in quantum networks.
Abstract
Network Utility Maximisation (NUM) addresses the problem of allocating resources fairly within a network and explores the ways to achieve optimal allocation in real-world networks. Although extensively studied in classical networks, NUM is an emerging area of research in the context of quantum networks. In this work, we consider the quantum network utility maximisation (QNUM) problem in a static setting, where a user's utility takes into account the assigned quantum quality (fidelity) via a generic entanglement measure as well as the corresponding rate of entanglement generation. Under certain assumptions, we demonstrate that the QNUM problem can be formulated as an optimisation problem with the rate allocation vector as the only decision variable. Using a change of variable technique known in the field of geometric programming, we then establish sufficient conditions under which this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
