相关论文: Krylov state complexity for BMN matrix model

In the study of chaotic behaviour of systems of many hard spheres, Lyapunov exponents of small absolute value exhibit interesting characteristics leading to speculations about connections to non-equilibrium statistical mechanics. Analytical…

We describe the transformation of a polynomial planar dynamical system into a second order differential equation by means of a polynomial change of variables. We then, by means of the Krylov-Bogoliubov-Mitropolsky averaging method, identify…

We study the confining/deconfining phase transition in the mass deformed Yang-Mills matrix model which is obtained by the dimensional reduction of the bosonic sector of the four-dimensional maximally supersymmetric Yang-Mills theory…

We clarify some peculiar aspects of the perturbative expansion around a classical fuzzy-sphere solution in matrix models with a cubic term. While the effective action in the large-N limit is saturated at the one-loop level, we find that the…

This work is on a user-friendly reduced basis method for solving a family of parametric PDEs by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and bi-conjugate gradient…

Quantum Krylov subspace diagonalization is a prominent candidate for early fault tolerant quantum simulation of many-body and molecular systems, but so far the focus has been mainly on computing ground-state energies. We go beyond this by…

Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amount to well-known Krylov schemes that have been equipped with…

We analyze the properties of Krylov state complexity in qubit dynamics, considering a single qubit and a qubit pair. A geometrical picture of the Krylov complexity is discussed for the single-qubit case, whereas it becomes non-trivial for…

Evaluating the action of a matrix function on a vector, that is $x=f(\mathcal M)v$, is an ubiquitous task in applications. When $\mathcal M$ is large, one usually relies on Krylov projection methods. In this paper, we provide effective…

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…

Krylov complexity is a novel measure of operator complexity that exhibits universal behavior and bounds a large class of other measures. In this letter, we generalize Krylov complexity from a closed system to an open system coupled to a…

In this work, we propose a reduced basis method for efficient solution of parametric linear systems. The coefficient matrix is assumed to be a linear matrix-valued function that is symmetric and positive definite for admissible values of…

We study Krylov complexity in Schr\"odinger field theory in the grand canonical ensemble with chemical potential $\mu$, with an emphasis on the qualitatively new features that arise for $\mu>0$. In this regime the fermionic Wightman power…

We investigate Krylov spread complexity for the ground state of two-band Hamiltonians, where the reference state is a generic state on the Bloch sphere. The spread complexity is obtained by using a purely geometric formulation in terms of…

Approximating the action of a matrix function $f(\mathbf{A})$ on a vector $\mathbf{b}$ is an increasingly important primitive in machine learning, data science, and statistics, with applications such as sampling high dimensional Gaussians,…

In this paper, we propose a new choice of poles to define reliable rational Krylov methods. These methods are used for approximating function of positive definite matrices. In particular, the fractional power and the fractional resolvent…

Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain…

In this paper we propose a method to compute the solution to the fractional diffusion equation on directed networks, which can be expressed in terms of the graph Laplacian $L$ as a product $f(L^T) \boldsymbol{b}$, where $f$ is a…

In this work we generalize the concept of modular spread complexity to the cases where the reduced density matrix is non-Hermitian. This notion of complexity and associated Lanczos coefficients contain richer information than the…

In this work we develop a real-time Schwinger-Keldysh formulation of Krylov dynamics that treats Krylov complexity as an in-in observable generated by a closed time contour path integral. The resulting generating functional exposes an…