arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新，休息一下吧，周末愉快~~
arXiv 1111.1774quant-ph
收藏

簇态的逐层生成

Layer by layer generation of cluster states

Katherine L. Brown, Dominic Horsman, Viv Kendon, William J. Munro

备注：
16 pages, 11 figures
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

AI总结：

本文研究在 qubus 架构上确定性逐层生成 n×m 簇态，给出是否允许破坏受控相位连接时的多种操作数方案，并指出两种模块化方案最实用。

摘要：

簇态可用于执行基于测量的量子计算。簇态是一种有用的资源，因为一旦生成，就只需局域操作和测量来执行通用量子计算。本文探讨快速且确定性地构建簇态的技术。具体而言，我们考虑在 qubus 量子计算机上生成簇态，这是一种使用连续变量辅助量子位在量子位之间产生相互作用的计算架构。我们探索了若干构建簇的技术，其所需操作数取决于是否允许破坏先前在量子位之间创建的受控相位连接。在不能破坏这些连接的情况下，我们展示了如何仅用 3nm−2n−3m/2+3 次操作创建一个 n×m 簇。相比朴素方法，这节省了超过 2 倍。若加入破坏连接的能力，还可进一步节省，此时只需 (8nm−4n−4m−8)/3 次操作。遗憾的是，后一种方案更复杂，因此选择正确的量子位相互作用顺序要困难得多。一种折中方案保留模块化生成，同时比从不破坏连接的方案额外节省操作，只需 3nm−2n−2m+4 次操作。第一种和最后一种方案最适合构建簇态，因为它们将生成过程分解为简单部分的重复。

英文摘要：

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we can not destroy these links, we show how to create an n x m cluster using just 3nm -2n -3m/2 + 3 operations. This gives more than a factor of 2 saving over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need (8nm-4n-4m-8)/3 operations. Unfortunately the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A half way scheme, that keeps a modular generation but saves additional operations over never destroying links requires only 3nm-2n-2m+4 operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.

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

↑