2 ms·
I agree, without more info that's a pretty meaningless statement. What if the quantum computer takes minutes to complete a single operation?
by titanomachy 12y ago
I agree, without more info that's a pretty meaningless statement. What if the quantum computer takes minutes to complete a single operation?
- rurban 12y agowhy? 2^50 is a pretty high number. calculating with 2^50 states at once in one cycle certainly outperforms any known super computer, even if a cycle costs 1s. It does not however.
- titanomachy 12y ago2^50 is the upper bound on the size of the solution space that can be searched by a 50-bit quantum computer. If that same solution space were divided up amongst the hundreds of thousands of cores in the world's largest supercomputers, the solution could be found in much less than 1 second, or indeed much less than 1 cycle of any computer, quantum or otherwise. Anyway, whatever "cycle" means in a quantum computer, it would take much more than 1 cycle to search the whole solution space. Assuming your problem is in BQP you still have to iterate until error is within acceptable limits.