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

凸优化的量子算法和下界

Quantum algorithms and lower bounds for convex optimization

Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li, Xiaodi Wu

摘要:

虽然最近的工作表明量子计算机可以加速半定程序的求解,但对更一般的凸优化的量子复杂性知之甚少。我们提出了一个量子算法,可以优化凸函数的$n$维凸体使用$\tilde{O}(n)$查询的预言机,评估的目标函数,并确定成员在凸体。这代表了最著名的经典算法的二次改进。我们还研究了量子计算机的功率一般凸优化的限制,表明它需要$\tildeΩ(\sqrt n)$评估查询和$Ω(\sqrt{n})$成员查询。

英文摘要:

While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $\tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it requires $\tildeΩ(\sqrt n)$ evaluation queries and $Ω(\sqrt{n})$ membership queries.

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

↑