Adaptive Optimization of Latency and Throughput with Fidelity Constraints in Quantum Networks Using Deep Neural Networks

• URL: http://arxiv.org/abs/2505.12459v1
• Date: Sun, 18 May 2025 15:23:18 GMT
• Title: Adaptive Optimization of Latency and Throughput with Fidelity Constraints in Quantum Networks Using Deep Neural Networks
• Authors: Gongyu Ni, Lester Ho, Holger Claussen,
• Abstract summary: We propose a semi-supervised adaptive purification approach employing Deep Neural Networks (DNNs) to optimize the balance between latency, throughput, entanglement resource utilization and fidelity thresholds.<n>Our results underline the potential of deep learning techniques for achieving adaptive, optimized performance in future quantum networking applications.
• Score: 3.1856756516735936
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum networks rely heavily on the establishment of high-fidelity entanglement links, yet achieving target fidelity typically introduces trade-offs between latency and throughput. In this paper, we propose a semi-supervised adaptive purification approach employing Deep Neural Networks (DNNs) to optimize the balance between latency, throughput, entanglement resource utilization and fidelity thresholds in quantum repeater networks. By intelligently predicting the necessary rounds of purification per link, our method dynamically adapts to varying fidelity requirements across different quantum communication use-cases. Through simulations integrating quantum purification, entanglement establishment, and network-level request scheduling, we compare our approach to fixed-round purification and FIFO schemes. We show that the proposed scheme achieves greater flexibility in adjusting final entanglement fidelity levels while minimizing latency and enhances the efficient utilization of entangled Bell pairs. Our results underline the potential of deep learning techniques for achieving adaptive, optimized performance in future quantum networking applications.

Related papers

• Adaptive Entanglement Routing with Deep Q-Networks in Quantum Networks [0.19731444261635428]
  The quantum internet holds transformative potential for global communication.<n>The efficient distribution of critical resources, such as qubits, remains a persistent and unresolved challenge.<n>This study proposes a novel reinforcement learning-based adaptive entanglement routing framework.
  arXiv  Detail & Related papers  (2025-03-01T20:05:54Z)
• Optimal resource requirements for connected quantum sub-networks [1.619107149276392]
  This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks.<n>We derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements.<n>Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.
  arXiv  Detail & Related papers  (2025-02-20T09:20:55Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• 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)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• 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)
• 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)
• Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks [2.5946789143276447]
  Variational quantum eigensolvers have recently received increased attention, as they enable the use of quantum computing devices. We present a hybrid policy gradient algorithm capable of simultaneously optimizing continuous and discrete degrees of freedom in an uncertainty-resilient way. Our work exhibits the beneficial synergy between reinforcement learning and quantum control.
  arXiv  Detail & Related papers  (2020-12-12T02:13:28Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)

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.