论文标题
使用经典自动机的叠加用于通用分布的量子电路设计
Quantum circuit design for universal distribution using a superposition of classical automata
论文作者
论文摘要
在这项研究中，我们为平行通用线性界限自动机提供了量子电路设计和实现。该电路能够加速数据中算法结构的推断，以发现因果生成模型。计算模型实际上受到时间和空间资源的限制。在几个示例案例中，显示了自动机上所有可能程序的经典详尽列举。提出了允许执行程序叠加的精确量子电路设计，以及像标准量子图灵机配方中的输入的叠加。这是第一次，在量子计算的电路模型上实现了经典自动机的叠加，具有经典图灵机的相应机械零件。程序的叠加允许我们的模型用于在算法信息理论中实验程序输出行为的空间。我们对OpenQL和Qiskit Quantum编程语言的实现是副本，并且在GitHub上公开可用。
In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata. This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models. The computation model is practically restricted in time and space resources. A classical exhaustive enumeration of all possible programs on the automata is shown for a couple of example cases. The precise quantum circuit design that allows executing a superposition of programs, along with a superposition of inputs as in the standard quantum Turing machine formulation, is presented. This is the first time, a superposition of classical automata is implemented on the circuit model of quantum computation, having the corresponding mechanistic parts of a classical Turing machine. The superposition of programs allows our model to be used for experimenting with the space of program-output behaviors in algorithmic information theory. Our implementations on OpenQL and Qiskit quantum programming language is copy-left and is publicly available on GitHub.
