精确优化问题的一种短程量子算法
A Short Path Quantum Algorithm for Exact Optimization
摘要:
我们给出了一个量子算法来精确地解决组合优化中的某些问题,包括加权MAX-2-SAT以及目标函数是伊辛变量的乘积的加权和的问题,所有项的次数相同$D$ ;这个问题被称为加权MAX-E $D$ -LIN 2。我们需要的最佳解决方案是唯一的奇数$D$和双退化,甚至$D$,但是,我们希望该算法仍然工作,没有这个条件,我们展示了如何减少到没有这个假设的情况下,在成本的额外开销。虽然所需的时间仍然是指数,该算法证明优于格罗弗的算法假设一个温和的条件下的目标哈密顿量的低能态的数量。运行时的依赖关系的详细分析,这些状态的数量和算法速度之间的权衡:更少的这样的状态允许更大的加速。这导致了一个自然的混合算法,找到一个精确或近似的解决方案。
英文摘要:
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree $D$; this problem is called weighted MAX-E$D$-LIN2. We require that the optimal solution be unique for odd $D$ and doubly degenerate for even $D$; however, we expect that the algorithm still works without this condition and we show how to reduce to the case without this assumption at the cost of an additional overhead. While the time required is still exponential, the algorithm provably outperforms Grover's algorithm assuming a mild condition on the number of low energy states of the target Hamiltonian. The detailed analysis of the runtime dependence on a tradeoff between the number of such states and algorithm speed: fewer such states allows a greater speedup. This leads to a natural hybrid algorithm that finds either an exact or approximate solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。