A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

• URL: http://arxiv.org/abs/2307.06009v2
• Date: Thu, 14 Dec 2023 03:27:09 GMT
• Title: A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
• Authors: Paolo Fittipaldi, Anastasios Giovanidis, Fr\'ed\'eric Grosshans
• Abstract summary: This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. An additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the cost at the price of a slight performance degradation.
• Score: 2.5168553347063862
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network - often called first generation quantum network - in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. The framework is then employed to apply Lyapunov Drift Minimization (a standard technique in classical network science) to mathematically derive a natural class of scheduling policies for quantum networks minimizing the square norm of the user demand backlog. Moreover, an additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the computation cost at the price of a slight performance degradation. The policies are compared in terms of information availability, localization and overall network performance through an ad-hoc simulator that admits user-provided network topologies and scheduling policies in order to showcase the potential application of the provided tools to quantum network design.

Related papers

• Leveraging Internet Principles to Build a Quantum Network [8.597828500002242]
  We propose a best-effort quantum network architecture based on packet-switching, akin to that of the classical Internet. As an illustration, we tailor and adapt classical congestion control and active queue management protocols to quantum networks. Results show that these classical networking tools can be effectively used to combat quantum memory decoherence and keep end-to-end fidelity around a target value.
  arXiv  Detail & Related papers  (2024-10-11T16:55:10Z)
• Survey on Computational Applications of Tensor Network Simulations [0.0]
  Review aims to clarify which classes of relevant applications have been proposed for which class of tensor networks. We intend this review to be a high-level tour on tensor network applications which is easy to read by non-experts.
  arXiv  Detail & Related papers  (2024-08-09T11:46:47Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• Mutual Information Maximizing Quantum Generative Adversarial Network and Its Applications in Finance [1.9448402576196024]
  Quantum machine learning offers significant quantum advantages over classical machine learning across various domains. generative adversarial networks have been recognized for their potential utility in diverse fields. We introduce a novel approach named InfoQGAN, which employs the Mutual Information Neural Estor (MINE) within the framework of quantum generative adversarial networks.
  arXiv  Detail & Related papers  (2023-09-04T05:18:37Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• An Architecture for Meeting Quality-of-Service Requirements in Multi-User Quantum Networks [0.0]
  We propose the first end-to-end design of a quantum network with multiple users that orchestrates the delivery of entanglement. We use periodic task scheduling and resource-constrained project scheduling techniques, including a novel, to construct the schedules.
  arXiv  Detail & Related papers  (2021-11-25T15:27:32Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.