Quantum picturalism for topological cluster-state computing
Quantum picturalism for topological cluster-state computing
复制标题
拓扑簇态计算的量子图画主义
DOI：
10.1088/1367-2630/13/9/095011
复制
发表时间：
2011
影响因子：
3.3
通讯作者：
Clare Horsman
中科院分区：
文献类型：
--
作者：
Clare Horsman
拓扑量子计算（QC）是一种允许精确的量子计算在嘈杂和不完美的硬件上运行的方法。一种实现方式使用通过在高度纠缠的簇状态中形成缺陷而创建的表面代码。这种计算方法是大规模QC的主要候选者。然而，一直缺乏足够强大的高级语言来描述这种形式的计算，而不求助于单量子位操作，随着系统规模的增加，单量子位操作很快变得非常复杂。在本文中，我们适用于范畴理论的工作Abramsky和Coecke的拓扑簇状态模型的QC给一个高层次的图形语言，使量子过程和物理模式之间的直接翻译的测量在计算机中的“编译器语言”。给出了图形信息流与拓扑信息流的等价性，并给出了该计算模型的重写代数。我们表明，这给了我们一个原生的图形语言的拓扑量子算法的设计和分析，并完成讨论自动化这一过程的可能性在大规模上。
Topological quantum computing (QC) is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of computing is a leading candidate for large-scale QC. However, there has been a lack of sufficiently powerful high-level languages to describe computing in this form without resorting to single-qubit operations, which quickly become prohibitively complex as the system size increases. In this paper, we apply the category-theoretic work of Abramsky and Coecke to the topological cluster-state model of QC to give a high-level graphical language that enables direct translation between quantum processes and physical patterns of measurement in a computer—a ‘compiler language’. We give the equivalence between the graphical and topological information flows, and show the applicable rewrite algebra for this computing model. We show that this gives us a native graphical language for the design and analysis of topological quantum algorithms, and finish by discussing the possibilities for automating this process on a large scale.