arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.07367cs.CC
收藏

广义Simon问题的查询复杂性

Query complexity of generalized Simon's problem

Zekun Ye, Yunqi Huang, Lvzhou Li, Yuyi Wang

摘要:

西蒙问题在量子算法的历史上扮演着重要的角色,因为它启发了Shor发现了在多项式时间内解决整数因式分解的著名量子算法。此外,西蒙问题的量子算法最近已被用于破解对称密码系统。广义Simon问题记作$\mathsf{GSP}(p,n,k)$,是Simon问题的自然推广.本文研究了$\mathsf{GSP}(p,n,k)$的查询复杂度。首先,设计一个量子算法来解决上述问题并不困难,其查询复杂度为$O(n-k)$。然而,到目前为止,还不清楚什么是经典的查询复杂性的问题,揭示这种复杂性是必要的澄清量子和经典计算之间的计算能力差距的问题。为了解决这个问题,我们证明了任何经典的(确定性或随机)算法的$\mathsf{GSP}(p,n,k)$查询至少$Ω\left(\max\{k, \sqrt{p^{n-k}}\}\right)$值和任何经典的非自适应确定性算法的$\mathsf{GSP}(p,n,k)$查询至少$Ω\left(\max\{k, \sqrt{k \cdot p^{n-k}}\}\right)$值。因此,我们清楚地表明,在广义西蒙问题的查询复杂性方面,经典计算模型不如量子计算模型强大。此外,我们得到了一个上界$O\left(\max\{k, \sqrt{k \cdot p^{n-k}}\}\right)$的经典确定性查询复杂度的$\mathsf{GSP}(p,n,k)$,通过设计一个微妙的经典算法的基础上群论和分而治之的方法。因此,我们有一个几乎完整的表征经典的确定性查询复杂性的广义西蒙的问题。

英文摘要:

Simon's problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in polynomial time. Besides, the quantum algorithm for Simon's problem has been recently applied to break symmetric cryptosystems. Generalized Simon's problem, denoted by $\mathsf{GSP}(p,n,k)$, is a natural extension of Simon's problem. In this paper we consider the query complexity of $\mathsf{GSP}(p,n,k)$. First, it is not difficult to design a quantum algorithm solving the above problem with query complexity of $O(n-k)$. However, so far it is not clear what is the classical query complexity of the problem, and revealing this complexity is necessary for clarifying the computational power gap between quantum and classical computing on the problem. To tackle this problem, we prove that any classical (deterministic or randomized) algorithm for $\mathsf{GSP}(p,n,k)$ has to query at least $Ω\left(\max\{k, \sqrt{p^{n-k}}\}\right)$ values and any classical nonadaptive deterministic algorithm for $\mathsf{GSP}(p,n,k)$ has to query at least $Ω\left(\max\{k, \sqrt{k \cdot p^{n-k}}\}\right)$ values. Hence, we clearly show the classical computing model is less powerful than the quantum counterpart, in terms of query complexity for the generalized Simon's problem. Moreover, we obtain an upper bound $O\left(\max\{k, \sqrt{k \cdot p^{n-k}}\}\right)$ on the classical deterministic query complexity of $\mathsf{GSP}(p,n,k)$, by devising a subtle classical algorithm based on group theory and the divide-and-conquer approach. Therefore, we have an almost full characterization of the classical deterministic query complexity of the generalized Simon's problem.

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

↑