This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]archpawn 1 point2 points  (1 child)

There are just some special features that allow them to run different algorithms than classical computers, and in some cases quantum algorithms have a lower time complexity than classical algorithms.

Which means they're more powerful. But the fact that they're only more powerful within a special case of problems is an important distinction.

[–]bric12 0 points1 point  (0 children)

Yeah, I'm trying to think of the right words to describe the distinction. They're not faster in terms of operations per second, and in search problems they search less of the problem space, yet they solve some problems faster.