Sparsity independent Lyapunov exponent in the Sachdev-Ye-Kitaev model

• URL: http://arxiv.org/abs/2311.00639v1
• Date: Wed, 1 Nov 2023 16:38:34 GMT
• Title: Sparsity independent Lyapunov exponent in the Sachdev-Ye-Kitaev model
• Authors: Antonio M. Garc\'ia-Garc\'ia, Chang Liu, Jacobus J. M. Verbaarschot
• Abstract summary: The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. We find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. A key ingredient to reaching $N = 64$ is the development of a novel quantum spin model simulation library.
• Score: 3.348749049589415
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. This saturation occurs in the low temperature limit of the dense Sachdev-Ye-Kitaev (SYK) model, $N$ Majorana fermions with $q$-body ($q>2$) infinite-range interactions. We calculate certain Out of Time Order Correlators (OTOC) for $N\le 64$ fermions for a highly sparse SYK model and find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. This suggests that in the sparse case, the Lyapunov exponent also saturates the low-temperature bound. A key ingredient to reaching $N = 64$ is the development of a novel quantum spin model simulation library that implements highly-optimized matrix-free Krylov subspace methods on Graphical Processing Units (GPUs). This leads to a significantly lower simulation time as well as vastly reduced memory usage over previous approaches, while using modest computational resources. Strong sparsity-driven statistical fluctuations require both the use of a vastly larger number of disorder realizations with respect to the dense limit and a careful finite size scaling analysis. Our results potentially broadens the landscape of theories that may have a gravity analogue.

Related papers

• Fast Scrambling at the Boundary [3.4284444670464675]
  Many-body systems which saturate the quantum bound on chaos are attracting interest across a wide range of fields. We study many-body quantum chaos in a quantum impurity model showing Non-Fermi-Liquid physics. Our results highlights two new features: a non-disordered model which is maximally chaotic due to strong correlations at its boundary and a fractionalization of quantum chaos.
  arXiv  Detail & Related papers  (2024-07-18T15:55:44Z)
• Randomly Pruning the Sachdev-Ye-Kitaev model [0.0]
  The Sachdev-Ye-Kitaev model (SYK) is renowned for its short-time chaotic behavior. The Thouless energy, representing the energy scale at which the universal chaotic behavior in the energy spectrum ceases, can be determined from the spectrum itself.
  arXiv  Detail & Related papers  (2024-01-14T16:20:16Z)
• 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)
• Gauge Theory Couplings on Anisotropic Lattices [7.483799520082159]
  We derive perturbative relations between bare and renormalized quantities in Euclidean spacetime at any anisotropy factor. We find less than $10%$ discrepancy between our perturbative results and those from existing nonperturbative determinations of the anisotropy.
  arXiv  Detail & Related papers  (2022-08-22T15:56:53Z)
• KL-Entropy-Regularized RL with a Generative Model is Minimax Optimal [70.15267479220691]
  We consider and analyze the sample complexity of model reinforcement learning with a generative variance-free model. Our analysis shows that it is nearly minimax-optimal for finding an $varepsilon$-optimal policy when $varepsilon$ is sufficiently small.
  arXiv  Detail & Related papers  (2022-05-27T19:39:24Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Nystr\"om Kernel Mean Embeddings [92.10208929236826]
  We propose an efficient approximation procedure based on the Nystr"om method. It yields sufficient conditions on the subsample size to obtain the standard $n-1/2$ rate. We discuss applications of this result for the approximation of the maximum mean discrepancy and quadrature rules.
  arXiv  Detail & Related papers  (2022-01-31T08:26:06Z)
• Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning [52.76230802067506]
  A novel model-free algorithm is proposed to minimize regret in episodic reinforcement learning. The proposed algorithm employs an em early-settled reference update rule, with the aid of two Q-learning sequences. The design principle of our early-settled variance reduction method might be of independent interest to other RL settings.
  arXiv  Detail & Related papers  (2021-10-09T21:13:48Z)
• A Sparse Model of Quantum Holography [0.0]
  We study a sparse version of the Sachdev-Ye-Kitaev (SYK) model defined on random hypergraphs constructed either by a random pruning procedure or by randomly sampling regular hypergraphs. We argue that this sparse SYK model recovers the interesting global physics of ordinary SYK even when $k$ is of order unity. Our argument proceeds by constructing a path integral for the sparse model which reproduces the conventional SYK path integral plus gapped fluctuations.
  arXiv  Detail & Related papers  (2020-08-05T18:21:42Z)
• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model [50.38446482252857]
  This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator) We first consider $gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space $mathcalS$ and action space $mathcalA$. We prove that a plain model-based planning algorithm suffices to achieve minimax-optimal sample complexity given any target accuracy level.
  arXiv  Detail & Related papers  (2020-05-26T17:53:18Z)
• Many-Body Chaos in the Sachdev-Ye-Kitaev Model [0.0]
  Many-body chaos is a powerful framework for understanding thermalization in strongly interacting quantum systems. We develop a novel finite-size rescaling procedure for analyzing the growth of out-of-time-order correlators. We verify that this procedure accurately determines the Lyapunov exponent, $lambda$, across a wide range in temperatures.
  arXiv  Detail & Related papers  (2020-02-13T19:00:00Z)

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.