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

arXiv:2305.03334 · Physical review. E

Complexity of spin configuration dynamics due to unitary evolution and periodic projective measurements

Heitor P. Casagrande, Bo Xing, Marcello Dalmonte, Álex Rodríguez, Vinitha Balachandran, Dario Poletti

Published Oct 12, 2023• 11 citations
arXivHTMLPDF

Abstract

We study the Hamiltonian dynamics of a many-body quantum system subjected to periodic projective measurements, which leads to probabilistic cellular automata dynamics. Given a sequence of measured values, we characterize their dynamics by performing a principal component analysis (PCA). The number of principal components required for an almost complete description of the system, which is a measure of complexity we refer to as PCA complexity, is studied as a function of the Hamiltonian parameters and measurement intervals. We consider different Hamiltonians that describe interacting, noninteracting, integrable, and nonintegrable systems, including random local Hamiltonians and translational invariant random local Hamiltonians. In all these scenarios, we find that the PCA complexity grows rapidly in time before approaching a plateau. The dynamics of the PCA complexity can vary quantitatively and qualitatively as a function of the Hamiltonian parameters and measurement protocol. Importantly, the dynamics of PCA complexity present behavior that is considerably less sensitive to the specific system parameters for models which lack simple local dynamics, as is often the case in nonintegrable models. In particular, we point out a figure of merit that considers the local dynamics and the measurement direction to predict the sensitivity of the PCA complexity dynamics to the system parameters.

DOI
10.1103/physreve.108.044128

Related papers

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

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

Non-Markovian quantum dynamics quantification in the Jaynes-Cummings model using principal component analisys

Carlos A. Galindez, Arturo Argüelles

Abstract Recent advancements in quantum information science have led to an increased focus on the study of open quantum systems and their non-Markovian dynamics. In this paper, we present a novel approach to quantifying the non-Markovian dynamics of a n-dimensional quantum system using Principal Component Analysis (PCA). The motivation for this work stems from the growing interest in understanding the complex interplay between quantum systems and their environment, alongside the potential of machine learning techniques to provide new insights into such systems dynamics. We specifically apply our methodology to the Jaynes-Cummings (JC) model, which describes the interaction between a two-level atom and a quantized electromagnetic field mode, and a cornerstone in quantum non-Markovianity studies due to its characteristic collapse and revival phenomena. Our PCA-based method aims to capture the non-Markovian features of the system dynamics in a comprehensive and interpretable manner. This involves constructing a covariance matrix from the state vector of the system for a set of initial states and employing PCA to identify the dominant modes of variation. Subsequently, we analyze the temporal behavior of these principal components to quantify the non-Markovian characteristics of the system. Importantly, our method provides a more nuanced understanding of non-Markovian dynamics, revealing insights that may not be fully captured by conventional approaches.

•Sep 11, 2025•0 citations

Quantum random walk and tight-binding model subject to projective measurements at random times

Debraj Das, Shamik Gupta

Abstract What happens when a quantum system undergoing unitary evolution in time is subject to repeated projective measurements to the initial state at random times? A question of general interest is: how does the survival probability S m , namely, the probability that an initial state survives even after m number of measurements, behave as a function of m ? We address these issues in the context of two paradigmatic quantum systems, one, the quantum random walk evolving in discrete time, and the other, the tight-binding model evolving in continuous time, with both defined on a one-dimensional periodic lattice with a finite number of sites N . For these two models, we present several numerical and analytical results that hint at the curious nature of quantum measurement dynamics. In particular, we unveil that when evolution after every projective measurement continues with the projected component of the instantaneous state, the average and the typical survival probability decay as an exponential in m for large m . By contrast, if the evolution continues with the leftover component, namely, what remains of the instantaneous state after a measurement has been performed, the survival probability exhibits two characteristic m values, namely, m 1 ⋆ ( N ) ∼ N and m 2 ⋆ ( N ) ∼ N δ with δ > 1. These scales are such that (i) for m large and satisfying m < m 1 ⋆ ( N ) , the decay of the survival probability is as m −2 , (ii) for m satisfying m 1 ⋆ ( N ) ≪ m < m 2 ⋆ ( N ) , the decay is as m −3/2 , while (iii) for m ≫ m 2 ⋆ ( N ) , the decay is as an exponential. The results for the dynamics with the leftover component, already known for the case of measurements at regular intervals, are being extended here to the case of measurements at random intervals. We find that our results hold independently of the choice of the distribution of times between successive measurements, as have been corroborated by our resu

arXiv:2105.00338•Journal of Statistical Mechanics Theory and Experiment•Mar 1, 2022•19 citations

Quantum complexity: Quantum mutual information, complex networks, and emergent phenomena in quantum cellular automata

David L. Vargas

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.

Theory of Computing Systems•Oct 13, 2016•4 citations

Spread complexity and quantum chaos for periodically driven spin chains

Amin A. Nizami, Ankit W. Shrestha

