Related papers: Krylov complexity has it all
Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a…
Although quantum coherence is a basic trait of quantum mechanics, the presence of coherences in the quantum description of a certain phenomenon does not rule out the possibility to give an alternative description of the same phenomenon in…
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…
In this article, we propose a Lyapunov stability approach to analyze the convergence of the density operator of a quantum system. In analog to the classical probability measure for Markovian processes, we show that the set of invariant…
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…
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, contracted tensor product Krylov recursion. It is proved that…
Since being analyzed by Rokhlin, Szlam, and Tygert and popularized by Halko, Martinsson, and Tropp, randomized Simultaneous Power Iteration has become the method of choice for approximate singular value decomposition. It is more accurate…
We demonstrate a relation between Nielsen's approach towards circuit complexity and Krylov complexity through a particular construction of quantum state space geometry. We start by associating K\"ahler structures on the full projective…
The computation of thermal properties of quantum many-body systems is a central challenge in our understanding of quantum mechanics. We introduce the Quantum Finite Temperature Lanczos Method (QFTLM), which extends the finite-temperature…
In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides…
We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity…
In high-energy physics, confinement denotes the tendency of fundamental particles to remain bound together, preventing their observation as free, isolated entities. Interestingly, analogous confinement behavior emerges in certain condensed…
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 study the spectral properties of two classes of random matrix models: non-Gaussian RMT with quartic and sextic potentials, and RMT with Gaussian noise. We compute and analyze the quantum Krylov complexity and the spectral form factor for…
Due to M\"{u}ller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount…
We compute the rate of growth of operator size in matrix models by probing the Lin-Maldacena class of geometries with classical probes. We consider massive point particle probes whose proper momentum equals the size of the gauge invariant…
The fundamental properties of quantum information and its applications to computing and cryptography have been greatly illuminated by considering information-theoretic tasks that are provably possible or impossible within non-relativistic…
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in…
We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, i.e. anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates…