You didn't prove any point. You just vaguely alluded that since QC can do many computations in superposition, that it must somehow speedup Cuckoo Cycle finding.
Is it what was written in that paper? That by increasing number of qubits 30-fold number of computations done within the same timeframe is increased 1'000'000'000-fold?
I don't think the paper would be discussing a 30 fold increase in qubits.
More likely they discussed an extra 30 qubits.
For some very particular computation, like integer factoring,
an extra 30 qubits allow you to factorize a number that has 15 more bits.
(
http://arxiv.org/abs/quant-ph/0205095 showed a Circuit for Shor's algorithm using 2n+3 qubits).
So in that case you have 2^15 more states in superposition.