Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Operator Entanglement Growth Quantifies Complexity of Cellular Automata

Calvin C. Bakker, Wout Merbis

Published Jan 1, 2024• 2 citations
Publisher
DOI
10.1007/978-3-031-63749-0_3

Related papers

Quantum cellular automata part I: Entanglement, physical complexity, and Goldilocks rules

Logan Edward Hillberry, M. Jones, David L. Vargas +6 more

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Entanglement dynamics in quantum cellular automata

M. Andrecut, Mazhar Ali

Physics Letters A•May 1, 2004•5 citations

Quantum cellular automata part II: Robust complexity under analog and digital evolution in 1- and 2-dimensions

Matthew Jones, Logan Edward Hillberry, Eric Jones +5 more

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Operator entanglement growth quantifies complexity of cellular automata

Wout Merbis, Calvin C. Bakker

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.

arXiv:2406.04895•Jun 7, 2024•0 citations

Topological Lower Bound on Quantum Chaos by Entanglement Growth

Zongping Gong, Lorenzo Piroli, J. I. Cirac

A fundamental result in modern quantum chaos theory is the Maldacena-Shenker-Stanford upper bound on the growth of out-of-time-order correlators, whose infinite-temperature limit is related to the operator-space entanglement entropy of the evolution operator. Here we show that, for one-dimensional quantum cellular automata (QCA), there exists a lower bound on quantum chaos quantified by such entanglement entropy. This lower bound is equal to twice the index of the QCA, which is a topological invariant that measures the chirality of information flow, and holds for all the Rényi entropies, with its strongest Rényi-∞ version being tight. The rigorous bound rules out the possibility of any sublinear entanglement growth behavior, showing in particular that many-body localization is forbidden for unitary evolutions displaying nonzero index. Since the Rényi entropy is measurable, our findings have direct experimental relevance. Our result is robust against exponential tails which naturally appear in quantum dynamics generated by local Hamiltonians.

arXiv:2012.02772•Physical Review Letters•Apr 19, 2021•27 citations

Entanglement and complexity in quantum elementary cellular automata

Logan Edward Hillberry

Complexity is an intuitively recognized feature of nature, but where does it come from? Is complexity only apparent at the classical level, or can it be found at the underlying quantum level as well? We approach these questions by exploring models consistent with basic quantum theory but which also hold promise for exhibiting complex behaviors -- a set of models we call the quantum elementary cellular automata (QECA). Previously, various quantum cellular automata models have been studied for both their quantum information theoretic properties and their ability to simulate key physics equations like the Schrodinger and Dirac equations. We take the unique approach of analyzing QECA as complexity-generating systems. Doing so requires a more precise notion of what we mean by complex. This is done by proposing nine axes of complexity along which the complexity of any system may be quantified. When applied to QECA, we find evidence of complexity using three of these axes, namely diversity, persistent dynamical macrostates, and connectivity. The studies presented are numerical simulations done without approximation using highly optimized exact diagonalization code which supports a Hilbert space of up to 2^27 dimensions. The code is written entirely in the high-level open source programming language Python, making it easily expandable to future projects requiring exact simulation of quantum systems. A careful description of an algorithm critical to our method as well as our use of high performance computing resources on a cluster supercomputer is given. Powerful quantifiers of entanglement and connectivity such as von Neumann entropy and complex network measures computed on quantum mutual information adjacency matrices provide analysis tools for the simulations. Each network measure is defined then tested on well-characterized entangled states from quantum information theory, like the GHZ and W states and singlet state arrays. The network measures known as network density, clustering coefficient, and disparity are specifically considered. We find these network measures offer unique information regarding the structure of two point correlations in the states produced by QECA dynamics, as compared to each other and as quantified by a principal component analysis. Using such measures, we address the complexity of QECA models at three levels of specificity. First, a broad analysis of tens of thousands of simulations gives an overview of the variety of dynamics available to the models. We quantify the diversity of our simulations as the density of simulations which appear, on average, unlike typical entangled quantum states. Second, a more selective analysis identifies QECA by their complexity dynamics, in the frequency domain. A few QECA which exhibit persistent dynamical macrostates in the form of highly structured entanglement are also described. Entanglement dynamics are quantified by the distribution of changes in bond entropy (the von Neumann entropy of all bipartitionings of the QECA system). Finally, we take a detailed look at the transport properties, defined as the speed and diffusion rate of an initial localized excitation, in a QECA model found earlier to exhibit persistent dynamical macrostates. The transport properties are found to be a function of a model parameter called the phase gate angle. Additionally, for high phase gate angle we find the emergence of a second trajectory from a single initial excitation. Taken together, the analyses in this thesis suggest QECA support elements of complexity in quantum dynamics. Since QECA are consistent with quantum theory, we conclude that complexity is not reserved for only the classical realm. The thesis finishes by suggesting future studies of complexity in quantum cellular automata.

