اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTowards a Geometrization of Quantum Complexity and Chaos
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we show how the restriction of the Quantum Geometric Tensor to manifolds of states that can be generated through local interactions provides a new tool to understand the consequences of locality in physics. After a review of a first result in this context, consisting in a geometric out-of-equilibrium extension of the quantum phase transitions, we argue the opportunity and the usefulness to exploit the Quantum Geometric Tensor to geometrize quantum chaos and complexity.
قيم البحث
اقرأ أيضاً
This article tackles a fundamental long-standing problem in quantum chaos, namely, whether quantum chaotic systems can exhibit sensitivity to initial conditions, in a form that directly generalizes the notion of classical chaos in phase space. We dev
elop a linear response theory for complexity, and demonstrate that the complexity can exhibit exponential sensitivity in response to perturbations of initial conditions for chaotic systems. Two immediate significant results follows: i) the complexity linear response matrix gives rise to a spectrum that fully recovers the Lyapunov exponents in the classical limit, and ii) the linear response of complexity is given by the out-of-time order correlators.
Quantifying quantum states complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits complexity increases. Consid
er constructing a unitary from Haar-random two-qubit quantum gates. Implementing the unitary exactly requires a circuit of some minimal number of gates - the unitarys exact circuit complexity. We prove that this complexity grows linearly in the number of random gates, with unit probability, until saturating after exponentially many random gates. Our proof is surprisingly short, given the established difficulty of lower-bounding the exact circuit complexity. Our strategy combines differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits.
This is the contribution to Quarks2018 conference proceedings. This contribution is devoted to the holographic description of chaos and quantum complexity in the strongly interacting systems out of equilibrium. In the first part of the talk we presen
t different holographic complexity proposals in out-of-equilibrium CFT following the local perturbation. The second part is devoted to the chaotic growth of the local operator size at a finite chemical potential. There are numerous results stating that the chemical potential may lead to the chaos disappearance, and we confirm these results from holographic viewpoint.
There exists a Hamiltonian formulation of the factorisation problem which also needs the definition of a factorisation ensemble (a set to which factorable numbers, $N=xy$, having the same trivial factorisation algorithmic complexity, belong). For the
primes therein, a function $E$, that may take only discrete values, should be the analogous of the energy from a confined system of charges in a magnetic trap. This is the quantum factoring simulator hypothesis connecting quantum mechanics with number theory. In this work, we report numerical evidence of the existence of this kind of discrete spectrum from the statistical analysis of the values of $E$ in a sample of random OpenSSL n-bits moduli (which may be taken as a part of the factorisation ensemble). Here, we show that the unfolded distance probability of these $E$s fits to a {it Gaussian Unitary Ensemble}, consistently as required, if they actually correspond to the quantum energy levels spacing of a magnetically confined system that exhibits chaos. The confirmation of these predictions bears out the quantum simulator hypothesis and, thereby, it points to the existence of a liaison between quantum mechanics and number theory. Shors polynomial time complexity of the quantum factorisation problem, from pure quantum simulation primitives, was obtained.
Considering the scale dependent effective spacetimes implied by the functional renormalization group in d-dimensional Quantum Einstein Gravity, we discuss the representation of entire evolution histories by means of a single, (d + 1)-dimensional mani
fold furnished with a fixed (pseudo-) Riemannian structure. This scale-space-time carries a natural foliation whose leaves are the ordinary spacetimes seen at a given resolution. We propose a universal form of the higher dimensional metric and discuss its properties. We show that, under precise conditions, this metric is always Ricci flat and admits a homothetic Killing vector field; if the evolving spacetimes are maximally symmetric, their (d + 1)-dimensional representative has a vanishing Riemann tensor even. The non-degeneracy of the higher dimensional metric which geometrizes a given RG trajectory is linked to a monotonicity requirement for the running of the cosmological constant, which we test in the case of Asymptotic Safety.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
