اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAbove and Beyond the Landauer Bound: Thermodynamics of Modularity
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Information processing typically occurs via the composition of modular units, such as universal logic gates. The benefit of modular information processing, in contrast to globally integrated information processing, is that complex global computations are more easily and flexibly implemented via a series of simpler, localized information processing operations which only control and change local degrees of freedom. We show that, despite these benefits, there are unavoidable thermodynamic costs to modularity---costs that arise directly from the operation of localized processing and that go beyond Landauers dissipation bound for erasing information. Integrated computations can achieve Landauers bound, however, when they globally coordinate the control of all of an information reservoirs degrees of freedom. Unfortunately, global correlations among the information-bearing degrees of freedom are easily lost by modular implementations. This is costly since such correlations are a thermodynamic fuel. We quantify the minimum irretrievable dissipation of modular computations in terms of the difference between the change in global nonequilibrium free energy, which captures these global correlations, and the local (marginal) change in nonequilibrium free energy, which bounds modular work production. This modularity dissipation is proportional to the amount of additional work required to perform the computational task modularly. It has immediate consequences for physically embedded transducers, known as information ratchets. We show how to circumvent modularity dissipation by designing internal ratchet states that capture the global correlations and patterns in the ratchets information reservoir. Designed in this way, information ratchets match the optimum thermodynamic efficiency of globally integrated computations.
قيم البحث
اقرأ أيضاً
Many systems can be decomposed into a set of subsystems, where the dynamics of each subsystem only depends on some of the other subsystems rather than on all of them. Here I derive an infinite set of lower bounds on the entropy production of any such
composite system, in terms of the initial distribution of its states, the ending distribution, and the dependencies of the dynamics of its subsystems. In contrast to previous results, these new bounds hold for arbitrary dependencies among the subsystems, not only for the case where the subsystems evolve independently. Moreover, finding the strongest of these new lower bounds is a linear programming problem. As I illustrate, often this maximal lower bound is stronger than the conventional Landauer bound, since the conventional Landauer bound does not account for the dependency structure.
We study self-organisation of collective motion as a thermodynamic phenomenon, in the context of the first law of thermodynamics. It is expected that the coherent ordered motion typically self-organises in the presence of changes in the (generalised)
internal energy and of (generalised) work done on, or extracted from, the system. We aim to explicitly quantify changes in these two quantities in a system of simulated self-propelled particles, and contrast them with changes in the systems configuration entropy. In doing so, we adapt a thermodynamic formulation of the curvatures of the internal energy and the work, with respect to two parameters that control the particles alignment. This allows us to systematically investigate the behaviour of the system by varying the two control parameters to drive the system across a kinetic phase transition. Our results identify critical regimes and show that during the phase transition, where the configuration entropy of the system decreases, the rates of change of the work and of the internal energy also decrease, while their curvatures diverge. Importantly, the reduction of entropy achieved through expenditure of work is shown to peak at criticality. We relate this both to a thermodynamic efficiency and the significance of the increased order with respect to a computational path. Additionally, this study provides an information-geometric interpretation of the curvature of the internal energy as the difference between two curvatures: the curvature of the free entropy, captured by the Fisher information, and the curvature of the configuration entropy.
We investigate the thermodynamics of simple (non-interacting) transport models beyond the scope of weak coupling. For a single fermionic or bosonic level -- tunnel-coupled to two reservoirs -- exact expressions for the stationary matter and energy cu
rrent are derived from the solutions of the Heisenberg equations of motion. The positivity of the steady-state entropy production rate is demonstrated explicitly. Finally, for a configuration in which particles are pumped upwards in chemical potential by a downward temperature gradient, we demonstrate that the thermodynamic efficiency of this process decreases when the coupling strength between system and reservoirs is increased, as a direct consequence of the loss of a tight coupling between energy and matter currents.
The clean world of digital information is based on noisy physical devices. Landauers principle provides a deep connection between information processing and the underlying thermodynamics by setting a lower limit on the energy consumption and heat pro
duction of logically irreversible transformations. While Landauers original formulation assumes equilibrium, real devices often do operate far from equilibrium. We show experimentally that the nonequilibrium character of a memory state enables full erasure with reduced power consumption as well as negative heat production. We implement the optimized erasure protocols in an optomechanical two-state memory. To this end, we introduce dynamical shaping of nonlinear potential landscapes as a powerful tool for levitodynamics as well as the investigation of far-from-equilibrium processes.
We discuss work extraction from classical information engines (e.g., Szilard) with $N$-particles, $q$ partitions, and initial arbitrary non-equilibrium states. In particular, we focus on their {em optimal} behaviour, which includes the measurement of
a set of quantities $Phi$ with a feedback protocol that extracts the maximal average amount of work. We show that the optimal non-equilibrium state to which the engine should be driven before the measurement is given by the normalised maximum-likelihood probability distribution of a statistical model that admits $Phi$ as sufficient statistics. Furthermore, we show that the minimax universal code redundancy $mathcal{R}^*$ associated to this model, provides an upper bound to the work that the demon can extract on average from the cycle, in units of $k_{rm B}T$. We also find that, in the limit of $N$ large, the maximum average extracted work cannot exceed $H[Phi]/2$, i.e. one half times the Shannon entropy of the measurement. Our results establish a connection between optimal work extraction in stochastic thermodynamics and optimal universal data compression, providing design principles for optimal information engines. In particular, they suggest that: (i) optimal coding is thermodynamically efficient, and (ii) it is essential to drive the system into a critical state in order to achieve optimal performance.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
