betaFeedback

WorksPhysics and Astronomy

Finite-time Mpemba crossings with imperfect preparation

Abstract

Two preparations evolving under the same thermal Markov generator can reverse their ordering in relative entropy even when the hotter state retains a nonzero slow-mode component. We derive a sufficient finite-time crossing condition for arbitrary finite irreducible reversible systems. The condition compares the preparations' weights in the entire slowest eigenspace, including degeneracies, and gives an explicit upper bound using the separation from the next distinct decay rate. Exact finite-amplitude entropy comparisons also yield all-mode enclosures and bounds based on a retained spectrum with a controlled omitted tail. A preparation-error inequality converts finite-time sign margins into explicit probability tolerances; extensions account for temperature, generator, and stationary-reference uncertainty. We test the bounds on 2000 predefined network draws with four graph families and 4–64 states. There are 86 numerically located crossings, of which 45 satisfy the simple sufficient condition. In a selected eight-state example, retaining two nonstationary modes certifies a crossing before 1.55163, improving a certified slow-sector endpoint of 2.53951; the located crossing is near 1.26943. A reflecting diffusion in an asymmetric potential supplies a separate physical example, with systematic mesh refinement. Independent interval arithmetic certifies selected spectral bounds, finite-grid first crossings, and an entire preparation-temperature rectangle in a three-state benchmark. The theorem does not require exact slow-mode cancellation, while its numerical sharpness and detection coverage remain model dependent. These results concern relative-entropy relaxation and do not predict water-freezing times.

Introduction

The Mpemba effect challenges the expectation that a preparation farther from equilibrium must take longer to relax. Its original formulation concerned hot and cold water [1, 2], but a controlled statistical-mechanical question can be stated without phase change: prepare two distributions and evolve them with the same final generator. The hotter preparation may initially have a larger distance to the common stationary state and later have a smaller one. Reversible Markov dynamics provide a precise setting for this comparison [3].

The general spectral mechanism is already established. Relaxation rates belong to the final generator, whereas the amplitudes of its modes depend on the initial preparation. A reduced slow-mode overlap can produce anomalous ordering, and cancellation of the slowest active sector gives the strong Mpemba effect [3, 4]. Anomalous relaxation of this kind has been predicted in granular fluids [5, 6], spin glasses [7], Langevin dynamics [8], and open and many-body quantum systems [9, 10, 11], and observed in colloids [12, 13] and trapped ions [14, 15]. Inverse and precooling effects [13, 16, 17] and heating–cooling asymmetries [18, 19, 20, 21] belong to the same broad family of relaxation speedups [22].

Finite preparation accuracy raises a separate question. Exact removal of a slow component is an ideal condition: a residual amplitude restores that asymptotic decay rate. An ordinary finite-time crossing can nevertheless persist. Establishing this persistence requires a comparison over a specified time interval, rather than only an asymptotic exponent. Preparation-error sensitivity has also been studied in quantum Mpemba models [23], and finite-time criteria occur in quantum imaginary-time evolution [24]. The present setting is a classical reversible semigroup with relative entropy as the specified distance.

Relative entropy is attractive because, for a Gibbs stationary state, it equals the excess nonequilibrium free energy divided by the bath temperature. Its derivative is minus the dimensionless entropy-production rate [25, 26], the central quantity of stochastic thermodynamics [27, 28], whose exact time dependence, together with the entropy-extraction rate, has been obtained for Brownian particles, motors, and heat engines [29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]. Entropy dissipation and functional inequalities already constrain relaxation durations [40, 41, 42, 43]. A global decay constant, however, does not retain the different mode weights of a particular pair of preparations. Conversely, a quadratic entropy approximation is useful near equilibrium but needs an explicit error bound before it can certify a crossing at finite amplitude.

We use the established bounded-likelihood-ratio comparison between relative entropy and chi-squared divergence [44]. Combining this static inequality with the Markov maximum principle provides exact time-dependent entropy envelopes. Their slow-sector form gives a transparent sufficient condition, denoted Γ>0\Gamma> 0, and an explicit time by which the initial ordering has reversed. Their all-mode form retains more of the spectrum, while a nonnegative remainder bound allows controlled use of only part of it. Degenerate slow eigenspaces are treated as a whole.

