Related papers: Towards a Refinement of Krylov Complexity: Scrambl…
In this work, we investigate local quench dynamics in two-dimensional conformal field theories using Krylov space methods. We derive Lanczos coefficients, spread complexity, and Krylov entropies for local joining and splitting quenches in…
Using coherent states as initial states, we investigate the quantum dynamics of the Lipkin-Meshkov-Glick (LMG) and Dicke models in the semi-classical limit. They are representative models of bounded systems with one- and two-degrees of…
We study the runtime verification of hyperproperties, expressed in the temporal logic HyperLTL, as a means to inspect a system with respect to security polices. Runtime monitors for hyperproperties analyze trace logs that are organized by…
Krylov subspace recycling is a powerful tool for solving long series of large, sparse linear systems that change slowly. In PDE constrained shape optimization, these appear naturally, as hundreds or more optimization steps are needed with…
Quantum chaos refers to signatures of classical chaos found in the quantum domain. Recently, it has become common to equate the exponential behavior of out-of-time order correlators (OTOCs) with quantum chaos. The quantum-classical…
We investigate the time evolution of the complexity of the operator by the Sachdev-Ye-Kitaev (SYK) model with $N$ Majorana fermions. We follow Nielsen's idea of complexity geometry and geodesics thereof. We show that it is possible that the…
We consider the solution of large stiff systems of ordinary differential equations with explicit exponential Runge--Kutta integrators. These problems arise from semi-discretized semi-linear parabolic partial differential equations on…
The dynamical spreading of quantum information through a many-body system, typically called scrambling, is a complex process that has proven to be essential to describe many properties of out-of-equilibrium quantum systems. Scrambling can,…
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…
Krylov methods have reappeared recently, connecting physically sensible notions of complexity with quantum chaos and quantum gravity. In these developments, the Hamiltonian and the Liouvillian are tridiagonalized so that…
We present a unified derivation of the resummation of Sudakov logarithms, directly from the factorization properties of cross sections in which they occur. We rederive in this manner the well-known exponentiation of leading and nonleading…
Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators…
Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable…
Krylov subspace methods are widely known as efficient algebraic methods for solving large scale linear systems. However, on massively parallel hardware the performance of these methods is typically limited by communication latency rather…
Non-equilibrium quantum many-body systems, which are difficult to study via classical computation, have attracted wide interest. Quantum simulation can provide insights into these problems. Here, using a programmable quantum simulator with…
We develop computational tools necessary to extend the application of Krylov complexity beyond the simple Hamiltonian systems considered thus far in the literature. As a first step toward this broader goal, we show how the Lanczos algorithm…
This paper introduces a new class of algorithms for solving large-scale linear inverse problems based on new flexible and inexact Golub-Kahan factorizations. The proposed methods iteratively compute regularized solutions by approximating a…
An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…
Fast scrambling of quantum correlations, reflected by the exponential growth of Out-of-Time-Order Correlators (OTOCs) on short pre-Ehrenfest time scales, is commonly considered as a major quantum signature of unstable dynamics in quantum…
Systems exhibiting the Hilbert-space fragmentation are nonergodic, and their Hamiltonians decompose into exponentially many blocks in the computational basis. In many cases, these blocks can be labeled by eigenvalues of statistically…