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.
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.
Emerging quantum simulator technologies provide a new challenge to quantum many body theory. Quantifying the emergent order in and predicting the dynamics of such complex quantum systems requires a new approach. We develop such an approach based on complex network analysis of quantum mutual information. First, we establish the usefulness of quantum mutual information complex networks by reproducing the phase diagrams of transverse Ising and Bose-Hubbard models. By quantifying the complexity of quantum cellular automata we then demonstrate the applicability of complex network theory to non-equilibrium quantum dynamics. We conclude with a study of student collaboration networks, correlating a student's role in a collaboration network with their grades. This work thus initiates a quantitative theory of quantum complexity and provides a new tool for physics education research. We find that network density, clustering coefficient, disparity, and Pearson R correlation show systematic finite size scaling towards critical points of the transverse Ising model and the Bose-Hubbard model. Using matrix product state methods we are able to simulate lattices of hundreds of qubits, allowing us to verify the critical point of the transverse Ising model to within 0.001% of its known value. Furthermore, we find that complex network analysis identifies the Berezinskii-Kosterlitz-Thouless critical point of the Bose-Hubbard to within 3.6% of its accepted value. Finally, we identify the boundary separating the Mott Insulator phase from a superfluid phase in the Bose-Hubbard model by extremizing network density, clustering coefficient, and disparity. After studying the static properties of quantum many body systems, we study the entanglement and complexity generated by Hamiltonian based quantum cellular automata. In quantum cellular automata one defines a set of local rules that govern the evolution of the quantum state. A site in a quantum lattice evolves if the set of sites around it are in certain configurations. Configurations are defined in terms of the number of sites in the ``alive'' state about a site. We quantify entanglement in terms of the central bond entropy, and complexity in terms of persistent fluctuations of the central bond entropy, complex network measures of quantum mutual information networks far from their values for random/well known quantum states, and robust dynamical features. These Hamiltonians are a generalization of the Bleh, Calarco, Montangero Hamiltonian. Before beginning our study of the entanglement and complexity generated by these Hamiltonians we first perform a convergence analysis of the dynamics of the Bleh, Calarco, Montangero Hamiltonian using an open source matrix product state code, Open Source Matrix Product States. We find that the Bleh, Calarco, Montangero Hamiltonian rapidly saturates the entanglement cutoff of Open Source Matrix Product States for all initial conditions studied and is thus not a viable numerical method for studying the dynamics of quantum cellular automata. We conclude our convergence study with a case study of an emergent quantum blinker pattern also observed in exact simulation and a case study of a nearest neighbor quantum cellular automata. We conclude that while for generic initial conditions Open Source Matrix Product States is unable to meet its internal convergence criteria, for particular initial conditions and quantum cellular automata it is able to provide reliable estimates of entanglement and complexity measures. The failure of OpenMPS to provide reliably converged quantum states leads us to study our quantum cellular automata using a Trotter-based time evolution scheme. We quantify the entanglement and complexity generated by 13 next-nearest neighbor quantum cellular automata. We also define Goldilocks rules, rules that produce activity at a site if there are exactly the right number of alive sites in the neighborhood of a site, not too few, not too many. We identify a Goldilocks rule, rule 4, as the best complexity-generating rule out of the 13 rules tested, verifying our hypothesis that only Goldilocks rules are complexity generating. We also find that non-Goldilocks rules tend toward thermalization as quantified by reduced fluctuations in the central bond entropy. We find that both highly entangled quantum states and lowly entangled quantum states have complex structure in their quantum mutual information adjacency matrices. Finally, in keeping with the strong physics education research focus at the Colorado School of Mines, we apply complex network analysis to a key issue germane to the student experience, namely student collaboration networks. We compute nodal centrality measures on the collaboration networks of students enrolled in three upper-division physics courses at the Colorado School of Mines. These are networks in which links between students indicate assistance with homework. The courses included in the study are intermediate classical mechanics, introductory quantum mechanics, and intermediate electromagnetism. We find that almost all of the measures considered correlate with analytical homework grades. In contrast only net out-strength correlates with exam grade. The benefits of collaboration do not extend from homework to exams, and students who help more than they are helped perform well on exams. Centrality measures between simultaneous collaboration networks (analytical vs. numerical homework collaboration) composed of the same students correlate with each other. Students take on similar roles in response to analytical vs. numerical homework assignments. Changes in collaboration across semesters are also considered as students transition from classical mechanics in the fall to quantum mechanics and electromagnetism in the spring. We find the most frequent transition is that students that help many others and have high grades will continue to help many others and have high grades. Students that help few more frequently transition from low grades to high grades than students that help many.
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms—Rydberg arrays, trapped ions, and superconducting qubits—can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.
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.
Every process of our universe is based on the fundamental elements of nature: information and computation.The basic motivation behind the study of quantum cellular automata (QCA) is the wish to analyze the processes of nature.QCA provide a natural framework within which to describe many classically undescribable and uncomputable physical phenomena, such as the properties of quantum physical systems and the complex background of quantum dynamics.Quantum cellular automata models are based on the working mechanism of classical cellular automata models and use the power of reversible quantum computation.Cellular automata can be used in many fields of science, such as parallel computation, artificial intelligence, image processing, biological systems, simulation of physics systems, hardware design, algorithm theory, and many more.In the first part of this chapter, we give a brief overview of the basic properties of quantum information processing and analyze the quantum versions of classical cellular automata models.We present all materials in a clear, perspicuous, and comprehensible manner, without using a complex mathematical background.After reviewing physical QCA implementations, we sketch future directions, and then conclude the first part.In the second part of the chapter, we examine one possible application of QCA, which uses quantum computing to realize real-life based, truly random network organization.This abstract machine is called a Quantum Cellular Machine (QCM), and we design it for controlling a truly random biologically-inspired network, and to integrate quantum learning algorithms and quantum searching into a controlled, self-organizing system.The selforganizing processes in classical systems cannot be truly random.Using our quantum probabilistic QCM unit, we can add truly random behavior to the self-organizing processes of biological networks.A quantum mechanical-based quantum cellular machine (QCM) controls the self-organizing processes of the network and uses a closed, non-classical quantum mechanical-based language inside the QCM.The proposed QCM solution has deep relevance in the evolution of truly random quantum probabilistic self-organizing network structures.The QCM controls the evolution of the system, changes its environment and creates plans without any human interaction, using truly random quantum probabilistic decisions.In a classical system, the classical circuits can only exhibit deterministic behavior.In a quantum probabilistic control system, the quantum circuits can follow both deterministic and quantum probabilistic quantum cellular machine control behaviors.The QCM has classical and quantum communication layers, it uses the classical layer to detect www.intechopen.comCellular Automata -Innovative Modelling for Science and Engineering 114 the network environment.The lower layer of the quantum cellular machine contains the non-deterministic quantum probabilistic decisions and interacts with the classical level.The quantum cellular machine model with the power of quantum computing can be used for the development of a real-life based network organism.We show, that a real, biologically inspired, non-deterministic, truly random network model can be achieved by the discussed QCM model.In the third part of this chapter, we show that a very efficient quantum searching algorithm can be integrated into the QCM, to find the best solution to a given network input command.We present a quantum searching based method specially designed for quantum probabilistic self-organizing networks, to reduce the complexity of the classical traditional search in the network.The proposed QCM can process both quantum and classical information, and accomplish both deterministic and quantum probabilistic tasks.The information unit is a quantum bit, which can lie in a coherent superposition state of logical states zero and one, and can thus simultaneously store zero and one.Using quantum bits, we can speed up the solutions of classical problems, and even solve some hard problems that classical computers can't solve.The key aspect behind the optimal decisions of a QCM is to design a high-efficiency searching algorithm.A QCM updates the probability amplitudes of its quantum register, according to a given reward value, derived from the network environment.The QCM repeatedly applies a unitary transformation to the quantum states, thus it can enhance, for example, the probability amplitude of the optimal path in the self-organizing network environment, while suppressing the amplitude of all other solutions.The QCM's quantum searching algorithm can help resolve many hard tasks, for example it could be applied to find an optimal logical path, using the effects of quantum mechanics.In the numerical analysis we will show that the quantum communication layer could improve the performance of classical systems.
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is required between arbitrarily distant pairs of lattice qubits. An alternative model of quantum computation based on quantum cellular automata (QCA) requires only homogeneous local interactions that can be implemented in parallel. This would be a huge simplification in an actual experiment. We find some minimal physical requirements for the construction of unitary QCA in a one-dimensional Ising spin chain and demonstrate optimal pulse sequences for information transport and entanglement distribution. We also introduce the theory of nonunitary QCA and show by example that nonunitary rules can generate environment assisted entanglement.
Quantum entanglement, a phenomenon where two or more particles become linked and share the same fate, has captivated physicists and philosophers alike. While established in quantum mechanics, its application to complex systems, particularly cellular automata, presents a fascinating challenge and opportunity. This paper explores the potential of extending the concept of quantum entanglement beyond individual particles to propose a dynamic, multi-level entanglement structure within cellular automata simulations. We hypothesize that this approach, driven by chaotic behavior observed in cellular automata, could yield emergent phenomena, including "quantum foam" behavior, offering novel insights into the fundamental nature of reality. The core mechanism involves introducing a novel evolution rule based on chaotic dynamics, incorporating feedback loops and probabilistic branching to generate complex entanglement patterns. This work aims to advance our understanding of entanglement's role in complex systems and potentially lead to new computational models.