اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCosmological Complexity
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We compute the quantum circuit complexity of the evolution of scalar curvature perturbations on expanding backgrounds, using the language of squeezed vacuum states. In particular, we construct a simple cosmological model consisting of an early-time period of de Sitter expansion followed by a radiation-dominated era and track the evolution of complexity throughout this history. During early-time de Sitter expansion the complexity grows linearly with the number of e-folds for modes outside the horizon. The evolution of complexity also suggests that the Universe behaves like a chaotic system during this era, for which we propose a scrambling time and Lyapunov exponent. During the radiation-dominated era, however, the complexity decreases until it freezes in after horizon re-entry, leading to a de-complexification of the Universe.
قيم البحث
اقرأ أيضاً
We compute the circuit complexity of scalar curvature perturbations on FLRW cosmological backgrounds with fixed equation of state $w$ using the language of squeezed vacuum states. Backgrounds that are accelerating and expanding, or decelerating and c
ontracting, exhibit features consistent with chaotic behavior, including linearly growing complexity. Remarkably, we uncover a bound on the growth of complexity for both expanding and contracting backgrounds $lambda leq sqrt{2} |H|$, similar to other bounds proposed independently in the literature. The bound is saturated for expanding backgrounds with an equation of state more negative than $w = -5/3$, and for contracting backgrounds with an equation of state larger than $w = 1$. For expanding backgrounds that preserve the null energy condition, de Sitter space has the largest rate of growth of complexity (identified as the Lyapunov exponent), and we find a scrambling time that is similar to other estimates up to order one factors.
We study the influence of angular momentum on quantum complexity for CFT states holographically dual to rotating black holes. Using the holographic complexity=action (CA) and complexity=volume (CV) proposals, we study the full time dependence of comp
lexity and the complexity of formation for two dimensional states dual to rotating BTZ. The obtained results and their dependence on angular momentum turn out to be analogous to those of charged states dual to Reissner-Nordstrom AdS black holes. For CA, our computation carefully accounts for the counterterm in the gravity action, which was not included in previous analysis in the literature. This affects the complexity early time dependence and its effect becomes negligible close to extremality. In the grand canonical ensemble, the CA and CV complexity of formation are linear in the temperature, and diverge with the same structure in the speed of light angular velocity limit. For CA the inclusion of the counterterm is crucial for both effects. We also address the problem of studying holographic complexity for higher dimensional rotating black holes, focusing on the four dimensional Kerr-AdS case. Carefully taking into account all ingredients, we show that the late time limit of the CA growth rate saturates the expected bound, and find the CV complexity of formation of large black holes diverges in the critical angular velocity limit. Our holographic analysis is complemented by the study of circuit complexity in a two dimensional free scalar model for a thermofield double (TFD) state with angular momentum. We show how this can be given a description in terms of non-rotating TFD states introducing mode-by-mode effective temperatures and times. We comment on the similarities and differences of the holographic and QFT complexity results.
We explore the two holographic complexity proposals for the case of a 2d boundary CFT with a conformal defect. We focus on a Randall-Sundrum type model of a thin AdS$_2$ brane embedded in AdS$_3$. We find that, using the complexity=volume proposal, t
he presence of the defect generates a logarithmic divergence in the complexity of the full boundary state with a coefficient which is related to the central charge and to the boundary entropy. For the complexity=action proposal we find that the complexity is not influenced by the presence of the defect. This is the first case in which the results of the two holographic proposals differ so dramatically. We consider also the complexity of the reduced density matrix for subregions enclosing the defect. We explore two bosonic field theory models which include two defects on opposite sides of a periodic domain. We point out that for a compact boson, current free field theory definitions of the complexity would have to be generalized to account for the effect of zero-modes.
We study the complexity of Gaussian mixed states in a free scalar field theory using the purification complexity. The latter is defined as the lowest value of the circuit complexity, optimized over all possible purifications of a given mixed state. W
e argue that the optimal purifications only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of mode-by-mode purifications where each mode in the mixed state is purified separately and examine the extent to which such purifications are optimal. We explore the purification complexity for thermal states of a free scalar QFT in any number of dimensions, and for subregions of the vacuum state in two dimensions. We compare our results to those found using the various holographic proposals for the complexity of subregions. We find a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the mutual complexity in the various cases studied in this paper.
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve this prob
lem by brute force search exceeds the estimated computational capacity of the observable universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order $10^{-120}$ in a randomly generated $10^9$-dimensional ADK landscape.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
