Related papers: Krylov complexity has it all
We study information scrambling -- a spread of initially localized quantum information into the system's many degree of freedom -- in discrete-time quantum walks. We consider out-of-time-ordered correlators (OTOC) and K-complexity as a…
The complexity of the quantum state of a multiparticle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation. The coefficient in this relation…
We investigate the quantitative relationship between operator spreading and classical information propagation in quantum systems. Focusing on a bi-partite quantum channel, we derive new upper and lower bounds on the Holevo capacity, a…
We propose a way to understand the evolution of an open quantum system using a description that dispenses a continuous evolution in time, by discrete operators entangled states, in its most direct and fundamental way. We show that the…
We analyse the Krylov solvability of inverse linear problems on Hilbert space $\mathcal{H}$ where the underlying operator is compact and normal. Krylov solvability is an important feature of inverse linear problems that has profound…
In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of…
Mixed-effects models are widely used to model data with hierarchical grouping structures and high-cardinality categorical predictor variables. However, for high-dimensional crossed random effects, current standard computations relying on…
We present a new algorithm for computing the Lyapunov exponents spectrum based on a matrix differential equation. The approach belongs to the so called continuous type, where the rate of expansion of perturbations is obtained for all times,…
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies…
For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
The zero-temperature single-particle Green's function of correlated fermion models with moderately large Hilbert-space dimensions can be calculated by means of Krylov-space techniques. The conventional Lanczos approach consists of finding…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
In this paper we present a novel extended Krylov subspace reduced-order modeling technique to efficiently simulate time- and frequency-domain wavefields in open complex structures. To simulate the extension to infinity, we use an optimal…
To understand typical dynamics of an open quantum system in continuous time, we introduce an ensemble of random Lindblad operators, which generate Markovian completely positive evolution in the space of density matrices. Spectral properties…
Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…
A cluster expansion is proposed, that applies to both continuous and discrete systems. The assumption for its convergence involves an extension of the neat Kotecky-Preiss criterion. Expressions and estimates for correlation functions are…
We extend the CV conjecture to quantum states of two-mode Hermitian systems using the framework of information geometry. Specifically, we conjecture that the Krylov complexity of a quantum state equals the volume of the Fubini-Study metric.…
Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the…
In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the information needed by a universal machine to reproduce the…