•Jul 11, 2016•4 citations
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.
A fundamental result in modern quantum chaos theory is the Maldacena-Shenker-Stanford upper bound on the growth of out-of-time-order correlators, whose infinite-temperature limit is related to the operator-space entanglement entropy of the evolution operator. Here we show that, for one-dimensional quantum cellular automata (QCA), there exists a lower bound on quantum chaos quantified by such entanglement entropy. This lower bound is equal to twice the index of the QCA, which is a topological invariant that measures the chirality of information flow, and holds for all the Rényi entropies, with its strongest Rényi-∞ version being tight. The rigorous bound rules out the possibility of any sublinear entanglement growth behavior, showing in particular that many-body localization is forbidden for unitary evolutions displaying nonzero index. Since the Rényi entropy is measurable, our findings have direct experimental relevance. Our result is robust against exponential tails which naturally appear in quantum dynamics generated by local Hamiltonians.
Complexity is an intuitively recognized feature of nature, but where does it come from? Is complexity only apparent at the classical level, or can it be found at the underlying quantum level as well? We approach these questions by exploring models consistent with basic quantum theory but which also hold promise for exhibiting complex behaviors -- a set of models we call the quantum elementary cellular automata (QECA). Previously, various quantum cellular automata models have been studied for both their quantum information theoretic properties and their ability to simulate key physics equations like the Schrodinger and Dirac equations. We take the unique approach of analyzing QECA as complexity-generating systems. Doing so requires a more precise notion of what we mean by complex. This is done by proposing nine axes of complexity along which the complexity of any system may be quantified. When applied to QECA, we find evidence of complexity using three of these axes, namely diversity, persistent dynamical macrostates, and connectivity. The studies presented are numerical simulations done without approximation using highly optimized exact diagonalization code which supports a Hilbert space of up to 2^27 dimensions. The code is written entirely in the high-level open source programming language Python, making it easily expandable to future projects requiring exact simulation of quantum systems. A careful description of an algorithm critical to our method as well as our use of high performance computing resources on a cluster supercomputer is given. Powerful quantifiers of entanglement and connectivity such as von Neumann entropy and complex network measures computed on quantum mutual information adjacency matrices provide analysis tools for the simulations. Each network measure is defined then tested on well-characterized entangled states from quantum information theory, like the GHZ and W states and singlet state arrays. The network measures known as network density, clustering coefficient, and disparity are specifically considered. We find these network measures offer unique information regarding the structure of two point correlations in the states produced by QECA dynamics, as compared to each other and as quantified by a principal component analysis. Using such measures, we address the complexity of QECA models at three levels of specificity. First, a broad analysis of tens of thousands of simulations gives an overview of the variety of dynamics available to the models. We quantify the diversity of our simulations as the density of simulations which appear, on average, unlike typical entangled quantum states. Second, a more selective analysis identifies QECA by their complexity dynamics, in the frequency domain. A few QECA which exhibit persistent dynamical macrostates in the form of highly structured entanglement are also described. Entanglement dynamics are quantified by the distribution of changes in bond entropy (the von Neumann entropy of all bipartitionings of the QECA system). Finally, we take a detailed look at the transport properties, defined as the speed and diffusion rate of an initial localized excitation, in a QECA model found earlier to exhibit persistent dynamical macrostates. The transport properties are found to be a function of a model parameter called the phase gate angle. Additionally, for high phase gate angle we find the emergence of a second trajectory from a single initial excitation. Taken together, the analyses in this thesis suggest QECA support elements of complexity in quantum dynamics. Since QECA are consistent with quantum theory, we conclude that complexity is not reserved for only the classical realm. The thesis finishes by suggesting future studies of complexity in quantum cellular automata.