We then quantify robustness. A centered entropy-gradient estimate and probability contraction translate a prescribed preparation error into a uniform entropy error. Positive separation throughout an early interval, together with negative separation at a later endpoint, gives a robust first-meeting interval. Temperature and rate uncertainty require additional bounds, including the change of stationary reference when the generator changes. The proof identifies these requirements explicitly.

Our main results are as follows. (i) Theorem 1: for any finite reversible chain, a positive slow-sector margin Γ\Gamma guarantees a crossing and gives an explicit upper time, without exact slow-mode cancellation (Figure 1). (ii) All-mode and partial-spectrum enclosures that tighten this time using more spectral information, with a controlled omitted tail. (iii) Theorem 2 and its corollaries: explicit tolerances for preparation, temperature, and rate errors, and a local sensitivity formula expressed through the normalized entropy-production rates. (iv) Tests on 2000 reversible networks with 4 to 64 states and on a reflecting diffusion, together with interval-arithmetic certificates, including a whole region of preparation temperatures (Figure 4).

Figure 1. How Theorem 1 works, for the three-state benchmark of Sec. VIII at (TH,TC)=(3,1.5)(T_H,T_C)=(3,1.5), which is not an exactly strong preparation. (a) Squared mode weights: the hot preparation has a much larger fast weight qHq_H but a slow weight wHw_H about 35 times smaller than wCw_C. (b) Relative entropies (lines) inside their exact finite-amplitude envelopes, Eq. (22) (shaded); the dot is the crossing tM≃0.1702t_M \simeq0.1702 and the dotted line the bound Tup≃0.1849T_{\mathrm{up}} \simeq0.1849. (c) The entropy difference multiplied by e2λste^{2\lambda_s t} (solid) and its upper bound from Eq. (26) (dashed). The bound becomes negative exactly at TupT_{\mathrm{up}} and tends to −Γ-\Gamma; the true difference changes sign earlier. A symmetric-logarithmic vertical scale resolves both signs.

Figure 4. Located crossing time of the three-state benchmark over the plane of preparation temperatures (double precision; gray: TH<TCT_H < T_C or no crossing located). The blue contour is Γ=0\Gamma= 0, with Γ>0\Gamma> 0 inside; the dashed line marks T⋆T_\star, where the hot slow weight vanishes. The black box is the rectangle of Eq. (67), in which every pair is certified by interval arithmetic to have its first crossing in (0.161,0.179)(0.161, 0.179).

A companion manuscript develops the entropy-production-clock interpretation and a tightly certified three-state benchmark, and states the slow-sector comparison and preparation corollary in compact form [45]. Here we give a self-contained treatment of the general finite-state problem, the all-mode and partial-spectrum construction, parameter robustness, predefined network ensembles, and a physical diffusion model. The shared comparison ingredients are stated explicitly; the additional scope and numerical tests are the focus of this study.

The numerical work separates three kinds of evidence: evaluations in ordinary floating-point arithmetic, mesh and algorithm comparisons, and outward-rounded interval certificates. The network sample measures performance within a declared ensemble, not the prevalence of the effect among all Markov systems. Likewise, a finite-grid diffusion certificate is not a proof of a continuum limit. The ordering considered throughout is relative entropy; a simultaneous ordering of all monotones is a different question addressed by thermomajorization [46].

Common dynamics, preparations, and thermodynamic distance

A fixed reversible Markov system

Consider N≥2N \ge2 states with transition rates kijk_{ij} for a jump from ii to jj. The probabilities are column vectors and obey

p˙i=∑j≠i(kjipj−kijpi),p˙=Wp.(1)\dot{p}_i=\sum_{j\ne i}(k_{ji}p_j-k_{ij}p_i),\qquad\dot{p}=Wp. \tag*{(1)}

Thus Wij=kjiW_{ij}=k_{ji} for i≠ji\ne j and Wii=−∑j≠ikijW_{ii}=-\sum_{j\ne i}k_{ij}; every column of WW sums to zero. We assume a finite, irreducible chain with a positive stationary distribution π\pi and detailed balance,

Wπ=0,πikij=πjkji.(2)W\pi=0,\qquad\pi_i k_{ij}=\pi_j k_{ji}. \tag*{(2)}

