  In this short communication, it is shown a simple problem using quantum
circuits for which the algorithmic information theory guarantee that the
minimal length of the algorithm able to solve it grows exponentially with the
number of qubits.
