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

基于量子随机存取门的存储器压缩

Memory Compression with Quantum Random-Access Gates

Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman

摘要:

在经典RAM中,我们有以下有用的属性。如果我们有一个算法,它在整个执行过程中使用$M$存储单元,而且是稀疏的,在这个意义上,在任何时间点,只有$M$单元中的$m$将是非零的,那么我们可以将它“压缩”到另一个算法中,这个算法只使用$m \log M$存储器,并且几乎同时运行。我们可以通过使用哈希表或自平衡树来模拟内存。我们展示了一个类似的结果,量子算法配备了量子随机存取门。如果我们有一个量子算法,它在时间$T$中运行,并使用$M$量子位,使得在任何时间步,存储器的状态都支持最多$m$的汉明权重的计算基向量,那么它可以用另一个算法来模拟,该算法只使用$O(m \log M)$存储器,并在时间$\tilde O(T)$中运行。我们展示了如何使用这个定理,在一个黑盒的方式,简化了几篇论文中的介绍。广义地说,当需要一个空间效率高、与历史无关的量子数据结构时,通常可以构造一个空间效率低、但稀疏的量子数据结构,然后诉诸我们的主要定理。这导致更简单和更短的论点。

英文摘要:

In the classical RAM, we have the following useful property. If we have an algorithm that uses $M$ memory cells throughout its execution, and in addition is sparse, in the sense that, at any point in time, only $m$ out of $M$ cells will be non-zero, then we may "compress" it into another algorithm which uses only $m \log M$ memory and runs in almost the same time. We may do so by simulating the memory using either a hash table, or a self-balancing tree. We show an analogous result for quantum algorithms equipped with quantum random-access gates. If we have a quantum algorithm that runs in time $T$ and uses $M$ qubits, such that the state of the memory, at any time step, is supported on computational-basis vectors of Hamming weight at most $m$, then it can be simulated by another algorithm which uses only $O(m \log M)$ memory, and runs in time $\tilde O(T)$. We show how this theorem can be used, in a black-box way, to simplify the presentation in several papers. Broadly speaking, when there exists a need for a space-efficient history-independent quantum data-structure, it is often possible to construct a space-inefficient, yet sparse, quantum data structure, and then appeal to our main theorem. This results in simpler and shorter arguments.

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

↑