使用量子整数进行操作：一个高效的‘倍数’预言机
Operating with Quantum Integers: an Efficient 'Multiples of' Oracle
AI总结：
针对量子算法开发复杂的问题，本文提出一种可组合且高效的‘倍数’量子操作，理论分析与实证研究表明其经典计算复杂度与电路深度随量子比特数线性扩展，为量子软件开发提供了高抽象层级复用组件。
摘要：
量子算法是一个非常具有前景的领域。然而，创建和操纵这类算法是一项非常复杂的任务，特别是对于习惯在更高抽象层级工作的软件工程师而言。本文所介绍的工作是一项更广泛研究的一部分，该研究致力于提供更高抽象层级的操作，以操纵编码为叠加态的整数。这些操作被设计为可组合且高效的，以便量子软件开发人员能够复用它们来构建更复杂的解决方案。具体而言，本文提出了一种‘倍数’操作。为了验证该操作，我们展示了几个量子电路及其仿真的示例，包括其组合可能性。理论分析证明，所需经典计算的复杂度和电路深度均随量子比特数量呈线性扩展。因此，‘倍数’预言机在复杂度和深度方面都是高效的。最后，对电路深度进行了实证研究，以进一步强化理论分析。
英文摘要：
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part of a broader research focused on providing operations of a higher abstraction level to manipulate integers codified as a superposition. These operations are designed to be composable and efficient, so quantum software developers can reuse them to create more complex solutions. Specifically, in this paper we present a 'multiples of' operation. To validate this operation we show several examples of quantum circuits and their simulations, including its composition possibilities. A theoretical analysis proves that both the complexity of the required classical calculations and the depth of the circuit scale linearly with the number of qubits. Hence, the 'multiples of' oracle is efficient in terms of complexity and depth. Finally, an empirical study of the circuit depth is conducted to further reinforce the theoretical analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
