Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHolographic Entanglement Entropy, Subregion Complexity and Fisher Information metric of `black Non-SUSY D3 Brane
79
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The BPS D3 brane has a non-supersymmetric cousin, called the non-susy D3 brane, which is also a solution of type IIB string theory. The corresponding counterpart of black D3 brane is the `black non-susy D3 brane and like the BPS D3 brane, it also has a decoupling limit, where the decoupled geometry (in the case we are interested, this is asymptotically AdS$_5$ $times$ S$^5$) is the holographic dual of a non-conformal, non-supersymmetric QFT in $(3+1)$-dimensions. In this QFT we compute the entanglement entropy (EE), the complexity and the Fisher information metric holographically using the above mentioned geometry for spherical subsystems. The fidelity and the Fisher information metric have been calculated from the regularized extremal volume of the codimension one time slice of the bulk geometry using two different proposals in the literature. Although for AdS black hole both the proposals give identical results, the results differ for the non-supersymmetric background.
rate research
Read More
We study the holographic entanglement entropy under small deformations of AdS, including time-dependence. It is found through perturbative analysis that the divergent terms are not affected and the change appears only in the finite terms. We also consider the entanglement thermodynamic first law, and calculate the entanglement temperature and confirm that it is inversely proportional to the size of the entangling region.
We compute the holographic entanglement entropy and subregion complexity of spherical boundary subregions in the uncharged and charged AdS black hole backgrounds, with the textbf{change} in these quantities being defined with respect to the pure AdS result. This calculation is done perturbatively in the parameter $frac{R}{z_{rm h}}$, where $z_{rm h}$ is the black hole horizon and $R$ is the radius of the entangling region. We provide analytic formulae for these quantities as functions of the boundary spacetime dimension $d$ including several orders higher than previously computed. We observe that the change in entanglement entropy has definite sign at each order and subregion complexity has a negative sign relative to entanglement entropy at each of those orders (except at first order or in three spacetime dimensions, where it vanishes identically). We combine pre-existing work on the complexity equals volume conjecture and the conjectured relationship between Fisher information and bulk entanglement to suggest a refinement of the so-called first law of entanglement thermodynamics by introducing a work term associated with complexity. This extends the previously proposed first law, which held to first order, to one which holds to second order. We note that the proposed relation does not hold to third order and speculate on the existence of additional information-theoretic quantities that may also play a role.
We investigate general features of the evolution of holographic subregion complexity (HSC) on Vaidya-AdS metric with a general form. The spacetime is dual to a sudden quench process in quantum system and HSC is a measure of the ``difference between two mixed states. Based on the subregion CV (Complexity equals Volume) conjecture and in the large size limit, we extract out three distinct stages during the evolution of HSC: the stage of linear growth at the early time, the stage of linear growth with a slightly small rate during the intermediate time and the stage of linear decrease at the late time. The growth rates of the first two stages are compared with the Lloyd bound. We find that with some choices of certain parameter, the Lloyd bound is always saturated at the early time, while at the intermediate stage, the growth rate is always less than the Lloyd bound. Moreover, the fact that the behavior of CV conjecture and its version of the subregion in Vaidya spacetime implies that they are different even in the large size limit.
We construct renormalized holographic entanglement entropy (HEE) and subregion complexity (HSC) in the CV conjecture for asymptotically AdS$_4$ and AdS$_5$ geometries under relevant perturbations. Using the holographic renormalization method developed in the gauge/gravity duality, we obtain counter terms which are invariant under coordinate choices. We explicitly define different forms of renormalized HEE and HSC, according to conformal dimensions of relevant operators in the $d=3$ and $d=4$ dual field theories. We use a general embedding for arbitrary entangling subregions and showed that any choice of the coordinate system gives the same form of the counter terms, since they are written in terms of curvature invariants and scalar fields on the boundaries. We show an explicit example of our general procedure. Intriguingly, we find that a divergent term of the HSC in the asymptotically AdS$_5$ geometry under relevant perturbations with operators of conformal dimensions in the range $0< Delta < frac{1}{2},, {rm and} ,, frac{7}{2}< Delta < 4$ cannot be cancelled out by adding any coordinate invariant counter term. This implies that the HSCs in these ranges of the conformal dimensions are not renormalizable covariantly.
In this paper, we will propose a universal relation between the holographic complexity (dual to a volume in AdS) and the holographic entanglement entropy (dual to an area in AdS). We will explicitly demonstrate that our conjuncture hold for all a metric asymptotic to AdS$_3$, and then argue that such a relation should hold in general due to the AdS version of the Cavalieri principle. We will demonstrate that it holds for Janus solution, which have been recently been obtained in type IIB string theory. We will also show that this conjecture holds for a circular disk. This conjecture will be used to show that the proposal that the complexity equals action, and the proposal that the complexity equal volume can represent the same physics. Thus, using this conjecture, we will show that the black holes are fastest computers, using the proposal that complexity equals volume.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