The graph may be sparse, provided it is connected. Both preparations evolve with precisely this same time-independent generator:

pα(t)=eWtpα(0),α=H,C.(3)p^\alpha(t)=e^{Wt}p^\alpha(0),\qquad\alpha=H,C. \tag*{(3)}

The rates belong to the final dynamics; the preparations determine their mode amplitudes. This is the standard spectral setting for the Markovian Mpemba effect [3, 4, 47, 48].

The crossing bounds apply to arbitrary strictly positive initial distributions satisfying the entropy ordering specified below. A thermal realization has fixed energies EiE_i, bath temperature TbT_b, and

πi=e−Ei/TbZ(Tb),piα(0)=e−Ei/TαZ(Tα),TH>TC>Tb.(4)\pi_i=\frac{e^{-E_i/T_b}}{Z(T_b)},\qquad p_i^\alpha(0)=\frac{e^{-E_i/T_\alpha}}{Z(T_\alpha)},\qquad T_H>T_C>T_b. \tag*{(4)}

where Z(T)=∑ie−Ei/TZ(T)=\sum_i e^{-E_i/T} and kB=1k_{\mathrm{B}}=1. Temperature labels refer to these initial equilibria; an evolving nonequilibrium distribution need not have a unique temperature.

Entropy, a first meeting, and the normalized decay rate

Use natural logarithms and the relative entropy

Dα(t)=D[pα(t)∥π]=∑ipiα(t)ln⁡piα(t)πi.(5)D_\alpha(t)=D[p^\alpha(t)\Vert\pi]=\sum_i p_i^\alpha(t)\ln\frac{p_i^\alpha(t)}{\pi_i}. \tag*{(5)}

For a Gibbs stationary state, define F[p]=∑ipiEi+Tb∑ipiln⁡pi\mathcal{F}[p]=\sum_i p_iE_i+T_b\sum_i p_i\ln p_i. Then

F[p]−F[π]=TbD[p∥π].(6)\mathcal{F}[p]-\mathcal{F}[\pi]=T_bD[p\Vert\pi]. \tag*{(6)}

Relative entropy therefore measures excess free energy in units of TbT_b. For canonical cooling with nonconstant energies, DH(0)>DC(0)D_H(0)>D_C(0) follows directly from TH>TC>TbT_H>T_C>T_b; the derivative calculation is given in Appendix A.

With currents Jij=kijpi−kjipjJ_{ij}=k_{ij}p_i-k_{ji}p_j, the system entropy S=−∑ipiln⁡piS=-\sum_i p_i\ln p_i obeys the balance

S˙=e˙p−h˙d,e˙p=12∑i,jJijln⁡kijpikjipj≥0,\dot{S}=\dot{e}_p-\dot{h}_d,\qquad\dot{e}_p=\frac{1}{2}\sum_{i,j}J_{ij}\ln\frac{k_{ij}p_i}{k_{ji}p_j}\ge0,
h˙d=12∑i,jJijln⁡kijkji.(7)\dot{h}_d=\frac{1}{2}\sum_{i,j}J_{ij}\ln\frac{k_{ij}}{k_{ji}}. \tag*{(7)}

where e˙p\dot{e}_p is the dimensionless entropy-production rate and h˙d\dot{h}_d the entropy-extraction (heat-dissipation) rate into the bath [25, 26, 27, 28]. Sums over edges omit absent transitions. Under detailed balance ln⁡(kij/kji)=(Ei−Ej)/Tb\ln(k_{ij}/k_{ji})=(E_i-E_j)/T_b, so h˙d=−U˙/Tb\dot{h}_d=-\dot{U}/T_b, and since D=−S+U/Tb+ln⁡Z(Tb)D=-S+U/T_b+\ln Z(T_b) the balance yields the standard identity

−D˙α=e˙pα,rα=e˙pαDα=−ddtln⁡Dα.(8)-\dot{D}_\alpha=\dot{e}_p^\alpha,\qquad r_\alpha=\frac{\dot{e}_p^\alpha}{D_\alpha}=-\frac{\mathrm{d}}{\mathrm{d}t}\ln D_\alpha. \tag*{(8)}

Both initial entropies are assumed nonzero, and we impose

