Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?

examachine_at_gmail.com
Date: 02/09/05 

Date: 9 Feb 2005 07:59:47 -0800

Ralph Hartley wrote:
> For any number n of connected qbits, and any acceptable error
epsilon, a
> classical machine can simulate the quantum one. But the computational

> effort required grows with decreasing epsilon and grows (almost
certainly
> exponentially) with n.

I haven't seen any proof of exponential speedup, which would just end
all the troubles of computer science. Isn't it more likely that there
is just a polynomial speedup? (Like quadratic) 

--
Eray

Relevant Pages