Time-minimum control of quantum purity for 2-level Lindblad equations
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We study time-minimum optimal control for a class of quantum two-dimensional dissipative systems whose dynamics are governed by the Lindblad equation and where control inputs acts only in the Hamiltonian. The dynamics of the control system are analyzed as a bi-linear control system on the Bloch ball after a decoupling of such dynamics into intra- and inter-unitary orbits. The (singular) control problem consists of finding a trajectory of the state variables solving a radial equation in the minimum amount of time, starting at the completely mixed state and ending at the state with the maximum achievable purity.The boundary value problem determined by the time-minimum singular optimal control problem is studied numerically. If controls are unbounded, simulations show that multiple local minimal solutions might exist. To find the unique globally minimal solution, we must repeat the algorithm for various initial conditions and find the best solution out of all of the candidates. If controls are bounded, optimal controls are given by bang-bang controls using the Pontryagin minimum principle. Using a switching map we construct optimal solutions consisting of singular arcs. If controls are bounded, the analysis of our model also implies classical analysis done previously for this problem.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it