SearcharxivSearch

arXiv · 2607.11877

Slow is fast: raising barriers to accelerate thermal relaxation

Abstract

For a reversible system relaxing to equilibrium, the obvious fastest strategy is to lower all kinetic barriers (open all gates). We find that such intuition holds at three levels: the all-open-gate strategy achieves the highest local conductance, it maximizes the instantaneous speed of approach in every $f$-divergence, and it simultaneously maximizes all relaxation eigenvalues. Nevertheless, we show that a counter-intuitive finite-time optimum lies beyond this intuition and operates at a fourth level, invisible to all three: eigenvector rotation. Noncommutativity enables timed schedules to reproject residual amplitudes across relaxation modes, thereby achieving faster relaxation. Optimal schedules are bang--bang. In our illustrative example, the best-found schedule also employs counter-gating, transiently raising selected barriers, and reduces the terminal residual by a factor of $130$ relative to all-open, and by $7$ relative to the best static landscape. A no-go theorem shows that noncommutativity is necessary: commuting generators collapse every schedule to a static time-averaged landscape, worse than the intuitive static control. In the reverse problem, the dual schedule preserves nonequilibrium free energy far more effectively than intuitively keeping all barriers at maximum heights. Whether accelerating or delaying relaxation, barrier control performs no work on the reduced Markov system; it only re-times a fixed total dissipation budget.

Explore related subjects

Keep this discovery

BibTeXRIS

Yubo Wang, Zhiyue Lu. 2026-07-13. Slow is fast: raising barriers to accelerate thermal relaxation. https://arxiv.org/abs/2607.11877

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech