论文标题
随机电路中的纠缠复杂性过渡
Transitions in Entanglement Complexity in Random Circuits
论文作者
论文摘要
纠缠是量子力学的定义特征。双方纠缠的特征是von Neumann熵。但是，纠缠不仅是由数字描述的；它也具有其复杂程度。纠缠的复杂性是量子混乱开始的根源，纠缠光谱统计的普遍分布，脱离算法的硬度以及未知随机电路的量子机学习以及通用的时间纠缠波动的量子。在本文中，我们从数值上显示了如何通过用$ t $门的随机clifford电路来驱动从简单的纠缠到通用，复杂模式的交叉。这项工作表明，量子复杂性和复杂的纠缠源于纠缠和非稳定器资源的结合，也称为魔术。
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.
