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

经典意义下西蒙问题的复杂性

Complexity of Simon's problem in classical sense

Hans Zantema

摘要:

西蒙问题是经典意义上的指数问题的一个标准例子,而它在量子计算中允许多项式解。它是关于一个函数$f$,它被赋予一个唯一的非零向量$s$存在,其中$f(x) = f(x \oplus s)$对所有$x$,其中$\oplus$是异或运算符。目标是找到$s$。经典意义上的指数下界假设$f$只允许黑盒访问。在本文中,我们研究了当$f$由电路等标准表示给出时的经典复杂性。我们专注于寻找所有向量$s$的向量空间,其中对于任何给定的$f$,对于所有$x$,$f(x) = f(x \oplus s)$。两个主要结果是:(1)如果$f$由任何电路给出,则检查该向量空间是否包含非零元素是NP难的,以及(2)如果$f$由任何有序BDD给出,则可以在多项式时间内计算该向量空间的基。

英文摘要:

Simon's problem is a standard example of a problem that is exponential in classical sense, while it admits a polynomial solution in quantum computing. It is about a function $f$ for which it is given that a unique non-zero vector $s$ exists for which $f(x) = f(x \oplus s)$ for all $x$, where $\oplus$ is the exclusive or operator. The goal is to find $s$. The exponential lower bound for the classical sense assumes that $f$ only admits black box access. In this paper we investigate classical complexity when $f$ is given by a standard representation like a circuit. We focus on finding the vector space of all vectors $s$ for which $f(x) = f(x \oplus s)$ for all $x$, for any given $f$. Two main results are: (1) if $f$ is given by any circuit, then checking whether this vector space contains a non-zero element is NP-hard, and (2) if $f$ is given by any ordered BDD, then a basis of this vector space can be computed in polynomial time.

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

↑