Hacker News Comments on
Quantum Computers Explained – Limits of Human Technology
Kurzgesagt – In a Nutshell
·
Youtube
·
10
HN points
·
5
HN comments
- This course is unranked · view top recommended courses
Hacker News Stories and Comments
All the comments and stories posted to Hacker News that reference this video.You should check out these videos, one of them might give you an understanding!- https://www.youtube.com/watch?v=JhHMJCUmq28 | Quantum Computers Explained - https://www.youtube.com/watch?v=IrbJYsep45E | The Mathematics of Quantum Computers - https://www.youtube.com/watch?v=wUwZZaI5u0c | Hacking at Quantum Speed with Shor's Algorithm - https://www.youtube.com/playlist?list=PL1826E60FD05B44E4 | A series by the author of the standard textbook
These are videos I particularly like!
Quantum computing is way beyond me but I found this video by Kurzgesagt really interesting https://youtu.be/JhHMJCUmq28
This might be a bit too basic but Kurzgesagt has a great video on Quantum Computers (at https://www.youtube.com/watch?v=JhHMJCUmq28).
Here's an educational video on the subject that explains it in a way that everyone can understand. https://www.youtube.com/watch?v=JhHMJCUmq28
⬐ jessriedelThis video doesn't discuss quantum supremacy, so it does nothing to answer his question.⬐ aisoftengIt does however establish the background material. Inability to make the connection is a failure of intellect and imagination.
The YouTube channel "In a Nutshell" released a good summary on this recently: https://www.youtube.com/watch?v=JhHMJCUmq28
⬐ archgoonThat video is about Gate Quantum Computers; DWave machines are NOT gate quantum computers; they call their machine quantum annealing machines. It is not known the complexity class of problems that can be solved efficiently by quantum annealing machines, or if that class is equivalent to classical machines.The result shows that the DWave machine is asymptotically faster than the Simulated Annealing algorithm (yay!), which suggests that it is executing the Quantum Annealing algorithm. However, the the paper also explicitly states that this does not mean that the Dwave machine is exhibiting a 'quantum speedup'. To do this, they would need to show it to outperform the best known classical algorithm, which as the paper acknowledges, it does not.
What the paper does seem to be showing is that the machine in question is actually fundamentally quantum in nature; it's just not clear yet that that the type of quantum computer it is is an improvement over classical ones.