Related papers: Complexity, action, and black holes
We conjecture that the quantum complexity of a holographic state is dual to the action of a certain spacetime region that we call a Wheeler-DeWitt patch. We illustrate and test the conjecture in the context of neutral, charged, and rotating…
In a seminal paper by Brown et al. [Phys. Rev. Lett. 116, no. 19, 191301 (2016)] a new conjecture was proposed, namely it was argued that the quantum complexity of a holographic state is equal to action of a Wheeler-DeWitt patch in the late…
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…
The recently proposed complexity-action conjecture allows one to calculate how fast one can produce a quantum state from a reference state in terms of the on-shell action of the dual AdS black hole at the Wheeler-DeWitt patch. We show that…
We consider the holographic complexity conjectures for de-Sitter invariant states in a quantum field theory on de Sitter space, dual to asymptotically anti-de Sitter geometries with de Sitter boundaries. The bulk holographic duals include…
In this paper, we investigate the growth rates of action for the anti-de Sitter black holes in massive-Einstein gravity models and obtain the universal behaviors of the growth rates of action (the rates of holographic complexity) within the…
Within the framework of the "complexity equals action" and "complexity equals volume" conjectures, we study the properties of holographic complexity for rotating black holes. We focus on a class of odd-dimensional equal-spinning black holes…
We perform a comparative study of the time dependence of the holographic quantum complexity of some space like singular bulk gravitational backgrounds. This is done by considering the two available notions of complexity, one that relates it…
This thesis develops recent work on the so called Volume-Complexity and Action-Complexity conjectures. According to this family of proposals, geometric quantities can be defined in some holographic gravitational theories that can be mapped…
Based on the complexity equals action (CA) and complexity equals volume (CV) conjectures, we investigate the holographic complexity of a slowly accelerating Kerr-AdS black hole in the bulk Einstein gravity theory which is dual to…
The Jackiw-Teitelboim (JT) model arises from the dimensional reduction of charged black holes. Motivated by the holographic complexity conjecture, we calculate the late-time rate of change of action of a Wheeler-DeWitt patch in the JT…
The Complexity=Action conjecture is studied for black holes in Warped AdS$_3$ space, realized as solutions of Einstein gravity plus matter. The time dependence of the action of the Wheeler-DeWitt patch is investigated, both for the…
We analyze different holographic complexity proposals for black holes that include corrections from bulk quantum fields. The specific setup is the quantum BTZ black hole, which encompasses in an exact manner the effects of conformal fields…
The action growth proposal relates the holographic complexity to the value of the action on the Wheeler-de Witt patch. We introduce a new method of calculating the gravitational action using the "bulk" term, i.e. the part of the…
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 "complexity = action" duality states that the quantum complexity is equal to the action of the stationary AdS black holes within the Wheeler-DeWitt patch at late time approximation. We compute the action growth rates of the neutral and…
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…
In this paper, we use the complexity equals action proposal and investigate holographic complexity for hyperscaling violating theories on different subregions of space-time enclosed by the null boundaries. We are interested in computing the…
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 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…