量子加速比与范畴分布
Quantum Speedup and Categorical Distributivity
摘要:
本文研究了最著名的量子算法之一- Shor的因式分解算法-通过分类分配。本文的一个主要目的是为算法的关键部分提供一组最小的分类要求,以建立最通用的设置,在该设置中可以有效地执行所需的操作。我们表明,Laplaza的理论的连贯性分配提供了一个纯粹的分类证明的操作等价的两个量子线路,与显着的属性,一个是指数比其他更有效。这种对等也存在于广泛的类别中。当应用到有限维希尔伯特空间的范畴时,我们恢复了通常有效的实现,量子神谕的核心都肖尔算法和量子周期发现一般;然而,它也适用于更广泛的设置。
英文摘要:
This paper studies one of the best known quantum algorithms - Shor's factorisation algorithm - via categorical distributivity. A key aim of the paper is to provide a minimal set of categorical requirements for key parts of the algorithm, in order to establish the most general setting in which the required operations may be performed efficiently. We demonstrate that Laplaza's theory of coherence for distributivity provides a purely categorical proof of the operational equivalence of two quantum circuits, with the notable property that one is exponentially more efficient than the other. This equivalence also exists in a wide range of categories. When applied to the category of finite dimensional Hilbert spaces, we recover the usual efficient implementation of the quantum oracles at the heart of both Shor's algorithm and quantum period-finding generally; however, it is also applicable in a much wider range of settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。