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

Quasiclassical Coarse Graining and Thermodynamic Entropy

329   0   0.0 ( 0 )
 نشر من قبل James B. Hartle
 تاريخ النشر 2006
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Murray Gell-Mann




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

Our everyday descriptions of the universe are highly coarse-grained, following only a tiny fraction of the variables necessary for a perfectly fine-grained description. Coarse graining in classical physics is made natural by our limited powers of observation and computation. But in the modern quantum mechanics of closed systems, some measure of coarse graining is inescapable because there are no non-trivial, probabilistic, fine-grained descriptions. This essay explores the consequences of that fact. Quantum theory allows for various coarse-grained descriptions some of which are mutually incompatible. For most purposes, however, we are interested in the small subset of ``quasiclassical descriptions defined by ranges of values of averages over small volumes of densities of conserved quantities such as energy and momentum and approximately conserved quantities such as baryon number. The near-conservation of these quasiclassical quantities results in approximate decoherence, predictability, and local equilibrium, leading to closed sets of equations of motion. In any description, information is sacrificed through the coarse graining that yields decoherence and gives rise to probabilities for histories. In quasiclassical descriptions, further information is sacrificed in exhibiting the emergent regularities summarized by classical equations of motion. An appropriate entropy measures the loss of information. For a ``quasiclassical realm this is connected with the usual thermodynamic entropy as obtained from statistical mechanics. It was low for the initial state of our universe and has been increasing since.



قيم البحث

اقرأ أيضاً

85 - Thomas J. Elliott 2021
Stochastic modelling of complex systems plays an essential, yet often computationally intensive role across the quantitative sciences. Recent advances in quantum information processing have elucidated the potential for quantum simulators to exhibit m emory advantages for such tasks. Heretofore, the focus has been on lossless memory compression, wherein the advantage is typically in terms of lessening the amount of information tracked by the model, while -- arguably more practical -- reductions in memory dimension are not always possible. Here we address the case of lossy compression for quantum stochastic modelling of continuous-time processes, introducing a method for coarse-graining in quantum state space that drastically reduces the requisite memory dimension for modelling temporal dynamics whilst retaining near-exact statistics. In contrast to classical coarse-graining, this compression is not based on sacrificing temporal resolution, and brings memory-efficient, high-fidelity stochastic modelling within reach of present quantum technologies.
In studying the predictability of emergent phenomena in complex systems, Israeli & Goldenfeld (Phys. Rev. Lett., 2004; Phys. Rev. E, 2006) showed how to coarse-grain (elementary) cellular automata (CA). Their algorithm for finding coarse-grainings of supercell size $N$ took doubly-exponential $2^{2^N}$-time, and thus only allowed them to explore supercell sizes $N leq 4$. Here we introduce a new, more efficient algorithm for finding coarse-grainings between any two given CA that allows us to systematically explore all elementary CA with supercell sizes up to $N=7$, and to explore individual examples of even larger supercell size. Our algorithm is based on a backtracking search, similar to the DPLL algorithm with unit propagation for the NP-complete problem of Boolean Satisfiability.
We explore a systematic approach to studying the dynamics of evolving networks at a coarse-grained, system level. We emphasize the importance of finding good observables (network properties) in terms of which coarse grained models can be developed. W e illustrate our approach through a particular social network model: the rise and fall of a networked society [1]: we implement our low-dimensional description computationally using the equation-free approach and show how it can be used to (a) accelerate simulations and (b) extract system-level stability/bifurcation information from the detailed dynamic model. We discuss other system-level tasks that can be enabled through such a computer-assisted coarse graining approach.
We extend classical coarse-grained entropy, commonly used in many branches of physics, to the quantum realm. We find two coarse-grainings, one using measurements of local particle numbers and then total energy, and the second using local energy measu rements, which lead to an entropy that is defined outside of equilibrium, is in accord with the thermodynamic entropy for equilibrium systems, and reaches the thermodynamic entropy in the long-time limit, even in genuinely isolated quantum systems. This answers the long-standing conceptual problem, as to which entropy is relevant for the formulation of the second thermodynamic law in closed quantum systems. This entropy could be in principle measured, especially now that experiments on such systems are becoming feasible.
We develop a systematic coarse graining procedure for systems of $N$ qubits. We exploit the underlying geometrical structures of the associated discrete phase space to produce a coarse-grained version with reduced effective size. Our coarse-grained s paces inherit key properties of the original ones. In particular, our procedure naturally yields a subset of the original measurement operators, which can be used to construct a coarse discrete Wigner function. These operators also constitute a systematic choice of incomplete measurements for the tomographer wishing to probe an intractably large system.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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