Tikhonov-regularised projected gradient flow for equality-constrained bilinear quantum control
Abstract
We study a projection-type gradient flow for equality-constrained maximisation of a smooth bilinear control objective on H=L2(0,T;R), eliminating Lagrange multipliers through an (M+1)×(M+1) moving Gram matrix (s)'=∫0T S(t)\,c(s,t)\,c'(s,t)\,dt. The flow generates monotonic ascent in continuous time but becomes unstable on discretisation; existing implementations rely on heuristic step-size safeguards lacking rigorous justification. We close this gap by replacing with :=+2I and prove: (i) an exact spectral identity giving ()=(σ2+2)/(σ2+2); (ii) objective monotonicity dJ/ds 0 for all 0; (iii) constraint drift |hm-Cm|=O(2) with a computable prefactor; (iv) convergence of the regularised trajectory to the unregularised one in L2(0,T) at rate O(2) under uniform invertibility of ; and (v) a discrete CFL criterion s\,G\,\|-1\|α<2 guaranteeing objective monotonicity of the forward-Euler scheme up to O( s2) local truncation error. The theory is validated on a three-level bilinear benchmark for all-optical Bell-state preparation, where ()∈[109,1011], the predicted 2 rate is confirmed over eight decades, and moderate regularisation eliminates step rejections and reduces constraint drift by more than an order of magnitude at unchanged final fidelity.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.