Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2006.16134 · Quantum

Optimal allocation of quantum resources

Roberto Salazar, Tanmoy Biswas, Jakub Czartowski, Karol Życzkowski, Paweł Horodecki

Published Mar 10, 2021• 4 citations
arXivHTMLPDF

Abstract

The optimal allocation of resources is a crucial task for their efficient use in a wide range of practical applications in science and engineering. This paper investigates the optimal allocation of resources in multipartite quantum systems. In particular, we show the relevance of proportional fairness and optimal reliability criteria for the application of quantum resources. Moreover, we present optimal allocation solutions for an arbitrary number of qudits using measurement incompatibility as an exemplary resource theory. Besides, we study the criterion of optimal equitability and demonstrate its relevance to scenarios involving several resource theories such as nonlocality vs local contextuality. Finally, we highlight the potential impact of our results for quantum networks and other multi-party quantum information processing, in particular to the future Quantum Internet.

DOI
10.22331/q-2021-03-10-407

Related papers

Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation

Zhaozhen Wang, Xingang Shi, Zhengfeng Ji +1 more

Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.

ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)•Jun 4, 2025•0 citations

Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation

Zhaozhen Wang, Xingang Shi, Zhengfeng Ji +1 more

Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.

ACM SIGMETRICS Performance Evaluation Review•Jun 16, 2025•0 citations

Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation

Zhaozhen Wang, Xingang Shi, Zhengfeng Ji +1 more

Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.

Proceedings of the ACM on Measurement and Analysis of Computing Systems•May 27, 2025•8 citations

Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation

Minrui Xu, Dusit Tao Niyato, Jiawen Kang +5 more

Quantum computing networks enable scalable collaboration and secure information exchange among multiple classical and quantum computing nodes while executing large-scale generative AI computation tasks and advanced quantum algorithms. Quantum computing networks overcome limitations such as the number of qubits and coherence time of entangled pairs and offer advantages for generative AI infrastructure, including enhanced noise reduction through distributed processing and improved scalability by connecting multiple quantum devices. However, efficient resource allocation in quantum computing networks is a critical challenge due to factors including qubit variability and network complexity. In this article, we propose an intelligent resource allocation framework for quantum computing networks to improve network scalability with minimized resource costs. To achieve scalability in quantum computing networks, we formulate the resource allocation problem as stochastic programming, accounting for the uncertain fidelities of qubits and entangled pairs. Furthermore, we introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation to resolve the proposed stochastic resource allocation problem efficiently. Finally, we optimize the resource allocation in heterogeneous quantum computing networks supporting quantum generative learning applications and propose a multi-agent RL-based algorithm to learn the optimal resource allocation policies without prior knowledge.

arXiv:2401.07120•Jan 13, 2024•15 citations

Optimum Resource Allocation in Secure Quantum Networks: Survey of Enabling Technology

Savo Glisic, Beatriz Lorenzo

Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacityC, for transmitting classical information; the quantum capacityQ, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacityQ2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacityCE, which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.

IEEE Access•Jan 1, 2025•3 citations

Enhancing Quantum Communication: A Fair and Restricted Resource Allocation Approach for Entanglement Networks

Li Na Ren, Z.W. Huang, Hong Lai +1 more

Quantum entanglement networks has ushered in a new era of communication, with the core task of generating long-distance quantum entanglement being crucial for a multitude of quantum applications. Although current research is primarily focused on establishing long-distance entanglement across various network topologies, there is still a lack of attention to the variability of communication requests within quantum networks. This paper introduces the Fair and Restricted Resource Allocation Algorithm (FARA), designed to meet the business-driven resource allocation requirements within quantum networks. This algorithm prioritizes the demands and urgency of requests to establish a fairer response mechanism, leading to an enhanced user experience. We refine the strategy for allocating network resources to maximize their use during multiple concurrent requests and to improve the success rate of business. Simulation results demonstrate that our proposed scheme improves the business success rate by 6.35% to 24.58% and user satisfaction by 0.922 to 4.533 points compared to the Q-CAST algorithm. Additionally, resource wastage is reduced by 473 to 800 units. These enhancements indicate that our research provides effective strategies for business-driven optimization in quantum networks and makes a positive contribution to the development of entanglement networks towards more practical and efficient applications.

