.png){kind=icon}
返回
Convex optimization using quantum oracles
.png){kind=icon}
OA
AI
DOI：10.22331/q-2020-01-13-220.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different oracles. In particular, we show how a separation oracle can be implemented using (O) over tilde (1) quantum queries to a membership oracle, which is an exponential quantum speed-up over the Omega(n) membership queries that are needed classically. We show that a quantum computer can very efficiently compute an approximate subgradient of a convex Lipschitz function. Combining this with a simplification of recent classical work of Lee, Sidford, and Vempala gives our efficient separation oracle. This in turn implies, via a known algorithm, that (O) over tilde (n) quantum queries to a membership oracle suffice to implement an optimization oracle (the best known classical upper bound on the number of membership queries is quadratic). We also prove several lower bounds: Omega(root n) quantum separation (or membership) queries are needed for optimization if the algorithm knows an interior point of the convex set, and Omega(n) quantum separation queries are needed if it does not.
期刊
IF:
5.4
论文数:
974
被引数:
1.0W
机构
引用论文
.png){kind=icon}
分享收藏Nonlinear structural design sensivitity analysis for path dependent problems. Part 1: General theory
PREAI
分享收藏K-edge XANES analysis of sulfur compounds: an investigation of the relative intensities using internal calibrationK-硫化合物的边缘XANES分析: 使用内部校准对相对强度的研究
OAAI
OAAI分享收藏
查看更多内容