اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComplexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions
111
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an information geometric characterization of quantum driving schemes specified by su(2;C) time-dependent Hamiltonians in terms of both complexity and efficiency concepts. By employing a minimum action principle, the optimum path connecting initial and final states on the manifold in finite-time is the geodesic path between the two states. In particular, the total entropy production that occurs during the transfer is minimized along these optimum paths. For each optimum path that emerges from the given quantum driving scheme, we evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency constructed in terms of the constant entropy production rates that specify the entropy minimizing paths being compared. From our analytical estimates of complexity and efficiency, we provide a relative ranking among the driving schemes being investigated. Finally, we conclude by commenting on the fact that an higher entropic speed in quantum transfer processes seems to necessarily go along with a lower entropic efficiency together with a higher information geometric complexity.
قيم البحث
اقرأ أيضاً
The minimum entropy production principle provides an approximative variational characterization of close-to-equilibrium stationary states, both for macroscopic systems and for stochastic models. Analyzing the fluctuations of the empirical distributio
n of occupation times for a class of Markov processes, we identify the entropy production as the large deviation rate function, up to leading order when expanding around a detailed balance dynamics. In that way, the minimum entropy production principle is recognized as a consequence of the structure of dynamical fluctuations, and its approximate character gets an explanation. We also discuss the subtlety emerging when applying the principle to systems whose degrees of freedom change sign under kinematical time-reversal.
We present a simple proof of the minimum time for the quantum evolution between two arbitrary states. This proof is performed in the absence of any geometrical arguments. Then, being in the geometric framework of quantum evolutions based upon the geo
metry of the projective Hilbert space, we discuss the roles played by either minimum-time or maximum-energy uncertainty concepts in defining a geometric efficiency measure of quantum evolutions between two arbitrary quantum states. Finally, we provide a quantitative justification of the validity of the efficiency inequality even when the system passes only through nonorthogonal quantum states.
The minimum cut problem in an undirected and weighted graph $G$ is to find the minimum total weight of a set of edges whose removal disconnects $G$. We completely characterize the quantum query and time complexity of the minimum cut problem in the ad
jacency matrix model. If $G$ has $n$ vertices and edge weights at least $1$ and at most $tau$, we give a quantum algorithm to solve the minimum cut problem using $tilde O(n^{3/2}sqrt{tau})$ queries and time. Moreover, for every integer $1 le tau le n$ we give an example of a graph $G$ with edge weights $1$ and $tau$ such that solving the minimum cut problem on $G$ requires $Omega(n^{3/2}sqrt{tau})$ many queries to the adjacency matrix of $G$. These results contrast with the classical randomized case where $Omega(n^2)$ queries to the adjacency matrix are needed in the worst case even to decide if an unweighted graph is connected or not. In the adjacency array model, when $G$ has $m$ edges the classical randomized complexity of the minimum cut problem is $tilde Theta(m)$. We show that the quantum query and time complexity are $tilde O(sqrt{mntau})$ and $tilde O(sqrt{mntau} + n^{3/2})$, respectively, where again the edge weights are between $1$ and $tau$. For dense graphs we give lower bounds on the quantum query complexity of $Omega(n^{3/2})$ for $tau > 1$ and $Omega(tau n)$ for any $1 leq tau leq n$. Our query algorithm uses a quantum algorithm for graph sparsification by Apers and de Wolf (FOCS 2020) and results on the structure of near-minimum cuts by Kawarabayashi and Thorup (STOC 2015) and Rubinstein, Schramm and Weinberg (ITCS 2018). Our time efficient implementation builds on Kargers tree packing technique (STOC 1996).
The quench dynamics of many-body quantum systems may exhibit non-analyticities in the Loschmidt echo, a phenomenon known as dynamical phase transition (DPT). Despite considerable research into the underlying mechanisms behind this phenomenon, several
open questions still remain. Motivated by this, we put forth a detailed study of DPTs from the perspective of quantum phase space and entropy production, a key concept in thermodynamics. We focus on the Lipkin-Meshkov-Glick model and use spin coherent states to construct the corresponding Husimi-$Q$ quasi-probability distribution. The entropy of the $Q$-function, known as Wehrl entropy, provides a measure of the coarse-grained dynamics of the system and, therefore, evolves non-trivially even for closed systems. We show that critical quenches lead to a quasi-monotonic growth of the Wehrl entropy in time, combined with small oscillations. The former reflects the information scrambling characteristic of these transitions and serves as a measure of entropy production. On the other hand, the small oscillations imply negative entropy production rates and, therefore, signal the recurrences of the Loschmidt echo. Finally, we also study a Gaussification of the model based on a modified Holstein-Primakoff approximation. This allows us to identify the relative contribution of the low energy sector to the emergence of DPTs. The results presented in this article are relevant not only from the dynamical quantum phase transition perspective, but also for the field of quantum thermodynamics, since they point out that the Wehrl entropy can be used as a viable measure of entropy production.
Complex quantum trajectories, which were first obtained from a modified de Broglie-Bohm quantum mechanics, demonstrate that Borns probability axiom in quantum mechanics originates from dynamics itself. We show that a normalisable probability density
can be defined for the entire complex plane, though there may be regions where the probability is not locally conserved. Examining this for some simple examples such as the harmonic oscillator, we also find why there is no appreciable complex extended motion in the classical regime.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
