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

随机电路中纠缠复杂度的跃迁

Transitions in Entanglement Complexity in Random Circuits

Sarah True, Alioscia Hamma

摘要:

纠缠是量子力学的定义性特征。两体纠缠的特征是冯诺伊曼熵。然而,纠缠不仅仅是用一个数字来描述的;它还以其复杂程度为特征。纠缠的复杂性是量子混沌的起源、纠缠谱统计的普遍分布、解纠缠算法和未知随机电路的量子机器学习的困难以及普遍的时间纠缠波动的根源。在本文中,我们用数值方法展示了如何通过在随机Clifford电路中掺杂$T$门来驱动从简单纠缠模式到通用复杂模式的交叉。这项工作表明,量子复杂性和复杂纠缠源于纠缠和非稳定剂资源的结合,也称为魔术。

英文摘要:

Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of complexity. The complexity of entanglement is at the root of the onset of quantum chaos, universal distribution of entanglement spectrum statistics, hardness of a disentangling algorithm and of the quantum machine learning of an unknown random circuit, and universal temporal entanglement fluctuations. In this paper, we numerically show how a crossover from a simple pattern of entanglement to a universal, complex pattern can be driven by doping a random Clifford circuit with $T$ gates. This work shows that quantum complexity and complex entanglement stem from the conjunction of entanglement and non-stabilizer resources, also known as magic.

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

↑