arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.08805quant-ph
收藏

量子优化启发式算法及其在背包问题中的应用

Quantum Optimization Heuristics with an Application to Knapsack Problems

Wim van Dam, Karim Eldefrawy, Nicholas Genise, Natalie Parham

摘要:

本文介绍了两种技术,使标准的量子近似优化算法(QAOA)更适合于约束优化问题。第一种技术描述了如何使用先前贪婪经典算法的结果来定义初始量子态和混合操作以调整量子优化算法来探索围绕该初始贪婪解的可能答案。第二种技术用于推动量子探索,以避免贪婪解周围的局部极小值。为了分析这两种技术的好处,我们使用单位深度的量子线路在背包问题的已知困难实例上运行量子算法。结果表明,调整后的量子优化算法通常比各种经典算法表现得更好。

英文摘要:

This paper introduces two techniques that make the standard Quantum Approximate Optimization Algorithm (QAOA) more suitable for constrained optimization problems. The first technique describes how to use the outcome of a prior greedy classical algorithm to define an initial quantum state and mixing operation to adjust the quantum optimization algorithm to explore the possible answers around this initial greedy solution. The second technique is used to nudge the quantum exploration to avoid the local minima around the greedy solutions. To analyze the benefits of these two techniques we run the quantum algorithm on known hard instances of the Knapsack Problem using unit depth quantum circuits. The results show that the adjusted quantum optimization heuristics typically perform better than various classical heuristics.

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

↑