随机约束二元优化问题的量子方法
A Quantum Approach for Stochastic Constrained Binary Optimization
摘要:
分析和实践证据表明,量子计算解决方案优于经典的替代方案。基于量子的几何学依赖于变分量子本征求解器(VQE)和量子近似优化算法(QAOA)已经被数值地示出以生成高质量的解决方案来解决困难的组合问题,然而将约束结合到这样的问题一直是难以捉摸的。为此,本工作提出了一个量子启发式处理随机二次二次约束二次规划(QCQP)。识别量子线路的强度以有效地从否则难以从中采样的概率分布生成样本,训练变分量子线路以生成二进制值向量来近似求解前述随机程序。该方法建立在对偶分解,需要解决一系列明智的修改标准VQE任务。使用量子模拟器对几个合成问题实例进行的测试证实了该方法的近最优性和可行性,以及其为确定性QCQP生成可行解的潜力。
英文摘要:
Analytical and practical evidence indicates the advantage of quantum computing solutions over classical alternatives. Quantum-based heuristics relying on the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) have been shown numerically to generate high-quality solutions to hard combinatorial problems, yet incorporating constraints to such problems has been elusive. To this end, this work puts forth a quantum heuristic to cope with stochastic binary quadratically constrained quadratic programs (QCQP). Identifying the strength of quantum circuits to efficiently generate samples from probability distributions that are otherwise hard to sample from, the variational quantum circuit is trained to generate binary-valued vectors to approximately solve the aforesaid stochastic program. The method builds upon dual decomposition and entails solving a sequence of judiciously modified standard VQE tasks. Tests on several synthetic problem instances using a quantum simulator corroborate the near-optimality and feasibility of the method, and its potential to generate feasible solutions for the deterministic QCQP too.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。