arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.05941quant-phcond-mat.quant-gas
收藏

里德伯原子图态中计算序参量的标度

Scaling of Computational Order Parameters in Rydberg Atom Graph States

Zhangjie Qin, V. W. Scarola

AI总结:

本研究在里德伯原子模拟器上构建图态,利用始终开启的相互作用实现纠缠,并通过Clifford群逻辑运算构造计算序参量,以测量纠缠有效性并参数化有限尺寸标度,为量子设备计算能力测试提供途径。

摘要:

图态是具有计算能力的量子态,在测量型量子计算(MBQC)中作为资源态有许多应用。我们在里德伯原子量子模拟器上演示了图态的构建。我们展示了如何利用始终开启的相互作用将所有里德伯原子同时纠缠成图态。我们利用Clifford群中的非局域测量型逻辑运算构造并实现了图态的多体计算序参量。这些序参量衡量纠缠在任意大小图态上实现MBQC的有效性。我们对这些序参量的有限尺寸标度进行了参数化。我们的结果为高效测试量子设备中的计算能力提供了一条途径。

英文摘要:

Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue simulator. We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state. We construct and implement many-body computational order parameters for graph states using non-local measurement-based logic operations in the Clifford group. The order parameters measure the efficacy of entanglement to allow MBQC on graph states of any size. We parameterize finite-size scaling of these order parameters. Our results define a route to efficiently test computational power in quantum devices.

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

↑