相关论文: Complexity is Simple
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 construct a time-dependent expression of the computational complexity of a quantum system which consists of two conformal complex scalar field theories in d dimensions coupled to constant electric potentials and defined on the boundaries…
Based on reasonable assumptions, we propose a new expression for Lloyd's bound, which confines the complexity growth of charged black holes. We then revisit holographic complexity for charged black branes in the presence of a finite cutoff.…
In the context of CA conjecture for holographic complexity, we study the action growth rate at late time approximation for general quadratic curvature theory of gravity. We show how the Lloyd's bound saturates for charged and neutral black…
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…
In this paper, we relate the complexity for a holographic state to a simple gravitational object of which the growth rate at late times is equal to temperature times black hole entropy. We show that if this is correct, the thermodynamics of…
In a quantum circuit, it is believed that complexity itself reaches a maximum of order exponential in the number of q-bits or equivalently exponential in entropy of the black hole. However, the current holographic proposals do not meet this…
We evaluate the full time dependence of holographic complexity in various eternal black hole backgrounds using both the complexity=action (CA) and the complexity=volume (CV) conjectures. We conclude using the CV conjecture that the rate of…
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem…
The complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random…
We study the holographic complexity conjectures for rotating black holes, uncovering a relationship between the complexity of formation and the thermodynamic volume of the black hole. We suggest that it is the thermodynamic volume and not…
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…
Based on the context of complexity = action (CA) conjecture, we calculate the holographic complexity of AdS black holes with planar and spherical topologies in Horndeski theory. We find that the rate of change of holographic complexity for…
Recent conjectures on the complexity of black holes suggest that their evolution manifests in the structural properties of Einstein-Rosen bridges, like the length and volume. The complexity of black holes relates to the computational…
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…
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…
We show that bulk operators lying between the outermost extremal surface and the asymptotic boundary admit a simple boundary reconstruction in the classical limit. This is the converse of the Python's lunch conjecture, which proposes that…
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…
Motivated by $T{\overline T}$ deformation of a conformal field theory we compute holographic complexity for a black brane solution with a cut off using "complexity=action" proposal. In order to have a late time behavior consistent with…
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…