Minimal Reachability is Hard To Approximate.

In this note, we consider the problem of choosing which nodes of a lineardynamical system should be actuated so that the state transfer from thesystem's initial condition to a given final state is possible. Assuming astandard complexity hypothesis, we show that this problem cannot be efficientlysolved or approximated in polynomial, or even quasi-polynomial, time.