Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture

Abstract

Modern Cloud/Edge architectures need to orchestrate multiple layers of heterogeneous computing nodes, including pervasive sensors/actuators, distributed Edge/Fog nodes, centralized data centers and quantum devices. The optimal assignment and scheduling of computation on the different nodes is a very difficult problem, with NP-hard complexity. In this paper, we explore the possibility of solving this problem with Variational Quantum Algorithms, which can become a viable alternative to classical algorithms in the near future. In particular, we compare the performances, in terms of success probability, of two algorithms, i.e., Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). The simulation experiments, performed for a set of simple problems, %CM230124 that involve a Cloud and two Edge nodes, show that the VQE algorithm ensures better performances when it is equipped with appropriate circuit \textit{ansatzes} that are able to restrict the search space. Moreover, experiments executed on real quantum hardware show that the execution time, when increasing the size of the problem, grows much more slowly than the trend obtained with classical computation, which is known to be exponential.

14 pages, 13 figures

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum-enhanced machine learning
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Linear-depth quantum circuits for multiqubit controlled gates
• A Divide-and-Conquer Approach to Dicke State Preparation
• Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
• Assessing Quantum Computing Performance for Energy Optimization in a Prosumer Community
• Bounds on approximating Max $k$XOR with quantum and classical local algorithms

Cited by in corpus (2)

• Harnessing Quantum Extreme Learning Machines for image classification
• Assessing Projected Quantum Kernels for the Classification of IoT Data