Real-time correlators in chaotic quantum many-body systems

• URL: http://arxiv.org/abs/2205.11544v1
• Date: Mon, 23 May 2022 18:00:13 GMT
• Title: Real-time correlators in chaotic quantum many-body systems
• Authors: Adam Nahum, Sthitadhi Roy, Sagar Vijay, and Tianci Zhou
• Abstract summary: We study real-time local correlators $langlemathcalO(mathbfx,t)mathcalO(0,0)rangle$ in chaotic quantum many-body systems. These correlators show universal structure at late times, determined by the dominant operator-space Feynman trajectories.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study real-time local correlators $\langle\mathcal{O}(\mathbf{x},t)\mathcal{O}(0,0)\rangle$ in chaotic quantum many-body systems. These correlators show universal structure at late times, determined by the dominant operator-space Feynman trajectories for the evolving operator $\mathcal{O}(\mathbf{x},t)$. The relevant trajectories involve the operator contracting to a point at both the initial and final time and so are structurally different from those dominating the out-of-time-order correlator. In the absence of conservation laws, correlations decay exponentially: $\langle\mathcal{O}(\mathbf{x},t)\mathcal{O}(0,0)\rangle\sim\exp(-s_\mathrm{eq} r(\mathbf{v}) t)$, where $\mathbf{v}= \mathbf{x}/ t$ defines a spacetime ray, and $r(\mathbf{v})$ is an associated decay rate. We express $r(\mathbf{v})$ in terms of cost functions for various spacetime structures. In 1+1D, operator histories can show a phase transition at a critical ray velocity $v_c$, where $r(\mathbf{v})$ is nonanalytic. At low $v$, the dominant Feynman histories are "fat": the operator grows to a size of order $t^\alpha\gg 1$ before contracting to a point again. At high $v$ the trajectories are "thin": the operator always remains of order-one size. In a Haar-random unitary circuit, this transition maps to a simple binding transition for a pair of random walks (the two spatial boundaries of the operator). In higher dimensions, thin trajectories always dominate. We discuss ways to extract the butterfly velocity $v_B$ from the time-ordered correlator, rather than the OTOC. Correlators in the random circuit may alternatively be computed with an effective Ising-like model: a special feature of the Ising weights for the Haar brickwork circuit gives $v_c=v_B$. This work addresses lattice models, but also suggests the possibility of morphological phase transitions for real-time Feynman diagrams in quantum field theories.

Related papers

• Characteristic time operators as quantum clocks [0.0]
  We show that $mathsfT$ satisfies the canonical relation $[mathsfT,mathsfH]|psirangle=ihbar|psirangle$ in a dense subspace of the Hilbert space. One can construct a quantum clock that tells the time in the neighborhood of $mathscrT$ by measuring a compatible observable.
  arXiv  Detail & Related papers  (2024-09-05T09:10:38Z)
• 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)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• 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)
• Statistical Learning under Heterogeneous Distribution Shift [71.8393170225794]
  Ground-truth predictor is additive $mathbbE[mathbfz mid mathbfx,mathbfy] = f_star(mathbfx) +g_star(mathbfy)$.
  arXiv  Detail & Related papers  (2023-02-27T16:34:21Z)
• Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds [0.0]
  We study the almost sure uniform convergence of this operator to the diffusive Laplace-Beltrami operator when $n$ tends to infinity. This work extends known results of the past 15 years.
  arXiv  Detail & Related papers  (2022-12-20T14:31:06Z)
• Monogamy of entanglement between cones [68.8204255655161]
  We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones. Our proof makes use of a new characterization of products of simplices up to affine equivalence.
  arXiv  Detail & Related papers  (2022-06-23T16:23:59Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• How many moments does MMD compare? [7.919213739992465]
  mathcalF-1$ acts on smooth functions in the same way as an integral operator associated with $K$. We show that kernels defined by pseudo-differential operators are able to approximate uniformly any continuous Mercer kernel on a compact set.
  arXiv  Detail & Related papers  (2021-06-27T16:44:17Z)
• Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
  Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector. We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
  arXiv  Detail & Related papers  (2020-06-12T10:21:40Z)
• Data-driven Efficient Solvers for Langevin Dynamics on Manifold in High Dimensions [12.005576001523515]
  We study the Langevin dynamics of a physical system with manifold structure $mathcalMsubsetmathbbRp$ We leverage the corresponding Fokker-Planck equation on the manifold $mathcalN$ in terms of the reaction coordinates $mathsfy$. We propose an implementable, unconditionally stable, data-driven finite volume scheme for this Fokker-Planck equation.
  arXiv  Detail & Related papers  (2020-05-22T16:55:38Z)

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.