关于需要(量子)记忆与短输出的必要性
On the Need for (Quantum) Memory with Short Outputs
AI总结:
本文首次在经典和量子设置中建立了有限与无限空间计算之间的分离,针对输出较短的问题,引入了嵌套碰撞寻找问题,证明在没有指数级内存的情况下无法达到最优查询复杂度。
摘要:
在本文中,我们建立了在有限和无限空间计算之间首次分离,适用于输出较短的问题(即工作内存可以比输出大小大指数级),在经典和量子设置中均成立。为此,我们引入了一个称为嵌套碰撞寻找的问题,并展示在没有指数级内存的情况下无法达到最优查询复杂度。我们的结果基于一种新的『双 oracle 记录』技术,其中一个 oracle 在另一个 oracle 下记录计算的长输出,从而将短输出问题的时间-空间权衡降低到长输出问题的水平。我们相信这种技术将在其他短输出设置中建立时间-空间权衡方面具有独立价值。
英文摘要:
In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum setting. Towards that, we introduce a problem called nested collision finding, and show that optimal query complexity can not be achieved without exponential memory. Our result is based on a novel ``two-oracle recording'' technique, where one oracle ``records'' the computation's long outputs under the other oracle, effectively reducing the time-space trade-off for short-output problems to that of long-output problems. We believe this technique will be of independent interest for establishing time-space tradeoffs in other short-output settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。