DH(0)>DC(0)>0,d(t)=DH(t)−DC(t).(9)D_H(0)>D_C(0)>0,\qquad d(t)=D_H(t)-D_C(t). \tag*{(9)}

At any finite time a nonstationary preparation remains nonstationary, because eWte^{Wt} is invertible. Hence the rates in Eq. (8) remain defined.

Let

tM=inf⁡{t>0:d(t)=0},(10)t_M=\inf\{t>0:d(t)=0\}, \tag*{(10)}

with tM=∞t_M=\infty when the set is empty; tMt_M is the first-passage time of the deterministic difference d(t)d(t) through zero [49, 50, 51, 52]. A meeting can be a tangency; a Mpemba reversal additionally requires d<0d<0 afterward. Our sufficient theorem below guarantees a strict reversed ordering after a finite upper bound, but does not assume uniqueness of earlier meetings. Integrating Eq. (8) gives

Θα(t)=∫0trα(s) ds=ln⁡Dα(0)Dα(t),(11)\Theta_\alpha(t)=\int_0^t r_\alpha(s)\,\mathrm{d}s=\ln\frac{D_\alpha(0)}{D_\alpha(t)}, \tag*{(11)}

References

  1. [1]E. B. Mpemba and D. G. Osborne, Phys. Educ. 4, 172 (1969).
  2. [2]M. Jeng, Am. J. Phys. 74, 514 (2006).
  3. [3]Z. Lu and O. Raz, Proc. Natl. Acad. Sci. USA 114, 5083 (2017).
  4. [4]I. Klich, O. Raz, O. Hirschberg, and M. Vucelja, Phys. Rev. X 9, 021060 (2019).
  5. [5]A. Lasanta, F. Vega Reyes, A. Prados, and A. Santos, Phys. Rev. Lett. 119, 148001 (2017).
  6. [6]A. Biswas, V. V. V. Prasad, O. Raz, and R. Rajesh, Phys. Rev. E 102, 012906 (2020).
  7. [7]M. Baity-Jesi, E. Calore, A. Cruz, L. A. Fernandez, J. M. Gil-Narvión, A. Gordillo-Guerrero, D. Íñiguez, A. Lasanta, A. Maiorano, E. Marinari et al., Proc. Natl. Acad. Sci. USA 116, 15350 (2019).
  8. [8]M. R. Walker and M. Vucelja, J. Stat. Mech. (2021) 113105.
  9. [9]F. Carollo, A. Lasanta, and I. Lesanovsky, Phys. Rev. Lett. 127, 060401 (2021).
  10. [10]F. Ares, S. Murciano, and P. Calabrese, Nat. Commun. 14, 2036 (2023).
  11. [11]M. Moroder, O. Culhane, K. Zawadzki, and J. Goold, Phys. Rev. Lett. 133, 140404 (2024).
  12. [12]A. Kumar and J. Bechhoefer, Nature (London) 584, 64 (2020).
  13. [13]A. Kumar, R. Chétrite, and J. Bechhoefer, Proc. Natl. Acad. Sci. USA 119, e2118484119 (2022).
  14. [14]L. K. Joshi, J. Franke, A. Rath, F. Ares, S. Murciano, F. Kranzl, R. Blatt, P. Zoller, B. Vermersch, P. Calabrese, C. F. Roos, and M. K. Joshi, Phys. Rev. Lett. 133, 010402 (2024).
  15. [15]S. Aharony Shapira, Y. Shapira, J. Markov, G. Teza, N. Akerman, O. Raz, and R. Ozeri, Phys. Rev. Lett. 133, 010403 (2024).
  16. [16]A. Gal and O. Raz, Phys. Rev. Lett. 124, 066602 (2020).
  17. [17]A. Nava and R. Egger, Phys. Rev. Lett. 135, 140404 (2025).
  18. [18]A. Lapolla and A. Godec, Phys. Rev. Lett. 125, 110602 (2020).
  19. [19]T. Van Vu and Y. Hasegawa, Phys. Rev. Res. 3, 043160 (2021).
  20. [20]J. Meibohm, D. Forastiere, T. Adeleke-Larodo, and K. Proesmans, Phys. Rev. E 104, L032105 (2021).
  21. [21]M. Ibáñez, C. Dieball, A. Lasanta, A. Godec, and R. A. Rica, Nat. Phys. 20, 135 (2024).
  22. [22]G. Teza, J. Bechhoefer, A. Lasanta, O. Raz, and M. Vucelja, Phys. Rep. 1164, 1 (2026).
  23. [23]M. Mackinnon and M. Paternostro, Robustness of the quantum Mpemba effect against state-preparation errors, New J. Phys. 28, 044507 (2026), doi:10.1088/1367-2630/ae5840.DOI
  24. [24]Y. Zeng, J. Son, M. Gu, and X. Yuan, Theory of Quantum Imaginary-Time Mpemba Effect, arXiv:2604.17412 (2026).arxiv.org/abs/2604.17412
  25. [25]J. Schakenberg, Rev. Mod. Phys. 48, 571 (1976).
  26. [26]U. Seifert, Rep. Prog. Phys. 75, 126001 (2012).
  27. [27]K. Sekimoto, Stochastic Energetics (Springer, Berlin, 2010).
  28. [28]U. Seifert, Phys. Rev. Lett. 95, 040602 (2005).
  29. [29]P. Reimann, Phys. Rep. 361, 57 (2002).
  30. [30]P. Hänggi and F. Marchesoni, Rev. Mod. Phys. 81, 387 (2009).
  31. [31]M. Asfaw and M. Bekele, Eur. Phys. J. B 38, 457 (2004).
  32. [32]M. Asfaw, Phys. Rev. E 89, 012143 (2014).
  33. [33]M. A. Taye, Phys. Rev. E 94, 032111 (2016).
  34. [34]M. A. Taye, Phys. Rev. E 101, 012131 (2020).
  35. [35]M. A. Taye, Phys. Rev. E 103, 042132 (2021).
  36. [36]M. A. Taye, Phys. Rev. E 105, 054126 (2022).
  37. [37]M. A. Taye, Phys. Rev. E 110, 054105 (2024).
  38. [38]M. A. Taye, Phys. Rev. E 112, 044101 (2025).
  39. [39]M. A. Taye, Phys. Rev. E 112, 044122 (2025).
  40. [40]S. G. Bobkov and P. Tetali, J. Theor. Probab. 19, 289 (2006).
  41. [41]P. Diaconis and L. Saloff-Coste, Ann. Appl. Probab. 6, 695 (1996).
  42. [42]R. Bao, C. Du, Z. Cao, and Z. Hou, Phys. Rev. E 112, 044134 (2025).
  43. [43]A. Auconi, arXiv:2606.14329 (2026).arxiv.org/abs/2606.14329
  44. [44]I. Sason and S. Verdú, IEEE Trans. Inf. Theory 62, 5973 (2016).
  45. [45]M. A. Taye, Mpemba effect as an entropy-production race: Finite-amplitude bounds on crossing times in Markovian relaxation, companion manuscript (2026), unpublished.
  46. [46]T. Van Vu and H. Hayakawa, Phys. Rev. Lett. 134, 107101 (2025).
  47. [47]N. G. van Kampen, Stochastic Processes in Physics and Chemistry, 3rd ed. (Elsevier, Amsterdam, 2007).
  48. [48]J. R. Norris, Markov Chains (Cambridge University Press, Cambridge, England, 1997).
  49. [49]W. Feller, An Introduction to Probability Theory and Its Applications, 2nd ed., Vol. II (Wiley, New York, 1971).
  50. [50]D. R. Cox and H. D. Miller, The Theory of Stochastic Processes (Chapman and Hall, London, 1965).
  51. [51]S. F. Duki and M. A. Taye, J. Stat. Phys. 171, 878 (2018).
  52. [52]M. A. Taye, arXiv:2607.04910 (2026).arxiv.org/abs/2607.04910
  53. [53]M. Esposito and C. Van den Broeck, Phys. Rev. E 82, 011143 (2010).
  54. [54]T. Hatano and S.-i. Sasa, Phys. Rev. Lett. 86, 3463 (2001).
  55. [55]A. Summer, M. Moroder, L. P. Bettmann, X. Turkeshi, I. Marvin, and J. Goold, Phys. Rev. X 16, 011065 (2026).

Paper details

vlnc:W_4tgpxjwk
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents