Related papers: Krylov Complexity in Quantum Field Theory
Quantum circuit complexity has played a central role in recent advances in holography and many-body physics. Within quantum field theory, it has typically been studied in a Lorentzian (real-time) framework. In a departure from standard…
In this paper, we examine the proposed first law of holographic complexity through studying different perturbations around various spacetime backgrounds. We present a general expression for the variation of the holographic complexity on…
It is believed that a primary principle of the theory of quantum gravity is the Holographic Principle according to which a physical system can be described only by degrees of freedom living on its boundary. The generalized covariant…
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…
In approaches to quantum gravity, where smooth spacetime is an emergent approximation of a discrete Planckian fundamental structure, any standard effective field theoretical description will miss part of the degrees of freedom and thus…
We compute the time-dependent complexity of the thermofield double states by four different proposals: two holographic proposals based on the "complexity-action" (CA) conjecture and "complexity-volume" (CV) conjecture, and two quantum field…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
Quantum reservoir computing algorithms recently emerged as a standout approach in the development of successful methods for the NISQ era, because of its superb performance and compatibility with current quantum devices. By harnessing the…
Holographic considerations may provide a glimpse of quantum gravity beyond what is currently accessible by other means. Here we apply holography to inflationary cosmology. We argue that the appropriate holographic bound on the total entropy…
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…
For large scale electronic structure calculation, the Krylov subspace method is introduced to calculate the one-body density matrix instead of the eigenstates of given Hamiltonian. This method provides an efficient way to extract the…
Complexity will be more and more essential in high-energy physics. It is naturally extended into the very early universe. Considering the universe as a quantum chaotic system, the curvature perturbation of the scalar field is identified…
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this…
We investigate minimal two-body Hamiltonians with random interactions that generate spectra resembling those of Gaussian random matrices, a phenomenon we term quadratic quantum chaos. Unlike integrable two-body fermionic systems, the…
An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…
We introduce a quasilocal version of holographic complexity adapted to `terminal states' such as spacelike singularities. We use a modification of the action-complexity ansatz, restricted to the past domain of dependence of the terminal…
Holographic principle states that the maximum entropy of a system is its boundary area in Planck units. However, such a holographic entropy cannot be realized by the conventional quantum field theory. We need a new microscopic theory which…
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere…
We introduce "binding complexity", a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local degrees of freedom. We define binding complexity of a…
Using the ``complexity equals action''(CA) conjecture, for an ordinary charged system, it has been shown that the late-time complexity growth rate is given by a difference between the value of $\Phi_{H}Q+\Omega_H J$ on the inner and outer…