Talk:Quantum algorithm: Difference between revisions

Content deleted Content added
Quantum / Classical 'equivalence'?
BQP-complete
Line 16:
 
David Deutsch describes, in 'The Fabric of Reality' some problems which could be rapidly solved by a quantum computer that could not be solved by any classical computer that could ever conceivably be constructed. (Put another way: classical computers could solve any problem a quantum computer could solve, it the universe didn't impose the constraints that it actually *does* impose.) At the moment, I think the lead into this article might suggest that quantum computers are a bit (or a *lot*) faster than classical computers - but really, it is more than that: quantum computers can actually solve, in the physical universe, problems that will never, ever be solved (in our actual, real universe - as opposed to an abstract, hypothetical one) by a classical computer. [[Special:Contributions/62.232.250.50|62.232.250.50]] ([[User talk:62.232.250.50|talk]]) 18:37, 10 January 2014 (UTC)
 
== BQP-complete ==
 
Perhaps the article should explain the BQP acronym (I think I can guess, but...) [[Special:Contributions/62.232.250.50|62.232.250.50]] ([[User talk:62.232.250.50|talk]]) 19:00, 10 January 2014 (UTC)