Krylov Complexity in Calabi-Yau Quantum Mechanics
- URL: http://arxiv.org/abs/2212.02926v2
- Date: Wed, 26 Apr 2023 14:16:26 GMT
- Title: Krylov Complexity in Calabi-Yau Quantum Mechanics
- Authors: Bao-ning Du, Min-xin Huang
- Abstract summary: We study Krylov complexity in quantum mechanical systems derived from some well-known local toric Calabi-Yau geometries.
We find that for the Calabi-Yau models, the Lanczos coefficients grow slower than linearly for small $n$'s, consistent with the behavior of integrable models.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recently, a novel measure for the complexity of operator growth is proposed
based on Lanczos algorithm and Krylov recursion method. We study this Krylov
complexity in quantum mechanical systems derived from some well-known local
toric Calabi-Yau geometries, as well as some non-relativistic models. We find
that for the Calabi-Yau models, the Lanczos coefficients grow slower than
linearly for small $n$'s, consistent with the behavior of integrable models. On
the other hand, for the non-relativistic models, the Lanczos coefficients
initially grow linearly for small $n$'s, then reach a plateau. Although this
looks like the behavior of a chaotic system, it is mostly likely due to
saddle-dominated scrambling effects instead, as argued in the literature. In
our cases, the slopes of linearly growing Lanczos coefficients almost saturate
a bound by the temperature. During our study, we also provide an alternative
general derivation of the bound for the slope.
Related papers
- von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
We explore a family of expressive and interpretable distributions over circle-valued random functions.
The resulting probability model has connections with continuous spin models in statistical physics.
For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
arXiv Detail & Related papers (2024-06-19T01:57:21Z) - KPZ scaling from the Krylov space [83.88591755871734]
Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported.
Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
arXiv Detail & Related papers (2024-06-04T20:57:59Z) - Operator dynamics in Lindbladian SYK: a Krylov complexity perspective [0.0]
We analytically establish the linear growth of two sets of coefficients for any generic jump operators.
We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically.
arXiv Detail & Related papers (2023-11-01T18:00:06Z) - Operator growth and Krylov Complexity in Bose-Hubbard Model [0.25602836891933073]
We study Krylov complexity of a one-dimensional Bosonic system, the celebrated Bose-Hubbard Model.
We use the Lanczos algorithm to find the Lanczos coefficients and the Krylov basis.
Our results capture the chaotic and integrable nature of the system.
arXiv Detail & Related papers (2023-06-08T20:24:03Z) - Krylov complexity in inverted harmonic oscillator [0.0]
Recently, the out-of-time-ordered correlator(OTOC) and Krylov complexity have been studied actively as a measure of operator growth.
In some non-chaotic systems, it was observed that OTOC shows chaotic behavior and cannot distinguish saddle-dominated scrambling from chaotic systems.
arXiv Detail & Related papers (2022-10-13T07:57:34Z) - Numerically Probing the Universal Operator Growth Hypothesis [0.0]
We numerically test this hypothesis for a variety of exemplary systems.
The onset of the hypothesized universal behavior could not be observed in the attainable numerical data for the Heisenberg model.
arXiv Detail & Related papers (2022-03-01T15:15:47Z) - Decimation technique for open quantum systems: a case study with
driven-dissipative bosonic chains [62.997667081978825]
Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics.
We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function.
We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
arXiv Detail & Related papers (2022-02-15T19:00:09Z) - Krylov complexity of many-body localization: Operator localization in
Krylov basis [0.0]
We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos perspective.
Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi-infinite chain.
Our numerical results suggest that the emergent single-particle hopping problem in the MBL system is localized when on the first site.
arXiv Detail & Related papers (2021-12-09T06:50:19Z) - Measuring Model Complexity of Neural Networks with Curve Activation
Functions [100.98319505253797]
We propose the linear approximation neural network (LANN) to approximate a given deep model with curve activation function.
We experimentally explore the training process of neural networks and detect overfitting.
We find that the $L1$ and $L2$ regularizations suppress the increase of model complexity.
arXiv Detail & Related papers (2020-06-16T07:38:06Z) - Kernel and Rich Regimes in Overparametrized Models [69.40899443842443]
We show that gradient descent on overparametrized multilayer networks can induce rich implicit biases that are not RKHS norms.
We also demonstrate this transition empirically for more complex matrix factorization models and multilayer non-linear networks.
arXiv Detail & Related papers (2020-02-20T15:43:02Z) - From stochastic spin chains to quantum Kardar-Parisi-Zhang dynamics [68.8204255655161]
We introduce the asymmetric extension of the Quantum Symmetric Simple Exclusion Process.
We show that the time-integrated current of fermions defines a height field which exhibits a quantum non-linear dynamics.
arXiv Detail & Related papers (2020-01-13T14:30:36Z)
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.