Related papers: On Krylov complexity in open systems: an approach …
In this work, we investigate spectral complexity and Krylov complexity in quantum billiard systems at finite temperature. We study both circle and stadium billiards as paradigmatic examples of integrable and non-integrable…
We investigate the relationship between Krylov complexity and operator quantum speed limits (OQSLs) of the complexity operator and level repulsion in random/integrable matrices and many-body systems. An enhanced level-repulsion corresponds…
In this paper we study the notion of complexity under time evolution in chaotic quantum systems with holographic duals. Continuing on from our previous work, we turn our attention to the issue of Krylov complexity upon the insertion of a…
Krylov complexity is a novel approach to study how an operator spreads over a specific basis. Recently, it has been stated that this quantity has a long-time saturation that depends on the amount of chaos in the system. Since this quantity…
We investigate and characterize the dynamics of operator growth in irrational two-dimensional conformal field theories. By employing the oscillator realization of the Virasoro algebra and CFT states, we systematically implement the Lanczos…
Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) gaining prominence. In this study, we investigate their…
We explore Krylov complexity in the BMN matrix model following a systematic reduction of it, known as the pulsating fuzzy sphere model. We present an analytical setup that allows us to calculate Lanczos coefficients in both large and small…
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…
In theory, the Lanczos algorithm generates an orthogonal basis of the corresponding Krylov subspace. However, in finite precision arithmetic, the orthogonality and linear independence of the computed Lanczos vectors is usually lost quickly.…
The IP matrix model is a simple large $N$ quantum mechanical model made up of an adjoint harmonic oscillator plus a fundamental harmonic oscillator. It is a model introduced previously as a toy model of the gauge theory dual of an AdS black…
Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by Random Matrix Theory (RMT). We propose and develop a complementary version of this conjecture: quantum…
Spread complexity uses the distribution of support of a time-evolving state in the Krylov basis to quantify dispersal across accessible dimensions of a Hilbert space. Here, we describe how variations in initial conditions, the Hamiltonian,…
Solving short and long time dynamics of closed quantum many-body systems is one of the main challenges of both atomic and condensed matter physics. For locally interacting closed systems, the dynamics of local observables can always be…
We consider the approximation of $B^T (A+sI)^{-1} B$ for large s.p.d. $A\in\mathbb{R}^{n\times n}$ with dense spectrum and $B\in\mathbb{R}^{n\times p}$, $p\ll n$. We target the computations of Multiple-Input Multiple-Output (MIMO) transfer…
For linear inverse problems with a large number of unknown parameters, uncertainty quantification remains a challenging task. In this work, we use Krylov subspace methods to approximate the posterior covariance matrix and describe efficient…
Decays of heavier neutrino mass eigenstates into lighter ones, while very slow in the Standard Model, can be significantly enhanced in scenarios with more than three neutrino flavours, or in models with new ultra-light particles such as…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
The Lanczos method with implicit restarting is one of the most popular methods for finding a few exterior eigenpairs of a large symmetric matrix $A$. Usually based on polynomial filtering, restarting is crucial to limit memory and the cost…
We propose algorithms for efficient time integration of large systems of oscillatory second order ordinary differential equations (ODEs) whose solution can be expressed in terms of trigonometric matrix functions. Our algorithms are based on…
In recent years, there has been growing interest in characterizing the complexity of quantum evolutions of interacting many-body systems. When a time-independent Hamiltonian governs the dynamics, Krylov complexity has emerged as a powerful…