arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.09266quant-phcs.DS
收藏

LP和SDP的量子内点方法

A Quantum Interior Point Method for LPs and SDPs

Iordanis Kerenidis, Anupam Prakash

摘要:

我们提出了一个量子内点方法,最坏情况下运行时间$\widetilde{O}(\frac{n^{2.5}}{ξ^{2}} μκ^3 \log (1/ε))$的SDP和$\widetilde{O}(\frac{n^{1.5}}{ξ^{2}} μκ^3 \log (1/ε))$的LP,我们的算法的输出是一对矩阵$(S,Y)$是$ε$ -最佳$ξ$ -近似SDP的解决方案。因子$μ$对于SDP至多为$\sqrt{2}n$,对于LP至多为$\sqrt{2n}$,并且$κ$是中间解矩阵的条件数的上限。对于内点法的中间矩阵条件良好的情况下,我们的方法提供了一个多项式加速比最著名的经典SDP求解器和基于内点的LP求解器,其中有一个最坏的情况下的运行时间分别为$O(n^{6})$和$O(n^{3.5})$。我们的研究结果建立在最近开发的量子线性代数技术的基础上,为优化和机器学习中各种应用的量子算法的开发铺平了道路。

英文摘要:

We present a quantum interior point method with worst case running time $\widetilde{O}(\frac{n^{2.5}}{ξ^{2}} μκ^3 \log (1/ε))$ for SDPs and $\widetilde{O}(\frac{n^{1.5}}{ξ^{2}} μκ^3 \log (1/ε))$ for LPs, where the output of our algorithm is a pair of matrices $(S,Y)$ that are $ε$-optimal $ξ$-approximate SDP solutions. The factor $μ$ is at most $\sqrt{2}n$ for SDPs and $\sqrt{2n}$ for LP's, and $κ$ is an upper bound on the condition number of the intermediate solution matrices. For the case where the intermediate matrices for the interior point method are well conditioned, our method provides a polynomial speedup over the best known classical SDP solvers and interior point based LP solvers, which have a worst case running time of $O(n^{6})$ and $O(n^{3.5})$ respectively. Our results build upon recently developed techniques for quantum linear algebra and pave the way for the development of quantum algorithms for a variety of applications in optimization and machine learning.

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

↑