A graph-theoretic approach to chaos and complexity in quantum systems

Abstract

There has recently been considerable interest in studying quantum systems via dynamical Lie algebras (DLAs) -- Lie algebras generated by the terms which appear in the Hamiltonian of the system. However, there are some important properties that are revealed only at a finer level of granularity than the DLA. In this work we explore, via the commutator graph, average notions of scrambling, chaos and complexity over ensembles of systems with DLAs that possess a basis consisting of Pauli strings. Unlike DLAs, commutator graphs are sensitive to short-time dynamics, and therefore constitute a finer probe to various characteristics of the corresponding ensemble. We link graph-theoretic properties of the commutator graph to the out-of-time-order correlator (OTOC), the frame potential, the frustration graph of the Hamiltonian of the system, and the Krylov complexity of operators evolving under the dynamics. For example, we reduce the calculation of average OTOCs to a counting problem on the graph; separately, we connect the Krylov complexity of an operator to the module structure of the adjoint action of the DLA on the space of operators in which it resides, and prove that its average over the ensemble is lower bounded by the average shortest path length between the initial operator and the other operators in the commutator graph.

34 pages, 10 figures

References in corpus (42)

• A bound on chaos
• Black holes and the butterfly effect
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Measuring the scrambling of quantum information
• Chaos and complexity by design
• Evenly distributed unitaries: on the structure of unitary designs
• A Universal Operator Growth Hypothesis
• Lyapunov Exponent and Out-of-Time-Ordered Correlator's Growth Rate in a Chaotic System
• Local random quantum circuits are approximate polynomial-designs
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Is efficiency of classical simulations of quantum dynamics related to integrability?
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Quantum Dynamics in Krylov Space: Methods and Applications
• Information Scrambling over Bipartitions: Equilibration, Entropy Production, and Typicality
• On some properties of orthogonal Weingarten functions
• Matchgate Shadows for Fermionic Quantum Simulation
• Does provable absence of barren plateaus imply classical simulability?
• A polynomial-time classical algorithm for noisy random circuit sampling
• Scrambling is Necessary but Not Sufficient for Chaos
• Information Scrambling in Quantum Neural Networks
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Real Randomized Benchmarking
• Provably Trainable Rotationally Equivariant Quantum Machine Learning
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• Scrambling Ability of Quantum Neural Networks Architectures
• Universal extensions of restricted classes of quantum operations
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Identification of dynamical Lie algebras for finite-level quantum control systems
• Classically estimating observables of noiseless quantum circuits
• Magic Resources of the Heisenberg Picture
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Lie-algebraic classical simulations for quantum computing
• Quantum neural networks form Gaussian processes
• Quantifying scrambling in quantum neural networks
• A Unified Graph-Theoretic Framework for Free-Fermion Solvability
• Adversarial Robustness Guarantees for Quantum Classifiers
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation
• Showcasing a Barren Plateau Theory Beyond the Dynamical Lie Algebra
• Random ensembles of symplectic and unitary states are indistinguishable
• Random Real Valued and Complex Valued States Cannot be Efficiently Distinguished
• Full classification of Pauli Lie algebras