arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.14339quant-phcond-mat.dis-nncond-mat.other
收藏

云/边缘架构中资源分配的变分量子算法

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

Carlo Mastroianni, Francesco Plastina, Jacopo Settino, Andrea Vinci

AI总结:

本文探讨利用变分量子算法(QAOA和VQE)解决云/边缘架构中资源分配的NP-hard问题,实验表明VQE在适当拟设下性能更优,且量子硬件执行时间增长远慢于经典指数趋势。

摘要:

现代云/边缘架构需要协调多个异构计算节点层,包括无处不在的传感器/执行器、分布式边缘/雾节点、集中式数据中心和量子设备。在不同节点上优化分配和调度计算是一个非常困难的问题,具有NP-hard复杂性。在本文中,我们探索了使用变分量子算法解决该问题的可能性,该算法在不久的将来可能成为经典算法的可行替代方案。具体而言,我们比较了两种算法在成功概率方面的性能,即量子近似优化算法(QAOA)和变分量子本征求解器(VQE)。针对一组涉及一个云节点和两个边缘节点的简单问题进行的模拟实验表明,当配备能够限制搜索空间的适当电路拟设(ansatzes)时,VQE算法能确保更好的性能。此外,在真实量子硬件上执行的实验表明,随着问题规模的增加,执行时间的增长速度远慢于经典计算所呈现的已知指数增长趋势。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