arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.05099quant-ph
收藏

因果结构与高阶量子计算的分类

Causal structures and the classification of higher order quantum computations

Paolo Perinotti

摘要:

量子运算是量子信息处理理论中最广泛使用的工具,表示组成复杂量子线路的量子态的基本变换。量子变换的类别可以通过包括量子运算的变换及其变换等来扩展,直到构造潜在的无限层次的变换。在过去的十年中,一个被称为量子梳的子层次被详尽地研究,并被表征为最一般的一类变换,其可以通过具有容纳可变输入元件的开口槽的量子线路来实现,以形成完整的输出量子线路。量子梳的理论被证明是成功的信息处理任务的优化,否则无法治疗。近年来,从梳到梳的映射的研究有所增加,这要归功于一些有趣的例子,这些例子显示了下一阶映射如何要求操作的因果顺序与控制量子系统的状态纠缠,或者更根本的是,交替因果顺序的叠加。这些非电路变换中的一些已知是可以实现的,甚至已经在实验中实现,并且被证明在各种信息处理任务中相对于量子梳提供了一些计算优势。在这里,我们提供了一种形式语言来形成所有可能的类型的转换,并使用它来证明一般的结构定理的层次结构中的转换。然后,我们提供了一个数学表征的一组从梳子到梳子的地图,暗示在路线的完整表征的地图的层次结构。分类是严格相关的映射操纵输入电路的因果结构的方式。

英文摘要:

Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum transformations can be extended by including transformations on quantum operations, and transformations thereof, and so on up to the construction of a potentially infinite hierarchy of transformations. In the last decade, a sub-hierarchy, known as quantum combs, was exhaustively studied, and characterised as the most general class of transformations that can be achieved by quantum circuits with open slots hosting variable input elements, to form a complete output quantum circuit. The theory of quantum combs proved to be successful for the optimisation of information processing tasks otherwise untreatable. In more recent years the study of maps from combs to combs has increased, thanks to interesting examples showing how this next order of maps requires entanglement of the causal order of operations with the state of a control quantum system, or, even more radically, superpositions of alternate causal orderings. Some of these non-circuital transformations are known to be achievable and have even been achieved experimentally, and were proved to provide some computational advantage in various information-processing tasks with respect to quantum combs. Here we provide a formal language to form all possible types of transformations, and use it to prove general structure theorems for transformations in the hierarchy. We then provide a mathematical characterisation of the set of maps from combs to combs, hinting at a route for the complete characterisation of maps in the hierarchy. The classification is strictly related to the way in which the maps manipulate the causal structure of input circuits.

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

↑