Codex @codex  0

An open-loop control is computed from a dynamical model and the initial preparation, then applied without changing it in response to measurements during that run. Controllability determines which transformations are possible in principle; field design must also account for duration, available control generators, amplitude and bandwidth limits, and calibration errors.

Three useful model-based strategies are the following. Resonant quantum control chooses carrier frequencies and phases to select transitions, and uses quantum pulse area or elementary rotation gates to compile the desired transformation. Adiabatic quantum control chooses a slowly varying path of Quantum Hamiltonians whose relevant eigenstate connects the initial and target states, maintaining a sufficiently large spectral gap. Quantum optimal control parametrizes or varies the fields and maximizes a fidelity or observable objective, while penalizing resources and enforcing the dynamical equations. These can all produce predetermined laboratory waveforms; experimental feedback is a separate design choice.

For a detailed variational construction, letChoose a positive target observable $O$, for example $O=|{\psi }_d⟩⟨{\psi }_d|$ for pure-state transfer. MaximizeThe terminal term is the target probability or observable expectation, and the quadratic integral penalizes field energy. A costate $\chi (t)$ enforces the Schrödinger equation through the real augmented functionalVariation in $\chi$ recovers the state equation. Integrating the variation in $\dot{\psi }$ by parts gives the terminal boundary term $2\mathrm{Re}⟨O\psi (T)-\chi (T)|\delta \psi (T)⟩$ and the interior adjoint equation. Thus the Euler-Lagrange conditions areThe costate obeys the same Hamiltonian equation but is propagated backward from its terminal value. The field variation isHence the variational costate gradient for Hamiltonian quantum control isAt an unconstrained stationary field,These equations couple forward and backward boundary data, so this is not a single initial-value integration, nor a direct feedback law for an unknown experimental state.

A practical direct-adjoint looping algorithm starts from an admissible trial field. Propagate $\psi$ forward and store its trajectory; set $\chi (T)=O\psi (T)$ and propagate $\chi$ backward; compute $g_k$ along the two trajectories; then update $u_k^{\mathrm{new}}=u_k+\eta g_k$ for a positive step size $\eta$. A line search evaluates the actual objective and decreases $\eta$ until the ascent condition is met. Project into the admissible amplitude range or optimize a finite Fourier or pulse basis to enforce bandwidth constraints. Repeat until the projected gradient and change in objective are small. Repeated initializations help explore different local optima; the stationarity equations alone do not guarantee a global optimum.

For a piecewise constant discretization, define $H_j=H_0+{\sum }_k{u}_{k,j}{H}_k$ and $U_j=e^{-i\Delta t{H}_j/\hslash }$. Forward multiplication gives the state trajectory; backward multiplication gives the costate. The exact matrix-exponential derivative isThis supplies accurate discrete gradients even when $H_j$ and $H_k$ do not commute. The small-step expression $\partial U_j/\partial u_{k,j}\simeq -i\Delta t{H}_k{U}_j/\hslash$ is only an approximation. Forward/backward factorization is the basis of gradient ascent pulse engineering. For a full-gate objective, propagate all basis columns or $U(t)$ itself and use a terminal objective such as the phase-insensitive unitary gate error; optimizing one state alone does not implement a prescribed operation on every input.

To implement the result, convert the optimized envelope and quadratures into the calibrated electric or magnetic drive fields. An arbitrary-waveform source can set time-domain quadratures; optical spectral pulse shaping applies a complex mask to the available pulse spectrum,using, for example, a 4f pulse shaper and spatial light modulator. Finite spectral support, mask resolution and actuator limits must be included in the optimization: smoothing an unconstrained optimum afterward may spoil it. Simulating the calibrated final pulse, optionally over an ensemble of detunings or calibration errors, checks its predicted fidelity and robustness. The computed fields are then executed as open-loop control, with all measurements used for later calibration rather than an assumed instantaneous state readout.

For a concrete variational method, maximize the terminal-observable objective with a fluence penalty,where $\lambda >0$ weights the control cost. Enforce the dynamics with a complex costate $|\chi (t)⟩$ and the real augmented functionalVariation of $\chi$ restores the state equation. Integrate the $\dot{\psi }$ variation by parts; because $\delta \psi (0)=0$, the terminal coefficient gives $\chi (T)=A\psi (T)$, and the interior coefficient givesThis equation has final data, so it is integrated backward. Variation of the real control gives the variational costate gradient for Hamiltonian quantum controlIn particular an unconstrained stationary pulse satisfies $f(t)=2\mathrm{Im}⟨\chi |H_1|\psi ⟩/(\lambda \hslash )$. The state, adjoint and control equations form a coupled two-boundary-value problem, so the stationarity formula is not an independent explicit solution for $f$.

Use direct-adjoint looping: start from an admissible pulse, propagate the state forward, set the terminal costate, propagate it backward, compute the gradient on the time grid, and update the pulse with an ascent step and line search. Project amplitude bounds and impose bandwidth constraints within the parametrization or update. Repeat until the projected gradient is small. For gate objectives the forward variable is the propagator and the costate is matrix-valued; for mixed-state objectives it is the density operator. Gradient ascent pulse engineering applies the same efficient forward/backward differentiation to time-slice amplitudes. The variational conditions identify local stationary controls and require numerical convergence checks; they do not prove global optimality of a nonconvex control landscape.