论文标题

在量子处理器上通往非亚伯拓扑顺序的最短途径

Shortest Route to Non-Abelian Topological Order on a Quantum Processor

论文作者

Tantivasadakarn, Nathanan, Verresen, Ruben, Vishwanath, Ashvin

论文摘要

一个高度令人垂涎的目标是实现新兴的非亚洲仪表理论及其任何兴奋,该理论编码无熔融量子信息。虽然量子设备中的测量结果为可靠地准备这样的远程纠缠状态提供了新的希望,但使用有限深度电路的实验建立的成分进行的现有协议,而单轮测量只会产生阿贝尔州。令人惊讶的是,我们表明存在一个广泛的非亚伯利亚国家(即具有拉格朗日亚组的国家),可以使用这些相同的最小成分来创建,绕开了对新资源(例如前馈)的需求。为了说明这提供了现实的协议,我们展示了如何使用Depth-11电路和单层测量值在Google的量子处理器上实现$ d_4 $ non-Abelian拓扑顺序。我们的工作为实现和操纵非亚伯式拓扑秩序的实现开辟了道路,并突出了非亚伯阶段复杂性的违反直觉特征。

A highly coveted goal is to realize emergent non-Abelian gauge theories and their anyonic excitations, which encode decoherence-free quantum information. While measurements in quantum devices provide new hope for scalably preparing such long-range entangled states, existing protocols using the experimentally established ingredients of a finite-depth circuit and a single round of measurement produce only Abelian states. Surprisingly, we show there exists a broad family of non-Abelian states -- namely those with a Lagrangian subgroup -- which can be created using these same minimal ingredients, bypassing the need for new resources such as feed-forward. To illustrate that this provides realistic protocols, we show how $D_4$ non-Abelian topological order can be realized, e.g., on Google's quantum processors using a depth-11 circuit and a single layer of measurements. Our work opens the way towards the realization and manipulation of non-Abelian topological orders, and highlights counter-intuitive features of the complexity of non-Abelian phases.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源