Related papers: Bridging Krylov Complexity and Universal Analog Qu…
We introduce a systematic protocol for constructing quantum Hilbert-space-fragmented Hamiltonians, whose Krylov-sector structure, unlike in classically fragmented models, can be fully resolved only in an entangled basis. The protocol takes…
This work addresses how the growth of invariant operators is influenced by their underlying symmetry structure. For this purpose, we introduce the symmetry-resolved Krylov complexity, which captures the time evolution of each block into…
In this paper, we studied a set of generalised Krylov complexity for operator growth. We demonstrate their universal features at both initial times and long times using half-analytical technique as well as numerical results. In particular,…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…
Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos, and has recently been much studied for various time-independent systems. We initiate the study of K-complexity in…
In this work we study the relationship between quantum random walks on graphs and Krylov/spread complexity. We show that the latter's definition naturally emerges through a canonical method of reducing a graph to a chain, on which we can…
The dynamics of quantum systems unfolds within a subspace of the state space or operator space, known as the Krylov space. This review presents the use of Krylov subspace methods to provide an efficient description of quantum evolution and…
Recently, the propagation of information through quantum many-body systems, developed to study quantum chaos, have found many application from black holes to disordered spin systems. Among other quantitative tools, Krylov complexity has…
We introduce and review a new complexity measure, called `Krylov complexity', which takes its origins in the field of quantum-chaotic dynamics, serving as a canonical measure of operator growth and spreading. Krylov complexity, underpinned…
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…
Recently, Krylov complexity was proposed as a measure of complexity and chaoticity of quantum systems. We consider the stadium billiard as a typical example of the quantum mechanical system obtained by quantizing a classically chaotic…
We propose and test logarithmic Krylov (logK) complexity, an operator growth measure akin to Krylov complexity defined through a replica approach, as a viable probe of early-time operator scrambling without false positives. In…
Analog quantum simulators emulate complex many-body dynamics through native continuous-time evolution under hardware-defined interactions. Yet once a platform is specified, its interaction structure is largely fixed by the underlying…
In closed quantum systems, Krylov complexity admits a geometric description; operator growth is equivalent to Hamiltonian flow in an emergent phase space whose structure is fixed by the Lanczos coefficients. We show that this picture…
The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is…
We show that the area operator of a quantum extremal surface can be reconstructed directly from boundary dynamics without reference to bulk geometry. Our approach combines the operator-algebra quantum error-correction (OAQEC) structure of…
We investigate the complexity of states and operators evolved with the modular Hamiltonian by using the Krylov basis. In the first part, we formulate the problem for states and analyse different examples, including quantum mechanics,…
We have developed an application and implemented parallel algorithms in order to provide a computational framework suitable for massively parallel supercomputers to study the unitary dynamics of quantum systems. We use renowned parallel…
Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of…
In this paper, we study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe…