最优工作抽取与最小描述长度原则
Optimal Work Extraction and the Minimum Description Length Principle
摘要:
我们讨论从经典信息引擎中提取工作(例如,Szilárd)与$N$ -粒子,$q$分区,和初始任意非平衡态。特别是,我们专注于他们的{ \em最佳}行为,其中包括测量一组数量$Φ$与反馈协议,提取最大的平均工作量。我们表明,最佳的非平衡态,发动机应被驱动之前的测量是由归一化的最大似然概率分布的统计模型,承认$Φ$作为足够的统计。此外,我们表明,极大极小通用代码冗余$\mathcal{R}^*$与此模型,提供了一个上限的工作,恶魔可以提取平均周期,单位为$k_{\rm B}T$。我们还发现,在$N$大的限制,最大的平均提取工作不能超过$H[Φ]/2$,即半倍的香农熵的测量。我们的研究结果建立了随机热力学中的最优功提取和最优通用数据压缩之间的联系,为最优信息引擎提供了设计原则。特别是,他们建议:(i)最佳编码是高效的,(ii)它是必不可少的驱动系统进入临界状态,以实现最佳性能。
英文摘要:
We discuss work extraction from classical information engines (e.g., Szilárd) 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 $Φ$ 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 $Φ$ 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[Φ]/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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。