arXiv:2610.16351
Finite-time quantum equilibration from local correlations
Piotr Ćwikliński
Abstract
An isolated quantum system evolves reversibly, yet a small subsystem can lose nearly all information about its initial state. Conserved quantities may retain some of this information, depending on how strongly they overlap with local observables. Here we consider a subsystem in an arbitrary initial state coupled to a maximally mixed bath. We show that the worst-input mean-square equilibration error, maximised over window origins, is bounded from above and below by the mean square of a complete local autocorrelation, with the stationary part subtracted. The two mean-square quantities are linearly comparable. A correlation record over a finite interval therefore controls the equilibration error in every interval of the same length, and the result extends to nonnegative observation weights with nonnegative Fourier transform. The result allows arbitrary degeneracies of energies and gaps. We apply it to two static Hamiltonian families. For fixed spin subsystems in the one-particle sector of a bounded-range periodic clock, fixed-accuracy thermalisation is guaranteed on windows that grow only slightly faster than linearly with system size, despite exponentially small positive energies. A random commuting model with logarithmic interaction range retains an extensive set of conserved observables. Its expected mean-square error is bounded by a finite-size term and an inverse-time term. The inverse-time dependence is unavoidable because of the initial transient. These examples show how local relaxation can coexist with exact conservation laws and a finely spaced spectrum.
AI Summary
The paper asks when finite-time local autocorrelations certify loss of information about an arbitrary subsystem preparation. It considers a fixed-dimensional subsystem $S$ initially uncorrelated with a maximally mixed bath, evolving under an arbitrary finite-dimensional, time-independent Hamiltonian. The central quantity is the autocorrelation averaged over a complete traceless local operator basis. If $A_S(T)$ is its stationary-subtracted mean square on $[0,T]$, the worst-input squared trace-distance error relative to the temporal reduced state, averaged over a window and maximised over window origins, satisfies $\frac{d-1}{2d}A_S(T)\le G_H(T)\le(d-1)(d^2-1)^2A_S(T)$. The input supremum is inside the integral, and the upper bound applies to every translated window. Analogous bounds cover thermalisation to the maximally mixed state and reference-assisted channel distinguishability. The proof combines positivity of Liouvillian spectral projectors compressed to the complete local operator space with positive-Fourier observation weights and channel-norm estimates; arbitrary energy and gap degeneracies are allowed. Two applications give explicit scales. A bounded-range periodic clock, restricted to its one-particle sector, thermalises fixed spin subsystems on $O(n\log n)$ fixed-accuracy windows despite an inverse smallest positive energy of $\Theta(n^2 4^n)$. A random commuting model with logarithmic interaction range has expected error $O_S(N^{-b}+T^{-1})$; the inverse-window term is unavoidable because the criterion includes the initial transient. The results require fixed subsystem size and the specified infinite-temperature preparation. They control fractions of bad times, not pointwise relaxation. Finite-temperature baths and general constant-range noncommuting dynamics remain untreated; perturbation guarantees require small global operator norm.
ChatGPT (OpenAI) assisted with proof-checking derivations, preparing consistency scripts, and editing the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- comments welcome; 13 pages main plus supplementary, 2 figures, v2: substantially rewritten version with new results