The computational task of finding a control field for a particular state-to-state transformation is difficult and becomes more difficult with the increase in the size of the system. This task is in the class of hard inversion problems of high computational complexity. The algorithmic task of finding the field that generates a unitary transformation scales factorial more difficult with the size of the system. This is because a larger number of state-to-state control fields have to be found without interfering with the other control fields. It has been shown that solving general quantum optimal control problems is equivalent to solving Diophantine equations. It therefore follows from the negative answer to Hilbert's tenth problem that quantum optimal controllability is in general undecidable.