Jump to content

Talk:Quantum algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 62.232.250.50 (talk) at 18:37, 10 January 2014 (Quantum / Classical 'equivalence'?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconPhysics C‑class Mid‑importance
WikiProject iconThis article is within the scope of WikiProject Physics, a collaborative effort to improve the coverage of Physics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-importance on the project's importance scale.
WikiProject iconComputer science C‑class High‑importance
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
HighThis article has been rated as High-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

Experimental Quantum Computing to Solve Systems of Linear Equations

Maybe we should add something about this: Experimental Quantum Computing to Solve Systems of Linear Equations

--Vitalij zad (talk) 14:39, 29 August 2013 (UTC)[reply]

Quantum / Classical 'equivalence'?

"All problems which can be solved on a quantum computer can be solved on a classical computer."

Although the above may be true in some abstract mathematical sense, I don't think it is true in reality.

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. 62.232.250.50 (talk) 18:37, 10 January 2014 (UTC)[reply]