带咨询的置换求逆的量子下界
Quantum lower bound for inverting a permutation with advice
摘要:
给定一个随机排列$f: [N] \to [N]$作为一个黑盒和$y \in [N]$,我们希望输出$x = f^{-1}(y)$。作为对输入的补充,我们以预先计算的数据结构的形式给出了经典建议;该建议可以依赖于置换,但\emph{not}依赖于输入$y$。传统上,存在大小为$\tilde{O}(S)$的数据结构和算法,该算法在给定$f(x)$的数据结构的帮助下,对于参数$S$、$T$的每个选择,可以将$f$在时间$\tilde{O}(T)$上反转,使得$S\cdot T \ge N$。我们证明了量子算法的$T^2\cdot S \ge \tildeΩ(εN)$的量子下界,反转一个随机排列$f$的$ε$分数的输入,其中$T$是查询$f$和$S$的数量的建议。这回答了一个开放的问题德等人。我们还给出了一个$Ω(\sqrt{N/m})$量子下限为简单的,但相关的姚氏箱问题,这是问题的恢复位$x_j$,鉴于有能力查询一个$N$位字符串$x$在任何索引,除了$j$ -th,也给出了$m$位的意见,依赖于$x$,但不是$j$。
英文摘要:
Given a random permutation $f: [N] \to [N]$ as a black box and $y \in [N]$, we want to output $x = f^{-1}(y)$. Supplementary to our input, we are given classical advice in the form of a pre-computed data structure; this advice can depend on the permutation but \emph{not} on the input $y$. Classically, there is a data structure of size $\tilde{O}(S)$ and an algorithm that with the help of the data structure, given $f(x)$, can invert $f$ in time $\tilde{O}(T)$, for every choice of parameters $S$, $T$, such that $S\cdot T \ge N$. We prove a quantum lower bound of $T^2\cdot S \ge \tildeΩ(εN)$ for quantum algorithms that invert a random permutation $f$ on an $ε$ fraction of inputs, where $T$ is the number of queries to $f$ and $S$ is the amount of advice. This answers an open question of De et al. We also give a $Ω(\sqrt{N/m})$ quantum lower bound for the simpler but related Yao's box problem, which is the problem of recovering a bit $x_j$, given the ability to query an $N$-bit string $x$ at any index except the $j$-th, and also given $m$ bits of advice that depend on $x$ but not on $j$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。