arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 2411.18436quant-phhep-th
收藏

利用Krylov算符复杂度研究量子混沌的统计特征

Statistical features of quantum chaos using the Krylov operator complexity

Zhuoran Li, Wei Fan

AI总结:

该研究通过Krylov算符复杂度探究量子混沌统计特性,提出Lanczos系数的两个关键统计量,推导其分布规律,并经台球系统数值验证,揭示了RMT、Anderson局域化与Krylov复杂度的关联。

摘要:

我们研究了生成Krylov空间的随机初始算符系综下Lanczos系数的统计性质。提出两个对表征复杂度至关重要的统计量:Lanczos系数的平均关联矩阵$\u27e8 x_i x_j \u27e9$,以及由此得到的Lanczos系数方差分布。二者的统计结果分别为Wishart分布和(重标化的)卡方分布,它们与初始算符的分布无关,且在矩阵尺寸很大时趋近于正态分布。作为数值示例,我们采用含破缺可积性项的典型台球系统,从给定概率分布(GOE、GUE和均匀分布)中选取随机初始算符样本。结果与唯象分析一致,还得到了更有趣的行为,表明随机矩阵理论(RMT)、Anderson局域化与Krylov复杂度之间存在一致的关联。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