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

线性规划的量子内点预估校正算法

A Quantum Interior-Point Predictor-Corrector Algorithm for Linear Programming

P. A. M. Casares, M. A. Martin-Delgado

摘要:

本文提出了一种求解稠密线性规划问题的量子优化算法,它可以看作是利用量子线性系统算法\cite{DenseHHL}对内点预测-校正算法\cite{Predictor-Corrector}进行量子化.的(最坏情况)我们的方法的工作复杂度是,直到多对数因子,$O(L\sqrt{n}(n+m)\overline{||M||_F}\barκ^2ε^{-2})$对于$n$是成本函数中的变量的数量,$m$是约束的数量,$ε^{-1}$是目标精度,$L$是输入数据的位长度,$\overline{||M||_F}$是出现的线性方程组的Frobenius范数的上限,$||M||_F$,以及$\barκ$是这些方程组的条件数$κ$的上界。这表示当问题$A$的初始矩阵稠密时,相对于可比较的经典内点算法,代价函数中变量的数量$n$的量子加速:如果我们用经典算法(如共轭梯度下降)替换算法的量子部分,这将意味着整个算法的复杂度为$O(L\sqrt{n}(n+m)^2\barκ \log(ε^{-1}))$,或者用精确方法,至少为$O(L\sqrt{n}(n+m)^{2.373})$。此外,与任何量子线性系统算法相比,本文中描述的算法输出解向量的经典描述和最优解的值。

英文摘要:

We introduce a new quantum optimization algorithm for dense Linear Programming problems, which can be seen as the quantization of the Interior Point Predictor-Corrector algorithm \cite{Predictor-Corrector} using a Quantum Linear System Algorithm \cite{DenseHHL}. The (worst case) work complexity of our method is, up to polylogarithmic factors, $O(L\sqrt{n}(n+m)\overline{||M||_F}\barκ^2ε^{-2})$ for $n$ the number of variables in the cost function, $m$ the number of constraints, $ε^{-1}$ the target precision, $L$ the bit length of the input data, $\overline{||M||_F}$ an upper bound to the Frobenius norm of the linear systems of equations that appear, $||M||_F$, and $\barκ$ an upper bound to the condition number $κ$ of those systems of equations. This represents a quantum speed-up in the number $n$ of variables in the cost function with respect to the comparable classical Interior Point algorithms when the initial matrix of the problem $A$ is dense: if we substitute the quantum part of the algorithm by classical algorithms such as Conjugate Gradient Descent, that would mean the whole algorithm has complexity $O(L\sqrt{n}(n+m)^2\barκ \log(ε^{-1}))$, or with exact methods, at least $O(L\sqrt{n}(n+m)^{2.373})$. Also, in contrast with any Quantum Linear System Algorithm, the algorithm described in this article outputs a classical description of the solution vector, and the value of the optimal solution.

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

↑