On Krylov complexity in open systems: an approach via bi-Lanczos algorithm
Reviewed by Pithpith:2F73TT5Wopen to challenge →
read the original abstract
Continuing the previous initiatives arXiv: 2207.05347 and arXiv: 2212.06180, we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form, thus opening up a possibility to study a wide class of dissipative integrable and chaotic systems by computing Krylov complexity at late times. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain. We find that, for the weak coupling, initial Lanczos coefficients can efficiently distinguish integrable and chaotic evolution before the dissipative effect sets in, which results in more fluctuations in higher Lanczos coefficients. This results in the equal saturation of late-time complexity for both integrable and chaotic cases, making the notion of late-time chaos dubious.
This paper has not been read by Pith yet.
Forward citations
Cited by 8 Pith papers
-
Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity
Polynomial changes of the initial state in Krylov complexity are solved exactly via Christoffel transforms of the spectral measure, yielding finite-band amplitude transfer and projected-kernel complexity formulas with...
-
Stochastic Krylov Dynamics: Revisiting Operator Growth in Open Quantum Systems
In open quantum systems, environmental coupling turns deterministic Krylov phase-space trajectories into stochastic ones by adding diffusion, destroying the hyperbolic mechanism for exponential complexity growth beyon...
-
Violation of Universal Operator Growth Hypothesis in $\mathcal{W}_3$Conformal Field Theories
In W3 CFTs, Lanczos coefficients b_N grow as N^2 for generalized Liouvillian with W generators, violating the universal linear growth bound and causing divergent Krylov complexity, with the same quadratic growth in th...
-
Controlled Chaos in 4D SCFTs
Orbifolds of N=4 SYM produce SCFTs whose dilatation operator in a subsector is realized by a tunable spin chain whose eigenvalue statistics exhibit chaos for specific marginal couplings.
-
Krylov Complexity: Flat bands and Carroll breaking deformations
Krylov complexity growth distinguishes phase-dependent resilience of Carrollian sectors in all-bands-flat fermionic ladders against delocalizing perturbations and exhibits UV sensitivity in a continuum Carroll scalar ...
-
Krylov complexity and fidelity susceptibility in two-band Hamiltonians
Derivative of Krylov spread complexity diverges logarithmically at SSH topological transitions and is bounded by fidelity susceptibility in general two-band Hamiltonians, with a non-unitary duality between phases.
-
Generalized CV Conjecture and Krylov Complexity in Two-Mode Hermitian Systems via Information Geometry
Krylov complexity equals Fubini-Study volume for closed and open two-mode squeezed states, providing analytic support for the generalized CV conjecture via information geometry.
-
Krylov Complexity
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.