Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24434

Beyond low-dissipation regime: general condition for Curzon-Ahlborn efficiency

Yuki Izumida
View original source ↗Read source document ↗Export metadata ↓

Abstract

In recent years, physicists have extensively investigated the universality of Curzon-Ahlborn (CA) efficiency as the efficiency at maximum power of heat engines, which, like Carnot efficiency, is determined only by heat-bath temperatures. While the universality of the CA efficiency to the first order in the temperature difference is established within linear response theory in the inverse operation time, it is generally lost at quadratic order. In the low-dissipation Carnot heat engine model known as the standard framework, the symmetric dissipation condition is necessary. Yet, it is not a necessary condition as the original CA model that adopts endoreversibility does not require such symmetry. In this study, we extend the low-dissipation model to include nonlinear response in the inverse operation time and derive a general condition under which the CA efficiency is recovered in the quadratic order. The generalized symmetric dissipation condition and the CA model with Newton's law of cooling are shown to be special cases of this condition. By applying the obtained condition, we also clarify the condition under which an endoreversible model with a general heat-transfer law exhibits the CA efficiency.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuki Izumida. 2026-10-17. Beyond low-dissipation regime: general condition for Curzon-Ahlborn efficiency. https://arxiv.org/abs/2610.24434

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

KEEP EXPLORING

Related papers

arXiv2026

Renormalization-Group Fixed Points Not Associated with Universality Classes

Universality classes have recently been identified for self-similar solutions of nonlinear partial differential equations (PDEs) as consequences of repeated renormalization-group (RG) transformations that eliminate irrelevant structures. Whether all RG fixed points are associated with universality classes, however, remains unclear. We address this question by extending a recently proposed predictive RG framework to traveling-wave solutions, using the Burgers and Korteweg--de Vries (KdV) equations as examples. Traveling waves can be mapped onto self-similar forms via a logarithmic transformation. Applying the predictive RG to the log-transformed governing equations yields an RG-flow analysis that reproduces shock and soliton solutions, thereby identifying traveling waves as RG fixed points and the logarithmic variable as RG-flow time. Although the predictive RG framework has shown that self-similar fixed points are associated with universality classes, we find that the present traveling-wave fixed points do not produce the irrelevant structures whose elimination normally gives rise to universality classes. This failure originates from the logarithmic representation, which renders analytic local functions of the field and its derivatives scale invariant, thereby preventing the emergence of irrelevant structures. Traveling waves thus provide explicit examples of RG fixed points without universality classes. These observations suggest that the absence of universality classes may be generic for traveling-wave RG fixed points formulated through logarithmic coordinates. The absence of universality classes suggests that information associated with initial conditions may persist asymptotically, promoting memory retention. The Burgers and KdV examples suggest that memory of initial conditions can survive RG transformations, although its form remains system dependent.

cond-mat.stat-mech↗
arXiv2026

Maximum-Temperature Theorem for a Nanothermometer

The steady-state temperature predicted for an ideal point heat source diverges in conventional heat-conduction theory, but no physical thermometer measures a point value. We derive a sharp, shape-independent upper bound on the quasi-steady temperature rise of a sensor with thermometric volume $V_\mathrm{s}$, placed anywhere inside a region enclosed by an isothermal reference surface. The bound requires only the total heat power generated in the region $\dot{Q}$, a lower bound on its thermal conductivity $κ_\mathrm{m}$, and the value of $V_\mathrm{s}$. It is otherwise independent of the heat-source distribution, domain shape, and source--sensor distance. For $\dot{Q}=50~\mathrm{pW}$, $κ_\mathrm{m} = 0.1~\mathrm{W\,m^{-1}K^{-1}}$, and $V_\mathrm{s}=10^{-22}\mathrm{\,m^3}$, approximately the volume of a $60~\mathrm{nm}$-diameter sphere, the theorem permits a maximum temperature rise of approximately $2~\mathrm{mK}$ above the reference level. The result applies directly to nanodiamonds, upconversion nanoparticles, fluorescent polymer particles, and core-shell quantum dots. It shows that neither source localization nor uncertain source-sensor separation can account for kelvin-scale readings under steady-state heat conduction.

cond-mat.stat-mech↗
arXiv2026

Energy-optimal scheduling for clocked reversible computing

Computational dissipation may arise from both information erasure and finite-time operation, although both contributions can in principle be avoided in the absence of space and time constraints. Logically reversible computation can replace erasure with ancilla cleanup, and slow adiabatic protocols can eliminate any excess finite-time dissipation. Under limited memory and in finite time, however, choosing reversible cleanup over erasure requires additional dissipative operations, creating a semi-reversible energy--memory--time tradeoff. We formulate this tradeoff at a fixed operating point of an externally clocked thermally coupled computer, where reversible checkpoint moves and local irreversible erasures have specified effective prices $ε_R$ and $ε_I$. Their ratio $λ=ε_I/ε_R$ selects an energy-optimal semi-reversible schedule under a checkpoint-memory bound by trading reversible moves against erasures. For a sequential computation whose dependency graph is a line, we derive an exact separator recurrence and prove that an asymptotically optimal schedule repeats a strictly reversible block followed by one local erasure. Coupling this scheduling theorem to a stochastic-thermodynamic constitutive model shows how temperature, primitive duration, memory, and device-dependent operation costs determine whether the optimal schedule uses reversible cleanup, elective erasures, or erasure at every disposal.

cond-mat.stat-mech↗