ﻻ يوجد ملخص باللغة العربية
We construct and analyze holographic superconductors with generalized higher derivative couplings, in single R-charged black hole backgrounds in four and five dimensions. These systems, which we call very general holographic superconductors, have multiple tuning parameters and are shown to exhibit a rich phase structure. We establish the phase diagram numerically as well as by computing the free energy, and then validated the results by calculating the entanglement entropy for these systems. The entanglement entropy is shown to be a perfect indicator of the phase diagram. The differences in the nature of the entanglement entropy in R-charged backgrounds compared to the AdS-Schwarzschild cases are pointed out. We also compute the analogue of the entangling temperature for a subclass of these systems and compare the results with non-hairy backgrounds.
We study the behavior of holographic entanglement entropy (HEE) for imbalanced holographic superconductors. We employ a numerical approach to consider the robust case of fully back-reacted gravity system. The hairy black hole solution is found by usi
In an attempt to find a quasi-local measure of quantum entanglement, we introduce the concept of entanglement density in relativistic quantum theories. This density is defined in terms of infinitesimal variations of the region whose entanglement we m
We study the entanglement entropy as a probe of the proximity effect of a superconducting system by using the gauge/gravity duality in a fully back-reacted gravity system. While the entanglement entropy in the superconducting phase is less than the e
We use the Iyer-Wald formalism to derive an extended first law of entanglement that includes variations in the cosmological constant, Newtons constant and --in the case of higher-derivative theories-- all the additional couplings of the theory. In Ei
We study the conjectured holographic duality between entanglement of purification and the entanglement wedge cross-section. We generalize both quantities and prove several information theoretic inequalities involving them. These include upper bounds