Optimal Computation from Fluctuation Responses

• URL: http://arxiv.org/abs/2510.03900v1
• Date: Sat, 04 Oct 2025 18:49:00 GMT
• Title: Optimal Computation from Fluctuation Responses
• Authors: Jinghao Lyu, Kyle J. Ray, James P. Crutchfield,
• Abstract summary: A key open question is how to design protocols that minimize thermodynamic cost while ensur- ing correct outcomes.<n>We develop a unified framework to identify optimal protocols using fluctuation response relations (FRR) and machine learning.<n>Results provide principled strategies for designing thermodynamically efficient protocols in physical information-processing systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators [0.0]
  We propose a non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing filter.<n>By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit.
  arXiv  Detail & Related papers  (2026-02-23T07:01:30Z)
• A statistical physics framework for optimal learning [1.243080988483032]
  We combine statistical physics with control theory in a unified theoretical framework to identify optimal protocols in neural network models.<n>We formulate the design of learning protocols as an optimal control problem directly on the dynamics order parameters.<n>This framework encompasses a variety of learning scenarios, optimization constraints, and control budgets.
  arXiv  Detail & Related papers  (2025-07-10T16:39:46Z)
• Physics-Informed Neural Networks for Control of Single-Phase Flow Systems Governed by Partial Differential Equations [4.776073133338117]
  We extend the Physics-Informed Neural Nets for Control (PINC) framework to integrate neural networks with physical conservation laws.<n>The PINC model for PDEs is structured into two stages: a steady-state network, which learns equilibrium solutions for a wide range of control inputs, and a transient network, which captures dynamic responses under time-varying boundary conditions.<n>We validate our approach through numerical experiments, demonstrating that the PINC model, which is trained exclusively using physical laws, accurately represents flow dynamics and enables real-time control applications.
  arXiv  Detail & Related papers  (2025-06-06T15:50:19Z)
• Energy shortcut of quantum protocols by optimal control [0.0]
  We introduce an energetically-optimal method inspired by Shortcut-To-Adiabaticity processes.<n>QOSTE produces the same transformation as STA for a given protocol but at the lowest possible energy cost.<n>We show that the minimal energy cost is determined by the length of the geodesic in the rotating frame given by the original protocol.
  arXiv  Detail & Related papers  (2025-03-26T00:46:19Z)
• PearSAN: A Machine Learning Method for Inverse Design using Pearson Correlated Surrogate Annealing [66.27103948750306]
  PearSAN is a machine learning-assisted optimization algorithm applicable to inverse design problems with large design spaces.<n>It uses a Pearson correlated surrogate model to predict the figure of merit of the true design metric.<n>It achieves a state-of-the-art maximum design efficiency of 97%, and is at least an order of magnitude faster than previous methods.
  arXiv  Detail & Related papers  (2024-12-26T17:02:19Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Learning diffusion at lightspeed [4.154846138501937]
  Existing models to learn the diffusion terms from observational data rely on complex bilevel optimization problems. We propose a new simple model, JKOnet*, which bypasses the complexity of existing architectures. JKOnet* minimizes a simple quadratic loss and outperforms other baselines in terms of sample efficiency, computational complexity, and accuracy.
  arXiv  Detail & Related papers  (2024-06-18T13:44:07Z)
• The Predictive Forward-Forward Algorithm [79.07468367923619]
  We propose the predictive forward-forward (PFF) algorithm for conducting credit assignment in neural systems. We design a novel, dynamic recurrent neural system that learns a directed generative circuit jointly and simultaneously with a representation circuit. PFF efficiently learns to propagate learning signals and updates synapses with forward passes only.
  arXiv  Detail & Related papers  (2023-01-04T05:34:48Z)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• Optimizing thermalizations [0.0]
  We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system. We illustrate this by finding optimal protocols in the context of cooling, work extraction and optimal sequences. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols.
  arXiv  Detail & Related papers  (2022-02-25T11:05:39Z)
• Optimal control of quantum thermal machines using machine learning [0.0]
  We show that differentiable programming (DP) can be employed to optimize finite-time thermodynamical processes in a quantum thermal machine. We formulate the STA driving protocol as a constrained optimization task and apply DP to find optimal driving profiles for an appropriate figure of merit. Our method and results demonstrate that ML is beneficial both for solving hard-constrained quantum control problems and for devising and assessing their theoretical groundwork.
  arXiv  Detail & Related papers  (2021-08-27T18:00:49Z)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• Logistic Q-Learning [87.00813469969167]
  We propose a new reinforcement learning algorithm derived from a regularized linear-programming formulation of optimal control in MDPs. The main feature of our algorithm is a convex loss function for policy evaluation that serves as a theoretically sound alternative to the widely used squared Bellman error.
  arXiv  Detail & Related papers  (2020-10-21T17:14:31Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.