1.8k citations · 8.8k across the 37 of their papers we have counts for
1 paper · 2 filters
Lieven M. K. Vandersypen, Matthias Steffen, Gregory Breyta +3
The number of steps any classical computer requires in order to find the prime factors of an l-digit integer N increases exponentially with l, at least using algorithms known…