# Where is a classical computer better than a quantum one? [closed]

Where is a classical computer better than a quantum computer? Is there any known domain where classical algorithms always beat quantum ones, say, both in terms of time and space complexity?

If yes, could you please give me examples?
If no, could you please provide me with a link to the prove?

## closed as too broad by Kyle Kanos, ZeroTheHero, Jon Custer, Yashas, sammy gerbilJun 10 '17 at 10:45

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

As fs137 answered, a quantum computer can simulate a classical computer, and so from a purely complexity theory perspective, the classical computer is never superior to the quantum in an asymptotic sense (assuming $P\subset BQP$, currently an open question).