相关论文: Black holes, complexity and quantum chaos
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
The growth of the "size" of operators is an important diagnostic of quantum chaos. In arXiv:1802.01198 [hep-th] it was conjectured that the holographic dual of the size is proportional to the average radial component of the momentum of the…
The ultimate limits of computation are not just logical, but physical. We investigate the physical resources -- time, energy, entropy, and free energy -- required to perform computational work. We apply the resulting measures of physical…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…
We investigate chaos in the dynamics of massless particles near the horizon of static spherically symmetric black holes in two well-motivated models of $f(R)$ gravity. In both these models, we probe chaos in the particle trajectories (under…
In this paper we study the chaos exponent, the exponential growth rate of the out-of-time-ordered four point functions, in a two coupled SYK models which exhibits a first order phase transition between the high temperature black hole phase…
In the past few years, there has been considerable activity around a set of quantum bounds on transport coefficients (viscosity) and chaos (Lyapunov exponent), relevant at low temperatures. The interest comes from the fact that Black-Hole…
Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that…
The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving Heisenberg operators. It is particularly…
It is not known what the limitations are on using quantum computation to speed up classical computation. An example would be the power to speed up PSPACE-complete computations. It is also not known what the limitations are on the duration…
We establish a version of the Momentum/Complexity (PC) duality between the rate of operator complexity growth and a radial component of bulk momentum for a test system falling into a black hole. In systems of finite entropy, our map remains…
We present an overall picture of the advances in the description of black hole physics from the perspective of loop quantum gravity. After an introduction that discusses the main conceptual issues we present some details about the classical…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the…
We explore the quantum nature of black holes by introducing an effective framework that takes into account deviations from the classical results. The approach is based on introducing quantum corrections to the classical Schwarzschild…
We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation…
Positions of a charged particle's equilibrium orbits and spatial regions where the chaos bound is violated are found through circular motions of the particle around charged Taub-NUT black holes. Lyapunov exponent is gotten by calculating…
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity…
The future interior of black holes in AdS/CFT can be described in terms of a quantum circuit. We investigate boundary quantities detecting properties of this quantum circuit. We discuss relations between operator size, quantum complexity,…
We study quantum chaos of rotating BTZ black holes in Topologically Massive gravity (TMG). We discuss the relationship between chaos parameters including Lyapunov exponents and butterfly velocities from shock wave calculations of…