arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.04895nlin.CGcond-mat.stat-mechquant-ph
收藏

算子纠缠增长量化元胞自动机的复杂性

Operator entanglement growth quantifies complexity of cellular automata

Wout Merbis, Calvin Bakker

AI总结:

本文提出用矩阵乘积算子奇异值谱的熵增长(算子纠缠熵)作为定量度量,对经典确定性元胞自动机的复杂性进行分类和动力学行为刻画。

摘要:

元胞自动机(CA)是简单局部相互作用规则能够在大尺度上产生复杂涌现现象的典型系统。CA 的各种动力学行为类型通常依据 Wolfram 复杂性类别进行经验性分类。本文提出一种植根于量子信息理论的定量度量,用于对经典确定性元胞自动机的复杂性进行分类。具体而言,我们在所有可能 CA 构型的空间上构造转移矩阵的矩阵乘积算子(MPO)。我们发现,MPO 奇异值谱的熵增长揭示了 CA 的复杂性,并可用于刻画其动力学行为。该度量定义了 CA 的算子纠缠熵概念,表明量子信息度量可以有意义地应用于经典确定性系统。

英文摘要:

Cellular automata (CA) exemplify systems where simple local interaction rules can lead to intricate and complex emergent phenomena at large scales. The various types of dynamical behavior of CA are usually categorized empirically into Wolfram's complexity classes. Here, we propose a quantitative measure, rooted in quantum information theory, to categorize the complexity of classical deterministic cellular automata. Specifically, we construct a Matrix Product Operator (MPO) of the transition matrix on the space of all possible CA configurations. We find that the growth of entropy of the singular value spectrum of the MPO reveals the complexity of the CA and can be used to characterize its dynamical behavior. This measure defines the concept of operator entanglement entropy for CA, demonstrating that quantum information measures can be meaningfully applied to classical deterministic systems.

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

↑