Bipartite mutual information in classical many-body dynamics
Abstract: Information theoretic measures have helped to sharpen our understanding of many-body quantum states. As perhaps the most well-known example, the entanglement entropy (or more generally, the bipartite mutual information) has become a powerful tool for characterizing the dynamical growth of quantum correlations. By contrast, although computable, the bipartite mutual information (MI) is almost never explored in classical many particle systems; this owes in part to the fact that computing the MI requires keeping track of the evolution of the full probability distribution, a feat which is rarely done (or thought to be needed) in classical many-body simulations. Here, we utilize the MI to analyze the spreading of information in 1D elementary cellular automata (CA). Broadly speaking, we find that the behavior of the MI in these dynamical systems exhibits a few different types of scaling that roughly correspond to known CA universality classes. Of particular note is that we observe a set of automata for which the MI converges parametrically slowly to its thermodynamic value. We develop a microscopic understanding of this behavior by analyzing a two-species model of annihilating particles moving in opposite directions. Our work suggests the possibility that information theoretic tools such as the MI might enable a more fine-grained characterization of classical many-body states and dynamics.
- J. H. Bardarson, F. Pollmann, and J. E. Moore, Unbounded growth of entanglement in models of many-body localization, Physical review letters 109, 017202 (2012).
- J. Eisert, M. Cramer, and M. B. Plenio, Colloquium: Area laws for the entanglement entropy, Reviews of modern physics 82, 277 (2010).
- P. Calabrese and J. Cardy, Entanglement entropy and conformal field theory, Journal of physics a: mathematical and theoretical 42, 504005 (2009).
- M. E. Newman and G. T. Barkema, Monte Carlo methods in statistical physics (Clarendon Press, 1999).
- S. Wolfram, Statistical mechanics of cellular automata, Reviews of modern physics 55, 601 (1983).
- S. Wolfram, Universality and complexity in cellular automata, Physica D: Nonlinear Phenomena 10, 1 (1984).
- J. v. Neumann, Theory of self-reproducing automata, Edited by Arthur W. Burks (1966).
- G. Y. Vichniac, Simulating physics with cellular automata, Physica D: Nonlinear Phenomena 10, 96 (1984).
- T. Toffoli, Cellular automata as an alternative to (rather than an approximation of) differential equations in modeling physics, Physica D: Nonlinear Phenomena 10, 117 (1984).
- B. Denby, Neural networks and cellular automata in experimental high energy physics, Computer Physics Communications 49, 429 (1988).
- K. Nagel and M. Schreckenberg, A cellular automaton model for freeway traffic, Journal de physique I 2, 2221 (1992).
- S. Maerivoet and B. De Moor, Cellular automata models of road traffic, Physics reports 419, 1 (2005).
- G. B. Ermentrout and L. Edelstein-Keshet, Cellular automata approaches to biological modeling, Journal of theoretical Biology 160, 97 (1993).
- P. Hogeweg, Cellular automata as a paradigm for ecological modeling, Applied mathematics and computation 27, 81 (1988).
- H. Balzter, P. W. Braun, and W. Köhler, Cellular automata models for vegetation dynamics, Ecological modelling 107, 113 (1998).
- I. Karafyllidis and A. Thanailakis, A model for predicting forest fire spreading using cellular automata, Ecological Modelling 99, 87 (1997).
- B. S. Soares-Filho, G. C. Cerqueira, and C. L. Pennachin, Dinamica—a stochastic cellular automata model designed to simulate the landscape dynamics in an amazonian colonization frontier, Ecological modelling 154, 217 (2002).
- J. M. Epstein and R. Axtell, Growing artificial societies: social science from the bottom up (Brookings Institution Press, 1996).
- A. Nowak and M. Lewenstein, Modeling social change with cellular automata, in Modelling and simulation in the social sciences from the philosophy of science point of view (Springer, 1996) pp. 249–285.
- R. Hegselmann and A. Flache, Understanding complex social dynamics: A plea for cellular automata based modelling, Journal of Artificial Societies and Social Simulation 1, 1 (1998).
- S. Wolfram et al., A new kind of science, Vol. 5 (Wolfram media Champaign, IL, 2002).
- We find that tav=10subscript𝑡av10t_{\rm av}=10italic_t start_POSTSUBSCRIPT roman_av end_POSTSUBSCRIPT = 10 is enough to guarantee a good convergence. If we find that p𝑝pitalic_p has period T<tav𝑇subscript𝑡avT<t_{\rm av}italic_T < italic_t start_POSTSUBSCRIPT roman_av end_POSTSUBSCRIPT, we simply consider the average of the MI over one such periods.
- S. Wolfram, Theory and applications of cellular automata, World Scientific (1986).
- See supplemental material.
- M. Cook et al., Universality in elementary cellular automata, Complex systems 15, 1 (2004).
- M. Cook, A concrete view of rule 110 computation, arXiv preprint arXiv:0906.3248 (2009).
- J. Krug and H. Spohn, Universality classes for deterministic surface growth, Physical Review A 38, 4271 (1988).
- N. Boccara, J. Nasser, and M. Roger, Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules, Physical Review A 44, 866 (1991).
- W. Feller, An introduction to probability theory and its applications, Volume 2, Vol. 81 (John Wiley & Sons, 1991).
- B. Skinner, J. Ruhman, and A. Nahum, Measurement-induced phase transitions in the dynamics of entanglement, Physical Review X 9, 031009 (2019).
- Y. Li, X. Chen, and M. P. Fisher, Measurement-driven entanglement transition in hybrid quantum circuits, Physical Review B 100, 134306 (2019).
- Y. Bao, S. Choi, and E. Altman, Theory of the phase transition in random unitary circuits with measurements, Physical Review B 101, 104301 (2020).
- O. Martin, A. M. Odlyzko, and S. Wolfram, Algebraic properties of cellular automata, Communications in mathematical physics 93, 219 (1984).
- H. Akın, On the measure entropy of additive cellular automata f, Entropy 5, 233 (2003).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.