Energy shortcut of N-level quantum protocols by optimal control
Bibliographic record
Abstract
We introduce an energetically-optimal method inspired from Shortcut-To-Adiabaticity (STA) processes, named Quantum-Optimal-Shortcut-To-Energetics (QOSTE). QOSTE produces the same transformation as STA for a given protocol used in quantum technologies or thermodynamics, but at the lowest possible energy cost. In the general case of a N- level quantum system, we derive the QOSTE controls using geometrical and optimal control tools, and show that the minimal energy cost is determined by the length of the geodesic in the rotating frame given by the original protocol. For long control times, the scaling of the ratio between the two energy costs of STA and QOSTE is quadratic in time. We benchmark our results with the Landau-Zener protocol for qubits and STIRAP for three-level systems. We observe a drastic reduction in energy with respect to standard STA methods. Finally, using gradient-based optimization algorithms and highlighting the emerging trade-off between robustness and energy cost, we design robust QOSTE outperforming STA both in robustness and energy efficiency.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
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".