Grover is Better than Google at Search

In this video, we delve into the fascinating world of search algorithms, from the ones that power Google to the quantum realm. We discuss the problem of searching through ordered and unordered lists, revealing how Google's intricate system of indexing and ranking makes it a leader in the search engine world. However, Grover's algorithm outshines Google in searching through unordered lists. Though not currently practical due to the limitations of quantum computing, Grover's algorithm stands as a promising tool for the future. Join us as we explore these concepts and consider the future of search in a quantum era. Don't forget to check out our references for further reading and follow us on social media!

📚 References

🌐 Follow me on social media:
🔬 Check out my research here:

[bendybruce]

As impressive as Grover's algorithm undoubtedly is, I can't help but suspect that it will one day be replaced with Oscar's algorithm. Okay I just made that up lol. That said, your video did bring back very distant memories of when I first learnt to code. First we had to write a bubble sort, and then we upgraded to the binary chop. That was well over 30 years ago now so I guess I should try to learn a bit more about Grover's algorithm. Sadly I suspect my brain may not be plastic enough anymore to properly comprehend it, sigh.

[bugstomper]

Meanwhile D-Wave makes 5000 qubit quantum 'annealing' computers. IBM does not want you to search that. 😂