https://quanttype.net/tags/quantum-computing/ Recent content in Quantum Computing on quanttype Hugo en-us Tue, 01 Sep 2026 12:22:41 +0300 https://quanttype.net/p/are-quantum-computers-faster-than-classical/ Sat, 21 Mar 2015 00:00:00 +0000 https://quanttype.net/p/are-quantum-computers-faster-than-classical/ <p>We do not know - not from the point of view of computational complexity, anyway.</p> <p>The complexity class $\textrm{BQP}$ (bounded-error quantum polynomial-time) roughly corresponds to the problem that can be solved efficiently with a quantum computer, the same way as problems in $\textrm{P}$ can be solved efficiently with a classical computer. BQP is essentially the quantum version of $\textrm{BPP}$ (bounded-error probabilistic polynomial-time). For more precise description, see <a href="http://www.scottaaronson.com/democritus/lec10.html">Scott Aaronson&rsquo;s lecture notes</a> or <a href="https://en.wikipedia.org/wiki/BQP">Wikipedia</a>.</p>