4 ms·
Long talk about superpositions of probabilities, but almost no explanation about how can that help in computing. How can the probabilistic operations speedup c
by avodonosov 9y ago
Long talk about superpositions of probabilities, but almost no explanation about how can that help in computing.
How can the probabilistic operations speedup computations? No explanation given.
- pdkl95 9y agoThe best introduction to this kind of computation that I've seen is Eric Johnston's SIGGRAPH 2016 talk[1], and the associated interactive simulator[2]. In the talk uses quantum superposition to implement a type of "quantum supersampling[3]". [1] https://vimeo.com/180284417 https://vimeo.com/180284417 [2] http://qcengine.com/ http://qcengine.com/ [3] https://en.wikipedia.org/wiki/Supersampling https://en.wikipedia.org/wiki/Supersampling
- jcoffland 9y agoIt does show how 2-bit quantum search is faster than conventional, requiring only one evaluation of the oracle function instead of three.
- avodonosov 9y agoIn the second part and not explaining the principle.
- deleted 9y ago[deleted]
- mtgx 9y agoI thought this was a pretty good introduction to quantum computing: http://thinkingofutils.com/2017/12/quantum-computers/ http://thinkingofutils.com/2017/12/quantum-computers/