This paper investigates the emergence of the thermodynamic arrow of time in a closed 8-qubit quantum system. We analyze the tension between information scrambling and Poincaré recurrence by comparing two dynamical regimes: a near-integrable Heisenberg chain (Regime I) and a symmetry-broken chaotic regime (Regime II). Our central numerical result is a collapse of the Poincaré recurrence fidelity from F ≈ 0.99 to F ≈ 0.11 upon introducing symmetry-breaking fields. We provide structural analysis via Krylov subspace growth (Lanczos coefficients), illustrating that irreversibility in finite systems is an emergent property driven by spectral complexity. The global von Neumann entropy remains strictly zero in both regimes, confirming that information is conserved — the apparent irreversibility arises from the complexity of the path by which information returns, not from any fundamental loss. All results are obtained from exact unitary simulation of the Schrödinger equation; no Lindblad or Markov approximations are used. Simulation code: https://zenodo.org/records/18813710
This paper investigates the emergence of the thermodynamic arrow of time in a closed 8-qubit quantum system. We analyze the tension between information scrambling and Poincaré recurrence by comparing two dynamical regimes: a near-integrable Heisenberg chain (Regime I) and a symmetry-broken chaotic regime (Regime II). Our central numerical result is a collapse of the Poincaré recurrence fidelity from F ≈ 0.99 to F ≈ 0.11 upon introducing symmetry-breaking fields. We provide structural analysis via Krylov subspace growth (Lanczos coefficients), illustrating that irreversibility in finite systems is an emergent property driven by spectral complexity. The global von Neumann entropy remains strictly zero in both regimes, confirming that information is conserved — the apparent irreversibility arises from the complexity of the path by which information returns, not from any fundamental loss. All results are obtained from exact unitary simulation of the Schrödinger equation; no Lindblad or Markov approximations are used. Simulation code: https://zenodo.org/records/18813710
We propose that quantum scrambling in many-body quantum channels constitutes a cryptographic resource that enables a fundamentally new class of channel authentication protocols. By synthesizing results from three independent lines of investigation, scrambling irreversibility in closed quantum systems, Krylov complexity-based channel detection, and sidereal filtering validated on real astrophysical data, we establish the following chain of reasoning. First, scrambling in symmetry-broken Heisenberg chains produces a practically irreversible dynamical process, with Poincaré recurrence times scaling as τ_rec ~ (1/ε)^{2^N - 1}. Second, the Lanczos coefficients b_n of the channel Hamiltonian determine the functional form of the channel's temporal autocorrelation through the dynamical susceptibility, yielding a Gaussian template for linearly growing b_n. Third, in simulated experiments using template-matching classifiers applied to scrambling-derived correlation traces, compromised channels can be distinguished from clean channels with an area-under-curve (AUC) value of 0.99 under controlled realistic noise conditions. Fourth, as a proof-of-concept for extracting stable temporal fingerprints from noisy real-world signals, the sidereal filtering layer has been validated on 59,389 pulsar time-of-arrival measurements from the NANOGrav 15-year dataset. We argue that the combination of these results implies that scrambling defines a physical one-way signature: a measurable, predictable, and practically unforgeable channel fingerprint whose security rests on quantum-mechanical irreversibility rather than computational hardness assumptions. This work synthesizes and extends the author's prior publications on sidereal filtering, scrambling dynamics, and the QKD Eve Detector framework, connecting them into a unified cryptographic paradigm.
The Poincaré recurrence theorem shows that conservative systems in a bounded region of phase space eventually return arbitrarily close to their initial state after a finite amount of time. An analogous behavior occurs in certain quantum systems where quantum states can recur after sufficiently long unitary evolution, a phenomenon known as quantum recurrence. Periodically driven (i.e. Floquet) quantum systems in particular exhibit complex dynamics even in small dimensions, motivating the study of how interactions and Hamiltonian structure affect recurrence behavior. While most studies treat recurrence in an approximate, distance-based sense, here we address the problem of {exact}, state-independent recurrences in a broad class of finite-dimensional Floquet systems, spanning both integrable and non-integrable models. Leveraging techniques from algebraic field theory, we construct an arithmetic framework that identifies all possible recurrence times by analyzing the cyclotomic structure of the Floquet unitary's spectrum. This computationally tractable approach yields both positive results, enumerating all candidate recurrence times, and definitive negative results, rigorously ruling out candidate recurrence times for a given set of Hamiltonian parameters. We further prove that rational Hamiltonian parameters do not, in general, guarantee exact recurrences, revealing a subtle interplay between system parameters and long-time dynamics. Our findings sharpen the theoretical understanding of quantum recurrences, clarify their relationship to quantum chaos, and highlight parameter regimes of special interest for quantum metrology and control.
The delocalization or scrambling of quantum information has emerged as a central ingredient in the understanding of thermalization in isolated quantum many-body systems. Recently, significant progress has been made analytically by modeling non-integrable systems as periodically driven systems, lacking a Hamiltonian picture, while honest Hamiltonian dynamics are frequently limited to small system sizes due to computational constraints. In this paper, we address this by investigating the role of conservation laws (including energy conservation) in the thermalization process from an information-theoretic perspective. For general non-integrable models, we use the equilibrium approximation to show that the maximal amount of information is scrambled (as measured by the tripartite mutual information of the time-evolution operator) at late times even when a system conserves energy. In contrast, we explicate how when a system has additional symmetries that lead to degeneracies in the spectrum, the amount of information scrambled must decrease. This general theory is exemplified in case studies of holographic conformal field theories (CFTs) and the Sachdev-Ye-Kitaev (SYK) model. Due to the large Virasoro symmetry in 1+1D CFTs, we argue that, in a sense, these holographic theories are not maximally chaotic, which is explicitly seen by the non-saturation of the second Rényi tripartite mutual information. The roles of particle-hole and U(1) symmetries in the SYK model are milder due to the degeneracies being only two-fold, which we confirm explicitly at both large- and small-N. We reinterpret the operator entanglement in terms of the growth of local operators, connecting our results with the information scrambling described by out-of-time-ordered correlators, identifying the mechanism for suppressed scrambling from the Heisenberg perspective.
We investigate the integrability-to-chaos transition and information scrambling in Ising spin networks via a graph-theoretic formulation. Modeling spins as vertices and interactions as edges encoded by adjacency matrices across path, Erdos-Renyi, and Watts-Strogatz topologies, we demonstrate that long-range couplings and heterogeneous degree distributions markedly accelerate quantum information propagation. The Hamiltonian comprises local and normalized non-local interactions; tuning the non-local coupling and field heterogeneity drives integrability breaking. To quantify scrambling, we employ bipartite mutual and tripartite information. Increasing non-local interactions drives tripartite information to large negative values, signaling deep information scrambling. The squared commutators constructed from out-of-time-order correlators (OTOCs) exhibit early-time exponential growth; equivalently, the OTOC four-point functions themselves decay exponentially, yielding quantum Lyapunov exponents that scale systematically with parameters governing the chaotic regime. Complementing this, Krylov complexity reveals rapid operator growth in the chaotic phase, synchronizing with OTOC and mutual information dynamics. Spectrally, the transition manifests as a shift from Poissonian to Wigner-Dyson level spacing statistics. The spectral form factor (SFF) exhibits the characteristic slope-dip-ramp-plateau structure, enabling the extraction of Thouless and Heisenberg times. Crucially, a reduced Thouless time strongly correlates with accelerated information and operator scrambling. Ultimately, this work establishes a unified framework bridging network topology with information-theoretic, operator, and spectral diagnostics, offering insights into thermalization and non-equilibrium dynamics in quantum many-body systems.
A bstract Heisenberg time evolution under a chaotic many-body Hamiltonian H transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or ‘K-complexity’, quantifies this growth with respect to a special basis, generated by H by successive nested commutators with the operator. In this work we study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time t s > log( S ). We prove rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, we undertake a detailed numerical study of these quantities in the SYK 4 model, which is maximally chaotic, and compare the results with the SYK 2 model, which is integrable. While the former saturates the bound, the latter stays exponentially below it. We discuss to what extent this is a generic feature distinguishing between chaotic vs. integrable systems.
Investigating the scrambling of quantum information (also known as quantum chaos) in many-body quantum systems provides valuable insights into the postquench evolution of a system. While various methods are available to understand the chaotic dynamics of these quantum systems, scrambling of mutual information following a quench has recently also emerged as a diagnostic of chaotic dynamics. In this work, we consider a chain of spin-1/2 particles of a finite length L evolving with the mixed-field Ising Hamiltonian and impose open boundary conditions. We simulate the time evolution of entanglement entropy and mutual information following a quench from the N\'eel state in this system using tensor networks and find that the entanglement entropy for nonintegrable systems saturates to a constant value at late times, while it continues to oscillate for integrable systems. We also find that mutual information peaks as a function of distance between intervals decay faster for nonintegrable systems compared to integrable systems, in agreement with the results in literature for XXZ chains. We compare the oscillations in entanglement entropy evolution obtained from simulations in the integrable case with analytic results from the quasiparticle picture and find agreement.