3 ms·
Right, Factoring and discrete logs both come to mind; is Google's quantum computer not able to achieve measurable speedups on those versus classical computation
by aidenn0 2y ago
Right, Factoring and discrete logs both come to mind; is Google's quantum computer not able to achieve measurable speedups on those versus classical computation?
- fastball 2y agoGoogle's chip is not general enough to perform any quantum algorithm.
- tmvphil 2y agoIt is perfectly general, but the error rate is too high to operate all qubits simultaneously for more than a few tens of gates without error. This is why error correction is needed but then you need orders of magnitude more physical qubits to deal with the overhead.
- fastball 2y agoThen why can they perform an RCS evaluation but not some other algo? RCS requires the least number of qubits by a huge margin?
- drkevorkian 2y agoNo, not quite, it's about the error-per-gate. RCS has very loose requirements on the error per gate, since all they need is enough gates to build up some arbitrary entangled state (a hundred or so gates on this system). Other algorithms have very tight requirements on the error-per-gate, since they must perform a very long series of operations without error.
- pitpatagain 2y agoThat's exactly correct, this chip cannot do either of those things yet. Which is why they use this toy-ish random circuit sampling problem.
- Filligree 2y agoNot a large enough speedup to factor something that couldn't be done on a classical computer. Well, really it can't run them at all, but a more-general computer this size which could, still wouldn't be large enough.