It explains one of the most remarkable known applications of quantum computers: to search an N-item search space, they only need to examine the search space roughly the square root of N times.
Show this thread
This is, frankly, incredible. When I first heard the result, I couldn't imagine how it was possible. But it's true! The essay explains why it's true, how it's done, and even sketches how one might have come to discover the search algorithm.
-
-
The essay isn't just about the search algorithm. It's also about learning to think in the quantum realm. Think of it as an introduction to quantum algorithm design, introducing many techniques which can be used in other algorithms as well.
Show this thread -
It's about beginning to go beyond our everyday classical intuition, and to develop tools and heuristics for thinking about the quantum world.
Show this thread -
As with our earlier essay, on "Quantum Computing for the Very Curious", this essay is presented in an experimental mnemonic medium.
Show this thread -
This new medium bakes in the ideas of spaced-repetition testing, and - we hope and believe! - will make it almost effortless to remember what you read for the long term.
Show this thread
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.