Optimal low-rank compression of quantum dynamics
quant-ph, cond-mat.dis-nn, cond-mat.stat-mech, math-ph, math.MP
Submitted: 2026-09-23
Updated: 2026-09-23
Comments: 14 pages, 4 figures; 134 pages of Supplementary Material
License: http://creativecommons.org/licenses/by/4.0/
The gist: Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate.
Terminology
Abstract
Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate. Bounds on propagation and entanglement growth, together with tensor networks, exploit these restrictions to discard information unnecessary for describing the evolution. This leads to a sharper question: how much information must any low-rank representation retain? Here we determine these limits, up to logarithmic factors, for short-range interactions. For time-independent evolution, the optimal rank obeys D= O(t+ sqrt (1/ε)), with matching lower bounds fixing the accuracy exponent 1/2; for arbitrary driving, matching fixed-time bounds instead give 2/3. Correspondingly, the corresponding dynamical entanglement spectra exhibit distinct small- α Rényi laws, α-1 and α-2. In one dimension, the static limit is constructively attained by an explicit MPO algorithm, with an analogous extension to Liouvillian dynamics. Together, these results determine the irreducible information required to represent local quantum evolution and uncover distinct entanglement structures in static and driven dynamics.
Sources
- Query-optimal quantum simulation of Lindblad evolution
- Spectral Small-Incremental-Entangling: Breaking Quasi-Polynomial Complexity Barriers in Long-Range Interacting Systems
- Time Independence Does Not Limit Information Flow. II. The Case with Ancillas
- Hamiltonian Simulation in the Interaction Picture
- Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
- An area law and sub-exponential algorithm for 1D systems
- A CS guide to the quantum singular value transformation
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians