Related papers: Generalised Krylov complexity
We investigate various aspects of the Lanczos coefficients in a family of free Lifshitz scalar theories, characterized by their integer dynamical exponent, at finite temperature. In this non-relativistic setup, we examine the effects of…
The symmetry-resolved Krylov complexity is a useful tool in studying chaotic properties of systems that are endowed with symmetries. We investigate the conditions under which an invariant operator would have the symmetry-resolved Krylov…
Quantum speed limits (QSLs) provide lower bounds on the minimum time required for a process to unfold by using a distance between quantum states and identifying the speed of evolution or an upper bound to it. We introduce a generalization…
We address the problem of applying the Kolmogorov-Sinai method of entropic analysis, expressed in a generalized non-extensive form, to the dynamics of the logistic map at the chaotic threshold, which is known to be characterized by a power…
We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best known approximation bound for high dimensional Euclidean…
Krylov complexity measures the spread of an evolved state in a natural basis, induced by the generator of the dynamics and the initial state. Here, we study the spread in Hilbert space of the state of an Ising chain subject to a…
The present paper deals with a generalization of the Baskakov operators. Some direct theorems, asymptotic formula and $A$-statistical convergence are established. Our results are based on a $\rho$ function. These results include the…
This paper presents a study of the inherent structural properties of Krylov subspaces, in particular for the self-adjoint class of operators, and how they relate with the important phenomenon of `Krylov solvability' of linear inverse…
Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…
Information scrambling refers to the phenomenon in which local quantum information in a many-body system becomes dispersed throughout the entire system under unitary evolution. It has been extensively studied in closed quantum systems,…
Scrambling of information in a quantum many-body system, quantified by the out-of-time-ordered correlator (OTOC), is a key manifestation of quantum chaos. A regime of exponential growth in the OTOC, characterized by a Lyapunov exponent, has…
Quantum information scrambling refers to the loss of local recoverability of quantum information, which has found widespread attention from high energy physics to quantum computing. In the present analysis we propose a possible starting…
Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…
We consider a class of models describing the dynamics of $N$ Boolean variables, where the time evolution of each depends on the values of $K$ of the other variables. Previous work has considered models with dissipative dynamics. Here we…
In this paper, we construct generalized Baskakov Kantorovich operators. We establish some direct results and then study weighted approximation, simultaneous approximation and statistical convergence properties for these operators. Finally,…
Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property…
In this work, we study the information scrambling and the entanglement dynamics in the complex Brownian Sachdev-Ye-Kitaev (cBSYK) models, focusing on their dependence on the charge density $n$. We first derive the effective theory for…
Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows…
Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang (KPZ) scaling in late-time correlators and autocorrelators of certain interacting many-body systems has been reported. Inspired by these results, we explore the KPZ scaling in…
This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework that interpolates…