arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.06456quant-phcs.CCcs.DSstat.CO
收藏

量子Chebyshev不等式及其应用

Quantum Chebyshev's Inequality and Applications

Yassine Hamoudi, Frédéric Magniez

摘要:

在本文中,我们提供了新的量子算法与多项式加速的一系列问题,没有这样的结果是已知的,或者我们改进以前的算法。首先,我们考虑的频率矩$F_k$的顺序$k \geq 3$在多通道流模型更新(旋转栅门模型)的近似。我们设计了一个$P$ -pass量子流算法,其中存储器$M$满足$P^2 M = \tilde{O}(n^{1-2/k})$的折衷,而最好的经典算法需要$P M = Θ(n^{1-2/k})$ .然后,我们研究了对$n$ -顶点图进行查询访问时,边数$m$和三角形数$t$的估计问题。我们分别描述了执行$\tilde{O}(\sqrt{n}/m^{1/4})$和$\tilde{O}(\sqrt{n}/t^{1/6} + m^{3/4}/\sqrt{t})$查询的最优量子算法。与这些问题的经典复杂性相比,这是二次加速。为此,我们开发了一个新的量子范式,我们称之为量子切比雪夫不等式。也就是说,我们证明,在一定的量子采样模型中,可以近似与相对误差的平均值的任何随机变量与数量的量子样本是线性的方差的平方根的平均值的比率。经典的依赖性是二次的。我们的算法包含了Montanaro [Mon 15]的一个结果。这种新的范例是基于改进的幅度估计算法的Escherard等人。[BHMT 02]和以前的量子算法的平均估计问题。我们表明,这种加速是最佳的,我们确定了另一种常见的量子采样模型,它不能获得。对于我们的应用,我们还将Ambainis [Amb 10]的可变时间幅度放大技术应用于可变时间幅度估计算法。

英文摘要:

In this paper we provide new quantum algorithms with polynomial speed-up for a range of problems for which no such results were known, or we improve previous algorithms. First, we consider the approximation of the frequency moments $F_k$ of order $k \geq 3$ in the multi-pass streaming model with updates (turnstile model). We design a $P$-pass quantum streaming algorithm with memory $M$ satisfying a tradeoff of $P^2 M = \tilde{O}(n^{1-2/k})$, whereas the best classical algorithm requires $P M = Θ(n^{1-2/k})$. Then, we study the problem of estimating the number $m$ of edges and the number $t$ of triangles given query access to an $n$-vertex graph. We describe optimal quantum algorithms that perform $\tilde{O}(\sqrt{n}/m^{1/4})$ and $\tilde{O}(\sqrt{n}/t^{1/6} + m^{3/4}/\sqrt{t})$ queries respectively. This is a quadratic speed-up compared to the classical complexity of these problems. For this purpose we develop a new quantum paradigm that we call Quantum Chebyshev's inequality. Namely we demonstrate that, in a certain model of quantum sampling, one can approximate with relative error the mean of any random variable with a number of quantum samples that is linear in the ratio of the square root of the variance to the mean. Classically the dependency is quadratic. Our algorithm subsumes a previous result of Montanaro [Mon15]. This new paradigm is based on a refinement of the Amplitude Estimation algorithm of Brassard et al. [BHMT02] and of previous quantum algorithms for the mean estimation problem. We show that this speed-up is optimal, and we identify another common model of quantum sampling where it cannot be obtained. For our applications, we also adapt the variable-time amplitude amplification technique of Ambainis [Amb10] into a variable-time amplitude estimation algorithm.

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

↑