3 ms·
>If a quantum computer could be built with just 50 quantum bits (qubits), no combination of today's TOP500 supercomputers could successfully outperform it. I w
by swordswinger12 11y ago
>If a quantum computer could be built with just 50 quantum bits (qubits), no combination of today's TOP500 supercomputers could successfully outperform it.
I would really, really like to know how they came up with this.
- titanomachy 11y agoI agree, without more info that's a pretty meaningless statement. What if the quantum computer takes minutes to complete a single operation?
- rurban 11y 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 11y 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.