Quantum State Complexity in Computationally Tractable Quantum Circuits

Quantum State Complexity in Computationally Tractable Quantum Circuits
复制标题

可计算处理的量子电路中的量子态复杂性

DOI:
10.1103/prxquantum.2.010329
复制
发表时间:
2020
期刊:
影响因子:
9.7
通讯作者:
J. Iaconis
J. Iaconis
中科院分区:
物理与天体物理1区
文献类型:
--
作者:
J. Iaconis

文献摘要

参考文献

被引文献

相似文献

描述局部随机量子电路的量子复杂性是一个非常深奥的问题,涉及量子信息论、量子多体物理和高能物理等看似不同的领域。虽然我们对这些系统的理论认识近年来取得了进展,但研究这些模型的数值方法仍然受到严重限制。在本文中,我们讨论了一类特殊的数值可处理的量子电路,称为量子自动机电路,它可能特别适合于这项任务。这些电路保留了计算基础,但可以产生高度纠缠的输出波函数。利用量子复杂性理论的思想,特别是关于酉设计的思想,我们认为自动机波函数具有高量子态复杂性。我们研究了各种各样的度量,包括输出位串分布的测量和量子态广义纠缠特性的表征,并发现自动机波函数非常接近完全哈尔随机态的行为。除此之外,我们还确定了广义的非时序2k点相关函数作为自动机电路中特别有用的复杂性探测。使用这些相关器,我们能够在数值上研究复杂性的增长,远远超出了非常大的系统的置乱时间。因此,我们能够提供局部量子电路设计复杂性线性增长的证据,与量子信息理论的猜想一致。
Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics and high energy physics. While our theoretical understanding of these systems has progressed in recent years, numerical approaches for studying these models remains severely limited. In this paper, we discuss a special class of numerically tractable quantum circuits, known as quantum automaton circuits, which may be particularly well suited for this task. These are circuits which preserve the computational basis, yet can produce highly entangled output wave functions. Using ideas from quantum complexity theory, especially those concerning unitary designs, we argue that automaton wave functions have high quantum state complexity. We look at a wide variety of metrics, including measurements of the output bit-string distribution and characterization of the generalized entanglement properties of the quantum state, and find that automaton wave functions closely approximate the behavior of fully Haar random states. In addition to this, we identify the generalized out-of-time ordered 2k-point correlation functions as a particularly useful probe of complexity in automaton circuits. Using these correlators, we are able to numerically study the growth of complexity well beyond the scrambling time for very large systems. As a result, we are able to present evidence of a linear growth of design complexity in local quantum circuits, consistent with conjectures from quantum information theory.
交互可积 Floquet 系统中的算子增长和本征态纠缠
DOI: 10.1103/physrevb.98.060302
发表时间: 2018
期刊: Physical Review B
影响因子: 3.7
作者:
Gopalakrishnan, Sarang
通讯作者: Gopalakrishnan, Sarang
促进量子细胞自动机作为具有非热本征态和动力学的简单模型
DOI: 10.1088/2058-9565/aad759
发表时间: 2018
影响因子: 6.7
作者:
Gopalakrishnan, Sarang;Zakirov, Bahti
通讯作者: Zakirov, Bahti
DOI: --
发表时间: 2018-02
期刊: arXiv: High Energy Physics - Theory
影响因子: --
作者:
L. Susskind
通讯作者: L. Susskind
DOI: 10.1103/physrevx.8.021014
发表时间: 2018-04-11
期刊: PHYSICAL REVIEW X
影响因子: 12.5
作者:
Nahum, Adam;Vijay, Sagar;Haah, Jeongwan
通讯作者: Haah, Jeongwan
DOI: 10.1103/physrevd.97.086015
发表时间: 2018-04-25
期刊: PHYSICAL REVIEW D
影响因子: 5
作者:
Brown, Adam R.;Susskind, Leonard
通讯作者: Susskind, Leonard