MétaCan
Menu
Back to cohort
Record W2421883786 · doi:10.1002/mma.4710

Minimal time for the approximate bilinear control of Schrödinger equations

2018· article· en· W2421883786 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueMathematical Methods in the Applied Sciences · 2018
Typearticle
Languageen
FieldMathematics
TopicAdvanced Mathematical Physics Problems
Canadian institutionsAcadia University
FundersNatural Sciences and Engineering Research Council of CanadaAgence Nationale de la Recherche
KeywordsControllabilityMathematicsBilinear interpolationUnit sphereQuantumClass (philosophy)Schrödinger equationMathematical analysisPure mathematicsApplied mathematicsQuantum mechanicsPhysics

Abstract

fetched live from OpenAlex

We consider a quantum particle in a potential V ( x ) subject to a time‐dependent (and spatially homogeneous) electric field E ( t ) (the control). Boscain, Caponigro, Chambrion, and Sigalotti proved that, under generic assumptions on V , this system is approximately controllable on the unit sphere, in sufficiently large time T . In the present article, we show that, for a large class of initial states (dense in unit sphere), approximate controllability does not hold in arbitrarily small time. This generalizes our previous result for Gaussian initial conditions. Furthermore, we prove that the minimal time can in fact be arbitrarily large.

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 imitation

Not 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.

metaresearch head score (Codex)0.014
metaresearch head score (Gemma)0.007
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.156
Threshold uncertainty score0.896

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0140.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.002
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.150
GPT teacher head0.457
Teacher spread0.307 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it