IEEE Transactions on Network Science and Engineering•Mar 13, 2025•2 citations
The optimal allocation of resources is a crucial task for their efficient use in a wide range of practical applications in science and engineering. This paper investigates the optimal allocation of resources in multipartite quantum systems. In particular, we show the relevance of proportional fairness and optimal reliability criteria for the application of quantum resources. Moreover, we present optimal allocation solutions for an arbitrary number of qudits using measurement incompatibility as an exemplary resource theory. Besides, we study the criterion of optimal equitability and demonstrate its relevance to scenarios involving several resource theories such as nonlocality vs local contextuality. Finally, we highlight the potential impact of our results for quantum networks and other multi-party quantum information processing, in particular to the future Quantum Internet.
Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.
Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.
Quantum networks are essential infrastructure for enabling large-scale and long-distance quantum communications but face significant challenges in routing optimization and resource allocation due to their probabilistic nature and quantum resource limitations. Existing approaches typically tackle these problems in isolation, often by simply applying classical routing algorithms, maximizing the overall profit to allocate resources without considering fairness, or improving fairness in an ad-hoc way without a rigorous model. This paper proposes a general framework to systematically address these challenges. First, we conduct a thorough analysis of quantum network metrics using routing algebra as the mathematical foundation, and design provably optimal routing algorithms to tackle the unique challenges arising from their probabilistic characteristics. Second, we formulate an optimization model that simultaneously considers fairness among concurrent requests while respecting various quantum resource constraints, and design efficient near-optimal heuristics to solve it. The proposed framework provides both theoretical insights and practical solutions for the design and management of future quantum networks.
Quantum computing networks enable scalable collaboration and secure information exchange among multiple classical and quantum computing nodes while executing large-scale generative AI computation tasks and advanced quantum algorithms. Quantum computing networks overcome limitations such as the number of qubits and coherence time of entangled pairs and offer advantages for generative AI infrastructure, including enhanced noise reduction through distributed processing and improved scalability by connecting multiple quantum devices. However, efficient resource allocation in quantum computing networks is a critical challenge due to factors including qubit variability and network complexity. In this article, we propose an intelligent resource allocation framework for quantum computing networks to improve network scalability with minimized resource costs. To achieve scalability in quantum computing networks, we formulate the resource allocation problem as stochastic programming, accounting for the uncertain fidelities of qubits and entangled pairs. Furthermore, we introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation to resolve the proposed stochastic resource allocation problem efficiently. Finally, we optimize the resource allocation in heterogeneous quantum computing networks supporting quantum generative learning applications and propose a multi-agent RL-based algorithm to learn the optimal resource allocation policies without prior knowledge.
Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacityC, for transmitting classical information; the quantum capacityQ, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacityQ2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacityCE, which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.
Quantum entanglement networks has ushered in a new era of communication, with the core task of generating long-distance quantum entanglement being crucial for a multitude of quantum applications. Although current research is primarily focused on establishing long-distance entanglement across various network topologies, there is still a lack of attention to the variability of communication requests within quantum networks. This paper introduces the Fair and Restricted Resource Allocation Algorithm (FARA), designed to meet the business-driven resource allocation requirements within quantum networks. This algorithm prioritizes the demands and urgency of requests to establish a fairer response mechanism, leading to an enhanced user experience. We refine the strategy for allocating network resources to maximize their use during multiple concurrent requests and to improve the success rate of business. Simulation results demonstrate that our proposed scheme improves the business success rate by 6.35% to 24.58% and user satisfaction by 0.922 to 4.533 points compared to the Q-CAST algorithm. Additionally, resource wastage is reduced by 473 to 800 units. These enhancements indicate that our research provides effective strategies for business-driven optimization in quantum networks and makes a positive contribution to the development of entanglement networks towards more practical and efficient applications.