2005
DOI: 10.1063/1.2042456
|View full text |Cite
|
Sign up to set email alerts
|

Quantum observable homotopy tracking control

Abstract: This paper presents a new tracking method where the target observable O(s,T) at the final dynamical time T follows a predefined track P(s) with respect to a homotopy tracking variable s>or=0. The procedure calculates the series of control fields E(s,t) required to accomplish observable homotopy tracking by solving a first-order differential equation in s for the evolution of the control field. Controls produced by this technique render the desired track for all s without encountering field singularities. This … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
52
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
7
3

Relationship

2
8

Authors

Journals

citations
Cited by 61 publications
(52 citation statements)
references
References 24 publications
0
52
0
Order By: Relevance
“…We will utilize the gradient algorithm to prescribe the path of steepest ascent, thereby forming a natural "rule" to climb the landscape and consequently to navigate the underlying control space. The D-MORPH procedure will be used to implement the gradient search trajectory [30,31]. The process of climbing the landscape may be confounded by the presence of saddle submanifolds located at certain regions of specific intermediate heights on the landscape.…”
Section: Negotiating the Quantum Control Landscapementioning
confidence: 99%
“…We will utilize the gradient algorithm to prescribe the path of steepest ascent, thereby forming a natural "rule" to climb the landscape and consequently to navigate the underlying control space. The D-MORPH procedure will be used to implement the gradient search trajectory [30,31]. The process of climbing the landscape may be confounded by the presence of saddle submanifolds located at certain regions of specific intermediate heights on the landscape.…”
Section: Negotiating the Quantum Control Landscapementioning
confidence: 99%
“…Readers are referred to [13] for further details and to [14][15][16][17] for background. When the number m of unknown parameters (w i 's) is larger than the number of observation data points N (i.e., m > N ) with the provision that y lies in Ran( ) when does not have a full row rank, Eq.…”
Section: D-morph Regressionmentioning
confidence: 99%
“…Various algorithms can be used to search for an optimal control solution [18][19][20][21]. In QOCT, most numerical optimizations employ gradient-based methods [41][42][43][44][45][46][47][48][49][50][51][52][53] (second-order methods use, in addition to the gradient, the Hessian matrix, see appendix B). In order to implement such an optimization, one needs to compute the functional derivative of the objective with respect to each control field: δ δ…”
Section: Formulating Optimal Control Theory For Aqcmentioning
confidence: 99%