Tactile Network Resource Allocation enabled by Quantum Annealing based on ILP Modeling

• URL: http://arxiv.org/abs/2212.07854v2
• Date: Tue, 2 May 2023 10:24:54 GMT
• Title: Tactile Network Resource Allocation enabled by Quantum Annealing based on ILP Modeling
• Authors: Arthur Witt, Christopher K\"orber, Andreas Kirst\"adter, Thomas Luu
• Abstract summary: 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)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Agile networks with fast adaptation and reconfiguration capabilities are required for on-demand provisioning of various network services. We propose a new methodical framework for short-time network optimization based on quantum computing (QC) and integer linear program (ILP) models, which has the potential of realizing a real-time network automation. We define methods to map a nearly real-world ILP model for resource provisioning to a quadratic unconstrained binary optimization (QUBO) problem, which is solvable on quantum annealer (QA). We concentrate on the three-node network to evaluate our approach and its obtainable quality of solution using the state-of-the-art quantum annealer D-Wave Advantage 5.2/5.3. By studying the annealing process, we find annealing configuration parameters that obtain feasible solutions close to the reference solution generated by the classical ILP-solver CPLEX. Further, we studied the scaling of the network problem and provide estimations on quantum annealer's hardware requirements to enable a proper QUBO problem embedding of larger networks. We achieved the QUBO embedding of networks with up to 6 nodes on the D-Wave Advantage. According to our estimates a real-sized network with 12 to 16 nodes require a QA hardware with at least 50000 qubits or more.

Related papers

• Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks [4.0985912998349345]
  Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors. This paper addresses the problem of resource allocation in such networks, focusing on computing resource management in a quantum farm setting. We propose a multi-objective optimisation algorithm for optimal QPU allocation that aims to minimise the degradation caused by inter-QPU communication latencies.
  arXiv  Detail & Related papers  (2024-09-19T11:39:46Z)
• ILP-based Resource Optimization Realized by Quantum Annealing for Optical Wide-area Communication Networks -- A Framework for Solving Combinatorial Problems of a Real-world Application by Quantum Annealing [5.924780594614675]
  In recent works we demonstrated how such a problem could be cast as a quadratic unconstrained binary optimization (QUBO) problem that can be embedded onto the D-Wave AdvantageTM quantum annealer system. Here we report on our investigations for optimizing system parameters, and how we incorporate machine learning (ML) techniques to further improve on the quality of solutions. We successfully implement this NN in a simple integer linear programming (ILP) example, demonstrating how the NN can fully map out the solution space that was not captured by D-Wave.
  arXiv  Detail & Related papers  (2024-01-01T17:52:58Z)
• 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)
• 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)
• A Quantum Overlay Network for Efficient Entanglement Distribution [15.034732044326752]
  We introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs. We show that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals.
  arXiv  Detail & Related papers  (2022-12-03T21:20:30Z)
• 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)
• Deep Learning for Radio Resource Allocation with Diverse Quality-of-Service Requirements in 5G [53.23237216769839]
  We develop a deep learning framework to approximate the optimal resource allocation policy for base stations. We find that a fully-connected neural network (NN) cannot fully guarantee the requirements due to the approximation errors and quantization errors of the numbers of subcarriers. Considering that the distribution of wireless channels and the types of services in the wireless networks are non-stationary, we apply deep transfer learning to update NNs in non-stationary wireless networks.
  arXiv  Detail & Related papers  (2020-03-29T04:48:22Z)
• 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.