ترغب بنشر مسار تعليمي؟ اضغط هنا

Quantum Complexity as Hydrodynamics

52   0   0.0 ( 0 )
 نشر من قبل Pablo Basteiro
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

As a new step towards defining complexity for quantum field theories, we consider Nielsens geometric approach to operator complexity for the $SU(N)$ group. We develop a tractable large $N$ limit which leads to regular geometries on the manifold of unitaries. To achieve this, we introduce a particular basis for the $mathfrak{su}(N)$ algebra and define a maximally anisotropic metric with polynomial penalty factors. We implement the Euler-Arnold approach to identify incompressible inviscid hydrodynamics on the two-torus as a novel effective theory for the evaluation of operator complexity of large qudits. Moreover, our cost function captures two essential properties of holographic complexity measures: ergodicity and conjugate points. We quantify these by numerically computing the sectional curvatures of $SU(N)$ for finite large $N$. We find a predominance of negatively curved directions, implying classically chaotic trajectories. Moreover, the non-vanishing proportion of positively curved directions implies the existence of conjugate points, as required to bound the growth of holographic complexity with time.

قيم البحث

اقرأ أيضاً

We argue that different formulations of hydrodynamics are related to uncertainties in the definitions of local thermodynamic and hydrodynamic variables. We show that this ambiguity can be resolved by viewing different formulations of hydrodynamics as particular gauge choices which lead to the same physical behavior of the system. Using the example of bulk viscosity, we show that Bemfica-Disconzi-Noronha-Kovtun (BDNK) and Israel-Stewart hydrodynamics are particular gauge choices of this type, related by a well-defined transformation of thermodynamic and hydrodynamic variables. We argue that this gauge ambiguity is necessary to ascertain the causality of stochastic hydrodynamic evolution and conjecture that it could explain the applicability of hydrodynamics outside its expected regime of validity since far from equilibrium and close to equilibrium may be related through transformations of this type.
We find hydrodynamic behavior in large simply spinning five-dimensional Anti-de Sitter black holes. These are dual to spinning quantum fluids through the AdS/CFT correspondence constructed from string theory. Due to the spatial anisotropy introduced by the angular momentum in the system, hydrodynamic transport coefficients split into one group longitudinal and another transverse to the angular momentum. Analytic expressions are provided for the two shear viscosities, the longitudinal momentum diffusion coefficient, two speeds of sound, and two sound attenuation coefficients. Known relations between these coefficients are generalized to include dependence on angular momentum. The shear viscosity to entropy density ratio varies between zero and 1/(4$pi$) depending on the direction of the shear. These results can be applied to heavy ion collisions, in which the most vortical fluid was reported recently. In passing, we show that large simply spinning five-dimensional Myers-Perry black holes are perturbatively stable for all angular momenta below extremality.
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using Nielsens geomet rical approach. We investigate a choice of penalties which, compared to previous definitions, increases in a more progressive way with the number of qubits simultaneously entangled by a given operation. This choice turns out to be free from singularities. We also analyze the relation between operator and state complexities, framing the discussion with the language of Riemannian submersions. This provides a direct relation between geodesics and curvatures in the unitaries and the states spaces, which we also exploit to give a closed-form expression for the metric on the states in terms of the one for the operators. Finally, we study conjugate points for a large number of qubits in the unitary space and we provide a strong indication that maximal complexity scales exponentially with the number of qubits in a certain regime of the penalties space.
The continuous min flow-max cut principle is used to reformulate the complexity=volume conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the volume of t he homologous maximal bulk Cauchy slice. The nesting property is used to show the rate of complexity is bounded below by conditional complexity, describing a multi-step optimization with intermediate and final target states. Conceptually, discretized Lorentzian flows are interpreted in terms of threads or gatelines such that complexity is equal to the minimum number of gatelines used to prepare a CFT state by an optimal tensor network (TN) discretizing the state. We propose a refined measure of complexity, capturing the role of suboptimal TNs, as an ensemble average. The bulk symplectic potential provides a canonical thread configuration characterizing perturbations around arbitrary CFT states. Its consistency requires the bulk to obey linearized Einsteins equations, which are shown to be equivalent to the holographic first law of complexity, thereby advocating a notion of spacetime complexity.
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of t he shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many-body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of a computation, it is notoriously difficult to derive lower bounds on quantum complexity for particular unitaries or states without making additional assumptions. To go further, one may study more generic models of complexity growth. We provide a rigorous connection between complexity growth and unitary $k$-designs, ensembles which capture the randomness of the unitary group. This connection allows us to leverage existing results about design growth to draw conclusions about the growth of complexity. We prove that local random quantum circuits generate unitary transformations whose complexity grows linearly for a long time, mirroring the behavior one expects in chaotic quantum systems and verifying conjectures by Brown and Susskind. Moreover, our results apply under a strong definition of quantum complexity based on optimal distinguishing measurements.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا