Subleading Bounds on Chaos

• URL: http://arxiv.org/abs/2109.03826v2
• Date: Thu, 30 Dec 2021 22:06:19 GMT
• Title: Subleading Bounds on Chaos
• Authors: Sandipan Kundu
• Abstract summary: Chaos can be diagnosed by certain out-of-time-order correlators (OTOCs) that obey the chaos bound of Maldacena, Shenker, and Stanford (MSS)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Chaos, in quantum systems, can be diagnosed by certain out-of-time-order correlators (OTOCs) that obey the chaos bound of Maldacena, Shenker, and Stanford (MSS). We begin by deriving a dispersion relation for this class of OTOCs, implying that they must satisfy many more constraints beyond the MSS bound. Motivated by this observation, we perform a systematic analysis obtaining an infinite set of constraints on the OTOC. This infinite set includes the MSS bound as the leading constraint. In addition, it also contains subleading bounds that are highly constraining, especially when the MSS bound is saturated by the leading term. These new bounds, among other things, imply that the MSS bound cannot be exactly saturated over any duration of time, however short. Furthermore, we derive a sharp bound on the Lyapunov exponent $\lambda_2 \le \frac{6\pi}{\beta}$ of the subleading correction to maximal chaos.

Related papers

• Tighter Lower Bounds on Quantum Annealing Times [0.0]
  We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. The bounds are computable without knowledge of the annealer's dynamics and, in certain cases, scale with the size of the system.
  arXiv  Detail & Related papers  (2024-10-18T18:00:07Z)
• Lower Bounds for Learning in Revealing POMDPs [88.23337313766355]
  This paper studies the fundamental limits of reinforcement learning (RL) in the challenging emphpartially observable setting. For emphmulti-step revealing POMDPs, we show that the latent state-space dependence is at least $Omega(S1.5)$ in the sample complexity.
  arXiv  Detail & Related papers  (2023-02-02T18:59:30Z)
• Approximation of optimization problems with constraints through kernel Sum-Of-Squares [77.27820145069515]
  We show that pointwise inequalities are turned into equalities within a class of nonnegative kSoS functions. We also show that focusing on pointwise equality constraints enables the use of scattering inequalities to mitigate the curse of dimensionality in sampling the constraints.
  arXiv  Detail & Related papers  (2023-01-16T10:30:04Z)
• Instantons and the quantum bound to chaos [0.0]
  A remarkable prediction is that the associated Lyapunov exponent obeys a universal bound $lambda 2 pi k_B T/hbar$. We investigate the statistical origin of the bound by applying ring-polymer molecular dynamics to a classically chaotic double well.
  arXiv  Detail & Related papers  (2022-12-20T12:30:10Z)
• Role of boundary conditions in the full counting statistics of topological defects after crossing a continuous phase transition [62.997667081978825]
  We analyze the role of boundary conditions in the statistics of topological defects. We show that for fast and moderate quenches, the cumulants of the kink number distribution present a universal scaling with the quench rate.
  arXiv  Detail & Related papers  (2022-07-08T09:55:05Z)
• Emergence of Fermi's Golden Rule [55.73970798291771]
  Fermi's Golden Rule (FGR) applies in the limit where an initial quantum state is weakly coupled to a continuum of other final states overlapping its energy. Here we investigate what happens away from this limit, where the set of final states is discrete, with a nonzero mean level spacing.
  arXiv  Detail & Related papers  (2022-06-01T18:35:21Z)
• Analyticity constraints bound the decay of the spectral form factor [0.0]
  Quantum chaos cannot develop faster than $lambda leq 2 pi/(hbar beta)$ for systems in thermal equilibrium. We show that similar constraints also bound the decay of the spectral form factor (SFF) The relation of the derived bound with other known bounds, including quantum speed limits, is discussed.
  arXiv  Detail & Related papers  (2022-02-23T19:00:00Z)
• Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
  A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438]. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel. This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
  arXiv  Detail & Related papers  (2022-01-23T13:05:36Z)
• Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspective [49.17352150219212]
  Federated AveragingFedAvg, also known as Local SGD, is one of the most popular algorithms in Federated Learning (FL) We show how to analyze this quantity from the Differential Equation (SDE) perspective.
  arXiv  Detail & Related papers  (2021-11-05T22:16:11Z)
• Extremal Chaos [0.0]
  In maximally chaotic quantum systems, a class of out-of-time-order correlators (OTOCs) saturate the Maldacena-Shenker-Stanford (MSS) bound on chaos. We find a unique analytic extension of the maximally chaotic OTOC that saturates all the subleading chaos bounds which allow saturation.
  arXiv  Detail & Related papers  (2021-09-17T18:00:02Z)
• Metrizing Weak Convergence with Maximum Mean Discrepancies [88.54422104669078]
  This paper characterizes the maximum mean discrepancies (MMD) that metrize the weak convergence of probability measures for a wide class of kernels. We prove that, on a locally compact, non-compact, Hausdorff space, the MMD of a bounded continuous Borel measurable kernel k, metrizes the weak convergence of probability measures if and only if k is continuous.
  arXiv  Detail & Related papers  (2020-06-16T15:49:33Z)

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.