arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.05381quant-ph
收藏

异构量子计算在卫星星座优化中的应用:加权K团问题的求解

Heterogeneous Quantum Computing for Satellite Constellation Optimization: Solving the Weighted K-Clique Problem

Gideon Bass, Casey Tomlin, Vaibhaw Kumar, Pete Rihaczek, Joseph Dulny

摘要:

NP-难优化问题随着问题规模的扩大而迅速扩大,即使使用超级计算资源,也无法用蛮力方法解决。通常情况下,这些问题已经近似与数学。然而,这些方法仍然需要很长时间,并且不能保证找到最佳解决方案。量子计算提供了产生显著加速和提高解决方案质量的可能性。目前的量子退火(QA)设备旨在解决困难的优化问题,但它们受到硬件大小和量子位连接限制的限制。我们提出了一种新的异构计算堆栈,结合QA和经典的机器学习,允许使用QA的问题大于量子设备的硬件限制。这些结果代表了对加权k团问题所代表的现实问题的实验。通过这个实验,我们可以深入了解量子机器学习的状态。

英文摘要:

NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods still take a long time and are not guaranteed to find an optimal solution. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. Current quantum annealing (QA) devices are designed to solve difficult optimization problems, but they are limited by hardware size and qubit connectivity restrictions. We present a novel heterogeneous computing stack that combines QA and classical machine learning, allowing the use of QA on problems larger than the hardware limits of the quantum device. These results represent experiments on a real-world problem represented by the weighted k-clique problem. Through this experiment, we provide insight into the state of quantum machine learning.

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

↑