Controllability Gramian 2026-10-14
For and the constant matrices over the real numbers in the Kalman rank criterion, the finite-time Controllability Gramian accumulates the influence of all command times. Its column space equals that of the controllability matrix, and is a symmetric positive-definite matrix exactly when the controllability matrix has rank of a matrix . If so, put . Among square-integrable functions steering to at , the command
minimizes , with value . Here in a matrix superscript denotes transpose. This cost is a squared input norm, not necessarily physical energy, and the optimizing command need not satisfy an amplitude bound. [ref]
For the double integrator, , so direct integration gives
For a rest-to-rest distance , and the minimum squared input norm is . Compare the two constant commands in the double integrator example, whose cost is : both attain the target, but the smooth command costs less. At , , however, peaks at , so it violates while the two constant commands remain admissible. Controllability, optimal control, and constrained reachability in control theory answer different questions.
For reachability in control theory, a state is reachable from if an admissible input and a permitted duration drive the dynamical system from to . Controllability requires this for every initial-target pair in the specified state space. Restrictions on duration or field amplitudes change the reachable set, so the admissible controls are part of the definition.
For a closed quantum system, , , and states evolve as or . This gives three notions of quantum controllability. Unitary operator controllability requires every desired to be reachable from the identity; when a global phase is immaterial, one instead asks for every special unitary operation. Density operator controllability requires every pair of density operators with the same spectrum to be connected. The spectral qualification is necessary because unitary time evolution cannot change eigenvalues; the natural state space is a unitary orbit of a density operator. Pure-state controllability requires any normalized initial state to be transferred to any target ray, .
Thus , with the operator implication also valid if global phase is discarded. The converse implications need not hold. A pure-state task concerns one vector, whereas an operator task must act correctly on every input vector at once.
Reachability in control theory asks about a particular initial state and target : does some admissible control input make at the declared time , or at some allowed duration? Controllability requires this for every pair in the declared state space. This is a property of state evolution, distinct from graph reachability.
For a linear time-invariant system, solving the ordinary differential equation by a matrix exponential gives
The first term is the unforced endpoint. Reachability in control theory asks whether the control input can supply exactly the displacement . The timing matters because the same command is carried by different amounts of subsequent dynamics. [ref]
Here is a contrasting mathematical example with one shared control input:
The controllability matrix has rank of a matrix one. Since , the difference is invariant under every allowed control input. From the reachable set is the diagonal when input amplitudes are unrestricted: is reachable at using , while is impossible at every duration. Having a control input appear in both state equations did not give independent control of both states. This reachable set is pictured alongside the bounded double integrator below.