Papers
Topics
Authors
Recent
Search
2000 character limit reached

Temporal Complexity Hierarchies in Solvable Quantum Many-Body Dynamics

Published 24 Oct 2025 in quant-ph, cond-mat.stat-mech, and nlin.SI | (2510.21927v1)

Abstract: The influence matrix (IM) provides a powerful framework for characterizing nonequilibrium quantum many-body dynamics by encoding multitime correlations into tensor-network states. Understanding how its computational complexity relates to underlying dynamics is crucial for both theoretical insight and practical utility, yet remains largely unexplored despite a few case studies. Here, we address this question for a family of brickwork quantum circuits ranging from integrable to chaotic regimes. Using tools from geometric group theory, we identify three qualitatively distinct scalings of temporal entanglement entropy, establishing a hierarchy of computational resources required for accurate tensor-network representations of the IM for these models. We further analyze the memory structure of the IM and distinguish between classical and quantum temporal correlations. In particular, for certain examples, we identify effectively classical IMs that admit an efficient Monte Carlo algorithm for computing multitime correlations. In more generic settings without an explicit classical description of the IM, we introduce an operational measure of quantum memory with an experimental protocol, and discuss examples exhibiting long-time genuinely quantum correlations. Our results establish a new connection between quantum many-body dynamics and group theory, providing fresh insights into the complexity of the IM and its intricate connection to the physical characteristics of the dynamics.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.