Usually in the language of Linear Algebra. In 1994, Peter Shor showed that a hypothetical quantum computer could factor n-bit numbers in c n 3 computational steps. Thus, rather than a problem, quantum behavour, can be an advantage. The subject has received significant attention only in recent years, and it changes our understanding of both computation and physics. 2 n classically.
Upper bound is n, inform th lower bound is log n .
In fact, it's c n . Unfortunately, none are here in Calgary.