arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.04191cond-mat.stat-mech
收藏

广义Szilárd引擎中的最优功提取和互信息

Optimal work extraction and mutual information in a generalized Szilárd engine

Juyong Song, Susanne Still, Rafael Díaz Hernández Rojas, Isaac Pérez Castillo, Matteo Marsili

摘要:

西拉德在1929年提出的Gedanken实验,通常被称为“西拉德引擎”,是计算信息处理基本热力学边界的基础。虽然Szilárd的原始盒子可以分为两半,并包含一个气体分子,我们在这里计算的最大平均功,可以提取在一个系统中的$N$粒子和$q$分区,给定一个观察员计数的分子在每个分区,并给出一个工作提取机制,这是有限的压力均衡。我们发现,平均提取的工作是成比例的一个粒子的位置和包含有多少粒子在每个分区的计数的向量之间的互信息。我们优化这个数量的初始位置的隔离墙,并发现存在一个临界数量的粒子$N^{\star}(q)$低于该提取的工作是最大化的对称配置的$q$分区,并在其以上的最佳分区是不对称的。总的来说,对于具有对称分区的多个粒子$\hat{N}(q)<N^{\star}(q)$,平均提取功最大化。我们计算$N\rightarrow \infty$的渐近值。

英文摘要:

A 1929 Gedankenexperiment proposed by Szilárd, often referred to as "Szilárd's engine", has served as a foundation for computing fundamental thermodynamic bounds to information processing. While Szilárd's original box could be partitioned into two halves and contains one gas molecule, we calculate here the maximal average work that can be extracted in a system with $N$ particles and $q$ partitions, given an observer which counts the molecules in each partition, and given a work extraction mechanism that is limited to pressure equalization. We find that the average extracted work is proportional to the mutual information between the one-particle position and the vector containing the counts of how many particles are in each partition. We optimize this quantity over the initial locations of the dividing walls, and find that there exists a critical number of particles $N^{\star}(q)$ below which the extracted work is maximized by a symmetric configuration of the $q$ partitions, and above which the optimal partitioning is asymmetric. Overall, the average extracted work is maximized for a number of particles $\hat{N}(q)<N^{\star}(q)$, with a symmetric partition. We calculate asymptotic values for $N\rightarrow \infty$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