Dynamics of many-body localized systems: logarithmic lightcones and $\log \, t$-law of $α$-Rényi entropies

• URL: http://arxiv.org/abs/2408.02016v1
• Date: Sun, 4 Aug 2024 12:53:55 GMT
• Title: Dynamics of many-body localized systems: logarithmic lightcones and $\log \, t$-law of $α$-Rényi entropies
• Authors: Daniele Toniolo, Sougato Bose,
• Abstract summary: We evaluate the dynamical generation of $ alpha$-R'enyi entropies, $ 0 alpha1 $ close to one, obtaining a $log, t$-law. We show that the dynamical generation of the von Neumann entropy, from a generic initial product state, has for large times a $ log, t$-shape.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the context of the Many-Body-Localization phenomenology we consider arbitrarily large one-dimensional spin systems. The XXZ model with disorder is a prototypical example. Without assuming the existence of exponentially localized integrals of motion (LIOMs), but assuming instead a logarithmic lightcone we rigorously evaluate the dynamical generation of $ \alpha$-R\'enyi entropies, $ 0< \alpha<1 $ close to one, obtaining a $\log \, t$-law. Assuming the existence of LIOMs we prove that the Lieb-Robinson (L-R) bound of the system's dynamics has a logarithmic lightcone and show that the dynamical generation of the von Neumann entropy, from a generic initial product state, has for large times a $ \log \, t$-shape. L-R bounds, that quantify the dynamical spreading of local operators, may be easier to measure in experiments in comparison to global quantities such as entanglement.

Related papers

• The dynamical $α$-Rényi entropies of local Hamiltonians grow at most linearly in time [0.0]
  We consider a generic one dimensional spin system of length $ L $, arbitrarily large, with strictly local interactions. We prove that the dynamical $ alpha $-R'enyi entropies, $ 0 alpha 1 $, of an initial product state grow at most linearly in time.
  arXiv  Detail & Related papers  (2024-08-01T17:45:12Z)
• Quantum Detection of Recurrent Dynamics [0.0]
  We describe simple quantum algorithms to detect such approximate recurrence. Hidden tensor structures have been observed to emerge both in a high energy context of operator-level spontaneous symmetry breaking. We collect some observations on the computational difficulty of locating these structures and detecting related spectral information.
  arXiv  Detail & Related papers  (2024-07-22T21:13:45Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Theory of free fermions under random projective measurements [43.04146484262759]
  We develop an analytical approach to the study of one-dimensional free fermions subject to random projective measurements of local site occupation numbers. We derive a non-linear sigma model (NLSM) as an effective field theory of the problem.
  arXiv  Detail & Related papers  (2023-04-06T15:19:33Z)
• Fast Rates for Maximum Entropy Exploration [52.946307632704645]
  We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. We study the maximum entropy exploration problem two different types. For visitation entropy, we propose a game-theoretic algorithm that has $widetildemathcalO(H3S2A/varepsilon2)$ sample complexity. For the trajectory entropy, we propose a simple algorithm that has a sample of complexity of order $widetildemathcalO(mathrmpoly(S,
  arXiv  Detail & Related papers  (2023-03-14T16:51:14Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes [62.90204655228324]
  We study regret minimization for reinforcement learning (RL) in Latent Markov Decision Processes (LMDPs) with context in hindsight. We design a novel model-based algorithmic framework which can be instantiated with both a model-optimistic and a value-optimistic solver.
  arXiv  Detail & Related papers  (2022-10-20T21:32:01Z)
• Single Trajectory Nonparametric Learning of Nonlinear Dynamics [8.438421942654292]
  Given a single trajectory of a dynamical system, we analyze the performance of the nonparametric least squares estimator (LSE) We leverage recently developed information-theoretic methods to establish the optimality of the LSE for non hypotheses classes. We specialize our results to a number of scenarios of practical interest, such as Lipschitz dynamics, generalized linear models, and dynamics described by functions in certain classes of Reproducing Kernel Hilbert Spaces (RKHS)
  arXiv  Detail & Related papers  (2022-02-16T19:38:54Z)
• Markovian Repeated Interaction Quantum Systems [0.0]
  We study a class of dynamical semigroups $(mathbbLn)_ninmathbbN$ that emerge, by a Feynman--Kac type formalism, from a random quantum dynamical system. As a physical application, we consider the case where the $mathcalL_omega$'s are the reduced dynamical maps describing the repeated interactions of a system with thermal probes.
  arXiv  Detail & Related papers  (2022-02-10T20:52:40Z)
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs [132.88757893161699]
  We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps. DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
  arXiv  Detail & Related papers  (2020-12-29T14:06:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.