Optimal resource requirements for connected quantum sub-networks

• URL: http://arxiv.org/abs/2502.14384v1
• Date: Thu, 20 Feb 2025 09:20:55 GMT
• Title: Optimal resource requirements for connected quantum sub-networks
• Authors: Shashank Shekhar, Md Sohel Mondal, Siddhartha Santra,
• Abstract summary: This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks. We derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements. Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.
• Score: 1.619107149276392
• License:
• Abstract: The realization of a global quantum network capable of supporting secure communication and other quantum information processing (QIP) tasks hinges on the ability to distribute high-fidelity entanglement across long distances while optimizing resource usage. This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks using entanglement backbones as interconnections and a swapping based entanglement distribution protocol. Using a statistical model for parametrized quantum sub-networks we derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements for QIP tasks while minimizing resource cost functions. Our analysis extends to the scenario where multiple sub-networks must be interconnected simultaneously based on the formulation of a global resource cost function. The probability of successfully satisfying the parameter thresholds of a QIP task as a function of average parameters of the sub-networks for random network demands reveals a transition from zero to full satisfiability above critical network parameter values. Moreover, we find that the satisfiability transition can be smooth or discontinuous depending on the topology of the sub-networks. Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.

Related papers

• Resilient Entanglement Distribution in a Multihop Quantum Network [0.605746798865181]
  We introduce multihop quantum networks to improve network reach and resilience. We present multihop two-qubit polarization-entanglement distribution within a quantum network at the Oak Ridge National Laboratory campus.
  arXiv  Detail & Related papers  (2024-07-29T22:42:08Z)
• 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)
• On the Bipartite Entanglement Capacity of Quantum Networks [9.377912974064227]
  We consider multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit.
  arXiv  Detail & Related papers  (2023-07-10T10:58:02Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• 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)
• Tactile Network Resource Allocation enabled by Quantum Annealing based on ILP Modeling [0.0]
  We propose a new framework for short-time network optimization based on quantum computing (QC) and integer linear program (ILP) models. We map a nearly real-world ILP model for resource provisioning to a quadratic unconstrained binary optimization problem, which is solvable on quantum annealer (QA)
  arXiv  Detail & Related papers  (2022-12-14T14:12:03Z)
• 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)
• 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.