Bypassing thermalization timescales in temperature estimation using prethermal probes
Bibliographic record
Abstract
We introduce prethermal temperature probes for sensitive, fast and robust temperature estimation. While equilibrium thermal probes with a manifold of quasidegenerate excited states have been previously recognized for their maximal sensitivity, they suffer from long thermalization timescales. When considering time as a critical resource in thermometry, it becomes evident that these equilibrium probes fall short of ideal performance. Here, we propose a different paradigm for thermometry, where setups originally suggested for optimal equilibrium thermometry should instead be employed as prethermal probes, by making use of their long-lived quasiequilibrium state. This transient state emerges from the buildup of quantum coherences among quasidegenerate levels. For a class of physically-motivated initial conditions, we find that energy measurements of the prethermal state exhibit a similar sensitivity as the equilibrium state. However, they offer the distinct benefit of orders of magnitude reduction in the time required for the estimation protocol. Upon introducing a figure-of-merit that accounts for the estimation protocol time, prethermal probes surpass the corresponding equilibrium probes in terms of effective thermal sensitivity, opening avenues for rapid thermometry by harnessing the long-lived prethermal states.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".