arXiv:2609.26885
Sustained growth of quantum circuit complexity in many-body Hamiltonian dynamics
Wonjun Lee, Saúl Pilatowsky-Cameo, Soonwon Choi
Abstract
The quantum circuit complexity of an evolving many-body quantum system is believed to exhibit a sustained growth, maintained for timescales much longer than the onset of thermalization. Most previous works have focused on models which violate energy conservation, such as random unitary circuits. Here we study generic, local time-independent Hamiltonian dynamics. We unconditionally prove that for generic local Hamiltonians and typical initial product states at high effective temperature, the robust quantum circuit complexity must grow over a very long period of time, attaining an exponentially large value at late times. Our approach relies on two structural properties that we prove rigorously: (i) generic local Hamiltonians satisfy generalized spectral no-resonance conditions of arbitrary order, and (ii) typical high-temperature product states are effectively supported in exponentially many energy eigenstates. These properties have been widely assumed without proof in prior works. As corollaries of this result, we show the late-time state displays robust volume-law entanglement that is irremovable by polynomial-size circuits, and we establish a no fast-forwarding result for generic local Hamiltonians. We also lower bound the complexity of preparing sufficiently large subsystems with local quantum channels, in contrast with sufficiently small thermalizing regions which we show retain low complexity at late times.
AI Summary
The paper asks whether time-independent, energy-conserving local Hamiltonians generate states of exponentially large circuit complexity from simple initial states, beyond thermalization. Complexity counts two-qubit channels, allowing unentangled ancillas and trace-distance error $\varepsilon$. For generic local extensive Hamiltonians, and all but an exponentially small fraction of random product states at infinite or sufficiently high finite temperature, it proves $\mathcal C_\varepsilon(\psi_A(t))\geq\exp(\Omega(n))$ for all but a double-exponentially small fraction of times. The statement applies to sufficiently large subsystems $|A|\geq cn$, with a model-dependent constant $c<1$, and even to errors exponentially close to one. Time fractions are defined by infinite-time averages. The proof combines circuit-covering counts with double-exponential temporal delocalization. Two ingredients establish the latter: generic local Hamiltonians obey spectral no-resonance conditions at every integer order, and typical high-temperature product states have exponentially large effective dimension in the energy basis. Consequences include generic impossibility of polynomial-gate fast-forwarding, late-time volume-law entanglement resistant to low-complexity disentangling, and conditional quasipolynomial preparation complexity for small thermalizing regions. The growth claim is weaker than linear or monotonic growth: error-averaged complexity has exponentially many separated increases before reaching exponential size. No controlled exponential-time saturation bound is established. The finite-time estimate depends on inverse high-order spectral gaps, for which rigorous generic lower bounds are unavailable; a heuristic yields double-exponential times. Extensions to symmetry-constrained systems, fermions and field theories remain open.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 9 pages, 3 figures; 36 pages (supplemental material). v2: corrected figures and typos