Statistical features of quantum chaos using the Krylov operator complexity

• URL: http://arxiv.org/abs/2411.18436v3
• Date: Wed, 19 Mar 2025 13:25:25 GMT
• Title: Statistical features of quantum chaos using the Krylov operator complexity
• Authors: Zhuoran Li, Wei Fan,
• Abstract summary: We study the statistical properties of Lanczos coefficients over an ensemble of random initial operators generating the Krylov space.<n>We propose two statistical quantities that are important in characterizing the complexity.<n>Their resulting statistics are the Wishart distribution and the (rescaled) chi-square distribution respectively.
• Score: 7.338134750636499
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the statistical properties of Lanczos coefficients over an ensemble of random initial operators generating the Krylov space. We propose two statistical quantities that are important in characterizing the complexity: the average correlation matrix $\langle x_{i} x_{j}\rangle$ of Lanczos coefficients and the resulting distribution of the variance of Lanczos coefficients. Their resulting statistics are the Wishart distribution and the (rescaled) chi-square distribution respectively, which are independent of the distributions of initial operators and become the normal distribution in the case of large matrix size. As a numerical example, we use the typical billiard system with an integrability-breaking term and choose samples of random initial operators from given probability distributions (GOE, GUE and the uniform distribution). It agrees with the phenomenological analysis and further interesting behaviors are obtained, which indicates a consistent connection between RMT, Anderson localization and Krylov complexity.

Related papers

• Statistics and Complexity of Wavefunction Spreading in Quantum Dynamical Systems [0.0]
  We consider the statistics of the results of a measurement of the spreading operator in the Krylov basis generated by the Hamiltonian of a quantum system. We show that the moments of this characteristic function are related to the so-called generalised spread complexities. We also obtain an upper bound in the change in generalised spread complexity at an arbitrary time in terms of the operator norm of the Hamiltonian.
  arXiv  Detail & Related papers  (2024-11-14T12:08:45Z)
• Statistical Inference in Classification of High-dimensional Gaussian Mixture [1.2354076490479515]
  We investigate the behavior of a general class of regularized convex classifiers in the high-dimensional limit. Our focus is on the generalization error and variable selection properties of the estimators.
  arXiv  Detail & Related papers  (2024-10-25T19:58:36Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework. We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points. Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Statistical and Geometrical properties of regularized Kernel Kullback-Leibler divergence [7.273481485032721]
  We study the statistical and geometrical properties of the Kullback-Leibler divergence with kernel covariance operators introduced by Bach [2022] Unlike the classical Kullback-Leibler (KL) divergence that involves density ratios, the KKL compares probability distributions through covariance operators (embeddings) in a reproducible kernel Hilbert space (RKHS) This novel divergence hence shares parallel but different aspects with both the standard Kullback-Leibler between probability distributions and kernel embeddings metrics such as the maximum mean discrepancy.
  arXiv  Detail & Related papers  (2024-08-29T14:01:30Z)
• Unveiling the Statistical Foundations of Chain-of-Thought Prompting Methods [59.779795063072655]
  Chain-of-Thought (CoT) prompting and its variants have gained popularity as effective methods for solving multi-step reasoning problems. We analyze CoT prompting from a statistical estimation perspective, providing a comprehensive characterization of its sample complexity.
  arXiv  Detail & Related papers  (2024-08-25T04:07:18Z)
• Relaxation Fluctuations of Correlation Functions: Spin and Random Matrix Models [0.0]
  We study the fluctuation average and variance of certain correlation functions as a diagnostic measure of quantum chaos. We identify the three distinct phases of the models: the ergodic, the fractal, and the localized phases.
  arXiv  Detail & Related papers  (2024-07-31T14:45:46Z)
• Identifiable Latent Neural Causal Models [82.14087963690561]
  Causal representation learning seeks to uncover latent, high-level causal representations from low-level observed data. We determine the types of distribution shifts that do contribute to the identifiability of causal representations. We translate our findings into a practical algorithm, allowing for the acquisition of reliable latent causal representations.
  arXiv  Detail & Related papers  (2024-03-23T04:13:55Z)
• Computational-Statistical Gaps in Gaussian Single-Index Models [77.1473134227844]
  Single-Index Models are high-dimensional regression problems with planted structure. We show that computationally efficient algorithms, both within the Statistical Query (SQ) and the Low-Degree Polynomial (LDP) framework, necessarily require $Omega(dkstar/2)$ samples.
  arXiv  Detail & Related papers  (2024-03-08T18:50:19Z)
• Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting [64.0722630873758]
  We consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Differential Equation. We prove the bound in $W_2$-distance between the laws of our Ito chain and differential equation.
  arXiv  Detail & Related papers  (2023-10-09T18:38:56Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach [1.4469725791865984]
  We characterise the learning of a mixture of two clouds of data points with generic centroids. We study the generalisation performance of the obtained estimator, we analyse the role of regularisation, and we analytically the separability transition.
  arXiv  Detail & Related papers  (2023-04-06T07:53:05Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Robust Estimation for Nonparametric Families via Generative Adversarial Networks [92.64483100338724]
  We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
  arXiv  Detail & Related papers  (2022-02-02T20:11:33Z)
• Fluctuations, Bias, Variance & Ensemble of Learners: Exact Asymptotics for Convex Losses in High-Dimension [25.711297863946193]
  We develop a theory for the study of fluctuations in an ensemble of generalised linear models trained on different, but correlated, features. We provide a complete description of the joint distribution of the empirical risk minimiser for generic convex loss and regularisation in the high-dimensional limit.
  arXiv  Detail & Related papers  (2022-01-31T17:44:58Z)
• Out-of-Time Ordered Correlators in Kicked Coupled Tops: Information Scrambling in Mixed Phase Space and the Role of Conserved Quantities [0.0]
  We study operator growth in a bipartite kicked coupled tops (KCT) system using out-of-time ordered correlators (OTOCs) OTOCs quantify information scrambling" due to chaotic dynamics and serve as a quantum analog of classical Lyapunov exponents.
  arXiv  Detail & Related papers  (2022-01-15T08:35:28Z)
• Signatures of Chaos in Non-integrable Models of Quantum Field Theory [0.0]
  We study signatures of quantum chaos in (1+1)D Quantum Field Theory (QFT) models. We focus on the double sine-Gordon, also studying the massive sine-Gordon and $phi4$ model.
  arXiv  Detail & Related papers  (2020-12-15T18:56:20Z)
• Contextuality scenarios arising from networks of stochastic processes [68.8204255655161]
  An empirical model is said contextual if its distributions cannot be obtained marginalizing a joint distribution over X. We present a different and classical source of contextual empirical models: the interaction among many processes. The statistical behavior of the network in the long run makes the empirical model generically contextual and even strongly contextual.
  arXiv  Detail & Related papers  (2020-06-22T16:57:52Z)

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.