Related papers: Generalized CV Conjecture and Krylov Complexity in…
Krylov complexity is a novel measure of operator complexity that exhibits universal behavior and bounds a large class of other measures. In this letter, we generalize Krylov complexity from a closed system to an open system coupled to a…
The concept of \emph{complexity} has become pivotal in multiple disciplines, including quantum information, where it serves as an alternative metric for gauging the chaotic evolution of a quantum state. This paper focuses on \emph{Krylov…
We compare Krylov's state complexity with an information-geometric (IG) measure of complexity for the quantum evolution of two-level systems. Focusing on qubit dynamics on the Bloch sphere, we analyze evolutions generated by stationary and…
Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) gaining prominence. In this study, we investigate their…
This paper investigates the notion of Krylov complexity, a measure of operator growth, within the framework of 1-matrix quantum mechanics (1-MQM). Krylov complexity quantifies how an operator evolves over time by expanding it in a series of…
We investigate Krylov state complexity as a probe of the quantum Mpemba effect in quantum spin chains. For models without global $U(1)$ symmetry, Krylov complexity exhibits clear Mpemba-like crossings, consistent with conventional…
This work is originally a Cambridge Part III essay paper. Quantum complexity arises as an alternative measure to the Fubini metric between two quantum states. Given two states and a set of allowed gates, it is defined as the least complex…
Using the information geometry approach, we determine the volume of the set of two-qubit states with maximally disordered subsystems. Particular attention is devoted to the behavior of the volume of sub-manifolds of separable and entangled…
While the exact separability probability of 8/33 for two-qubit states under the Hilbert-Schmidt measure has been reported by Huong and Khoi [\href{https://doi.org/10.1088/1751-8121/ad8493}{J.Phys.A:Math.Theor.{\bf57}, 445304(2024)}],…
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,…
One of the key features of information geometry in the classical setting is the existence of a metric structure and a family of connections on the space of probability distributions. The uniqueness of the Fisher--Rao metric and the duality…
For one-qubit pure quantum states, it is already proved that the Voronoi diagrams with respect to two distances -- Euclidean distance and the quantum divergence -- coincide. This fact is a support for a known method to calculate the Holevo…
We present a general framework in which both Krylov state and operator complexities can be put on the same footing. In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state which, for the…
We show that the Hilbert space spanned by a continuously parametrized wavefunction family---i.e., a quantum state manifold---is dominated by a subspace, onto which all member states have close to unity projection weight. Its characteristic…
We establish a mapping between a continuous variable (CV) quantum system and a discrete quantum system of arbitrary dimension. This opens up the general possibility to perform any quantum information task with a CV system as if it were a…
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…
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…
We analyze the properties of Krylov state complexity in qubit dynamics, considering a single qubit and a qubit pair. A geometrical picture of the Krylov complexity is discussed for the single-qubit case, whereas it becomes non-trivial for…
Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the power to execute universal, fault-tolerant quantum computing in a measurement-based fashion.…
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…