Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cond-mat > arXiv:2510.03900

Help | Advanced Search

Condensed Matter > Statistical Mechanics

arXiv:2510.03900 (cond-mat)
[Submitted on 4 Oct 2025 ]

Title: Optimal Computation from Fluctuation Responses

Title: 从涨落响应中进行最优计算

Authors:Jinghao Lyu, Kyle J. Ray, James P. Crutchfield
Abstract: The energy cost of computation has emerged as a central challenge at the intersection of physics and computer science. Recent advances in statistical physics -- particularly in stochastic thermodynamics -- enable precise characterizations of work, heat, and entropy production in information-processing systems driven far from equilibrium by time-dependent control protocols. A key open question is then how to design protocols that minimize thermodynamic cost while ensur- ing correct outcomes. To this end, we develop a unified framework to identify optimal protocols using fluctuation response relations (FRR) and machine learning. Unlike previous approaches that optimize either distributions or protocols separately, our method unifies both using FRR-derived gradients. Moreover, our method is based primarily on iteratively learning from sampled noisy trajectories, which is generally much easier than solving for the optimal protocol directly from a set of governing equations. We apply the framework to canonical examples -- bit erasure in a double-well potential and translating harmonic traps -- demonstrating how to construct loss functions that trade-off energy cost against task error. The framework extends trivially to underdamped systems, and we show this by optimizing a bit-flip in an underdamped system. In all computations we test, the framework achieves the theoretically optimal protocol or achieves work costs comparable to relevant finite time bounds. In short, the results provide principled strategies for designing thermodynamically efficient protocols in physical information-processing systems. Applications range from quantum gates robust under noise to energy-efficient control of chemical and synthetic biological networks.
Abstract: 计算的能量成本已成为物理和计算机科学交叉领域的核心挑战。 统计物理的最新进展——特别是随机热力学——使得能够在由时间依赖控制协议驱动的非平衡信息处理系统中精确表征功、热量和熵产生。 一个关键的开放问题是如何设计协议,在确保正确结果的同时最小化热力学成本。 为此,我们开发了一个统一的框架,使用涨落响应关系(FRR)和机器学习来识别最优协议。 与以往分别优化分布或协议的方法不同,我们的方法利用FRR导出的梯度将两者统一起来。 此外,我们的方法主要基于从采样的噪声轨迹中迭代学习,这通常比直接从一组控制方程中求解最优协议要容易得多。 我们将该框架应用于典型示例——双势阱中的位擦除和谐波陷阱的移动——展示了如何构建在能量成本和任务误差之间进行权衡的损失函数。 该框架可以轻松扩展到阻尼不足的系统,并通过优化阻尼不足系统中的位翻转来证明这一点。 在我们测试的所有计算中,该框架实现了理论上最优的协议,或者实现了与相关有限时间界限相当的功耗。 简而言之,这些结果为设计物理信息处理系统中的热力学高效协议提供了有原则的策略。 应用范围包括在噪声下稳健的量子门以及化学和合成生物网络的能量高效控制。
Comments: 10 pages, 6 figures; https://csc.ucdavis.edu/~cmg/compmech/pubs/ffr.htm
Subjects: Statistical Mechanics (cond-mat.stat-mech) ; Machine Learning (cs.LG)
Cite as: arXiv:2510.03900 [cond-mat.stat-mech]
  (or arXiv:2510.03900v1 [cond-mat.stat-mech] for this version)
  https://doi.org/10.48550/arXiv.2510.03900
arXiv-issued DOI via DataCite

Submission history

From: James P. Crutchfield [view email]
[v1] Sat, 4 Oct 2025 18:49:00 UTC (3,265 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cond-mat.stat-mech
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cond-mat
cs
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号