Krylov fractality and complexity in generic random matrix ensembles

• URL: http://arxiv.org/abs/2407.07399v2
• Date: Thu, 06 Feb 2025 03:38:40 GMT
• Title: Krylov fractality and complexity in generic random matrix ensembles
• Authors: Budhaditya Bhattacharjee, Pratik Nandy,
• Abstract summary: Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems. We consider the properties of the tridiagonal matrix elements and the associated basis vectors for appropriate random matrix ensembles. We discuss the characteristics of the matrix elements and basis vectors across the three (ergodic, fractal, and localized) regimes and introduce tools to identify the transition points.
• Score: 0.0
• License:
• Abstract: Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable states, transitioning through an intermediate phase, remains unexplored. We aim to fill this gap by considering the properties of the tridiagonal matrix elements and the associated basis vectors for appropriate random matrix ensembles. We utilize the Rosenzweig-Porter model as our primary example, which hosts a fractal regime in addition to the ergodic and localized phases. We discuss the characteristics of the matrix elements and basis vectors across the three (ergodic, fractal, and localized) regimes and introduce tools to identify the transition points. The exact expressions of the Lanczos coefficients are provided in terms of $q$-logarithmic function across the full parameter regime. The numerical results are corroborated with analytical reasoning for certain features of the Krylov spectra. Additionally, we investigate the Krylov state complexity within these regimes, showcasing the efficacy of our methods in pinpointing these transitions.

Related papers

• Clustering in Causal Attention Masking [24.786862288360076]
  This work presents a modification of the self-attention dynamics proposed by Geshkovski et al. (arXiv:2312.10794) to better reflect the practically relevant, causally masked attention used in transformer architectures for generative AI. This modification into an interacting particle system cannot be interpreted as a mean-field gradient flow.
  arXiv  Detail & Related papers  (2024-11-07T18:56:37Z)
• Complexity Measure Diagnostics of Ergodic to Many-Body Localization Transition [0.8192907805418583]
  We introduce new diagnostics of the transition between the ergodic and many-body localization phases. We use these complexity measures to analyze the power-law random banded matrix model.
  arXiv  Detail & Related papers  (2024-04-24T16:00:31Z)
• Spectral fluctuations of multiparametric complex matrix ensembles: evidence of a single parameter dependence [0.0]
  We numerically analyze the spectral statistics of the multiparametric Gaussian ensembles of complex matrices with zero mean and variances with different decay routes away from the diagonals. Such ensembles can serve as good models for a wide range of phase transitions e.g. localization to delocalization in non-Hermitian systems or Hermitian to non-Hermitian one.
  arXiv  Detail & Related papers  (2023-12-13T15:21:35Z)
• Fast and Robust Sparsity-Aware Block Diagonal Representation [13.167450470598045]
  The block diagonal structure of an affinity matrix represents clusters of feature vectors by non-zero coefficients that are concentrated in blocks. We propose a Fast and Robust Sparsity-Aware Block Diagonal Representation (FRS-BDR) method, which jointly estimates cluster memberships and the number of blocks. Experiments on a variety of real-world applications demonstrate the robustness of FRS-BDR in terms of clustering accuracy, against corrupted features, time and cluster enumeration performance.
  arXiv  Detail & Related papers  (2023-12-02T13:44:27Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• Eigen Analysis of Self-Attention and its Reconstruction from Partial Computation [58.80806716024701]
  We study the global structure of attention scores computed using dot-product based self-attention. We find that most of the variation among attention scores lie in a low-dimensional eigenspace. We propose to compute scores only for a partial subset of token pairs, and use them to estimate scores for the remaining pairs.
  arXiv  Detail & Related papers  (2021-06-16T14:38:42Z)
• Feature Weighted Non-negative Matrix Factorization [92.45013716097753]
  We propose the Feature weighted Non-negative Matrix Factorization (FNMF) in this paper. FNMF learns the weights of features adaptively according to their importances. It can be solved efficiently with the suggested optimization algorithm.
  arXiv  Detail & Related papers  (2021-03-24T21:17:17Z)
• Diagonal unitary and orthogonal symmetries in quantum theory [1.5229257192293197]
  We show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.
  arXiv  Detail & Related papers  (2020-10-15T17:25:38Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

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.