Related papers: On Krylov complexity in open systems: an approach …
The spreading of quantum states in Krylov space under unitary dynamics provides a natural framework for characterizing quantum complexity. Quantifiers of this spreading, such as the spread complexity and the inverse participation ratio,…
In this study, we introduce two new Krylov subspace methods for solving rectangular large-scale linear inverse problems. The first approach is a modification of the Hessenberg iterative algorithm that is based off an LU factorization and is…
The Krylov subspace projection approach is a well-established tool for the reduced order modeling of dynamical systems in the time domain. In this paper, we address the main issues obstructing the application of this powerful approach to…
For several classes of mathematical models that yield linear systems, the splitting of the matrix into its Hermitian and skew Hermitian parts is naturally related to properties of the underlying model. This is particularly so for…
We study the real-time evolution of large open quantum spin systems in two spatial dimensions, whose dynamics is entirely driven by a dissipative coupling to the environment. We consider different dissipative processes and investigate the…
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…
Krylov complexity has emerged as a new probe of operator growth in a wide range of non-equilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space…
A semiclassical approximation for an evolving density operator, driven by a "closed" hamiltonian operator and "open" markovian Lindblad operators, is obtained. The theory is based on the chord function, i.e. the Fourier transform of the…
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are…
Open quantum systems can be described by unraveling Lindblad master equations into ensembles of quantum trajectories. Here we investigate how the complexity of such trajectories is affected by conservation laws and other dynamical…
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…
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…
In this paper we study Krylov complexity in the presence of single and multiple operators in the DSSYK model, where we can use the analytical techniques coming from chord diagrammatics. One of the results we obtain is that it showcases the…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the…
For large-scale discrete ill-posed problems, LSQR, a Lanczos bidiagonalization process based Krylov method, is most often used. It is well known that LSQR has natural regularizing properties, where the number of iterations plays the role of…
Reliable adaptive beamforming is critical for large microphone arrays operating in highly dynamic acoustic environments. In scenarios characterized by fast-moving talkers and interferers, the available sample support for estimating the…
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…
We set up, at the abstract Hilbert space setting, the general question on when an inverse linear problem induced by an operator of Friedrichs type admits solutions belonging to (the closure of) the Krylov subspace associated to such…
The complexity of quantum states under dynamical evolution can be investigated by studying the spread with time of the state over a pre-defined basis. It is known that this complexity is minimised by choosing the Krylov basis, thus defining…