The complexity of quantum states under dynamical evolution can be investigated by studying the spread with time of the state over a predefined basis. It is known that this complexity is minimized by choosing the Krylov basis, thus defining the spread complexity. We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. The main illustrative quantum many-body model we use is the periodically kicked Ising spinchain with nonintegrable deformations, a chaotic system where we look at both local and nonlocal interactions. In the various cases, we find distinctive behavior of the Arnoldi coefficients and spread complexity for regular versus chaotic dynamics: suppressed fluctuations in the Arnoldi coefficients as well as larger saturation value in spread complexity in the chaotic case. We compare the behavior of the Krylov measures with that of standard spectral diagnostics of chaos. We also study the effect of changing the driving frequency on the complexity saturation.

arXiv:2405.16182•Physical review. E•Sep 3, 2024•20 citations
We study the Hamiltonian dynamics of a many-body quantum system subjected to periodic projective measurements, which leads to probabilistic cellular automata dynamics. Given a sequence of measured values, we characterize their dynamics by performing a principal component analysis (PCA). The number of principal components required for an almost complete description of the system, which is a measure of complexity we refer to as PCA complexity, is studied as a function of the Hamiltonian parameters and measurement intervals. We consider different Hamiltonians that describe interacting, noninteracting, integrable, and nonintegrable systems, including random local Hamiltonians and translational invariant random local Hamiltonians. In all these scenarios, we find that the PCA complexity grows rapidly in time before approaching a plateau. The dynamics of the PCA complexity can vary quantitatively and qualitatively as a function of the Hamiltonian parameters and measurement protocol. Importantly, the dynamics of PCA complexity present behavior that is considerably less sensitive to the specific system parameters for models which lack simple local dynamics, as is often the case in nonintegrable models. In particular, we point out a figure of merit that considers the local dynamics and the measurement direction to predict the sensitivity of the PCA complexity dynamics to the system parameters.
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.
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.
Abstract Recent advancements in quantum information science have led to an increased focus on the study of open quantum systems and their non-Markovian dynamics. In this paper, we present a novel approach to quantifying the non-Markovian dynamics of a n-dimensional quantum system using Principal Component Analysis (PCA). The motivation for this work stems from the growing interest in understanding the complex interplay between quantum systems and their environment, alongside the potential of machine learning techniques to provide new insights into such systems dynamics. We specifically apply our methodology to the Jaynes-Cummings (JC) model, which describes the interaction between a two-level atom and a quantized electromagnetic field mode, and a cornerstone in quantum non-Markovianity studies due to its characteristic collapse and revival phenomena. Our PCA-based method aims to capture the non-Markovian features of the system dynamics in a comprehensive and interpretable manner. This involves constructing a covariance matrix from the state vector of the system for a set of initial states and employing PCA to identify the dominant modes of variation. Subsequently, we analyze the temporal behavior of these principal components to quantify the non-Markovian characteristics of the system. Importantly, our method provides a more nuanced understanding of non-Markovian dynamics, revealing insights that may not be fully captured by conventional approaches.
Abstract What happens when a quantum system undergoing unitary evolution in time is subject to repeated projective measurements to the initial state at random times? A question of general interest is: how does the survival probability S m , namely, the probability that an initial state survives even after m number of measurements, behave as a function of m ? We address these issues in the context of two paradigmatic quantum systems, one, the quantum random walk evolving in discrete time, and the other, the tight-binding model evolving in continuous time, with both defined on a one-dimensional periodic lattice with a finite number of sites N . For these two models, we present several numerical and analytical results that hint at the curious nature of quantum measurement dynamics. In particular, we unveil that when evolution after every projective measurement continues with the projected component of the instantaneous state, the average and the typical survival probability decay as an exponential in m for large m . By contrast, if the evolution continues with the leftover component, namely, what remains of the instantaneous state after a measurement has been performed, the survival probability exhibits two characteristic m values, namely, m 1 ⋆ ( N ) ∼ N and m 2 ⋆ ( N ) ∼ N δ with δ > 1. These scales are such that (i) for m large and satisfying m < m 1 ⋆ ( N ) , the decay of the survival probability is as m −2 , (ii) for m satisfying m 1 ⋆ ( N ) ≪ m < m 2 ⋆ ( N ) , the decay is as m −3/2 , while (iii) for m ≫ m 2 ⋆ ( N ) , the decay is as an exponential. The results for the dynamics with the leftover component, already known for the case of measurements at regular intervals, are being extended here to the case of measurements at random intervals. We find that our results hold independently of the choice of the distribution of times between successive measurements, as have been corroborated by our resu
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.
The complexity of quantum states under dynamical evolution can be investigated by studying the spread with time of the state over a predefined basis. It is known that this complexity is minimized by choosing the Krylov basis, thus defining the spread complexity. We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. The main illustrative quantum many-body model we use is the periodically kicked Ising spinchain with nonintegrable deformations, a chaotic system where we look at both local and nonlocal interactions. In the various cases, we find distinctive behavior of the Arnoldi coefficients and spread complexity for regular versus chaotic dynamics: suppressed fluctuations in the Arnoldi coefficients as well as larger saturation value in spread complexity in the chaotic case. We compare the behavior of the Krylov measures with that of standard spectral diagnostics of chaos. We also study the effect of changing the driving frequency on the complexity saturation.