📣 New "mnemonic essay" on quantum computation with 🚨
How can any procedure possibly search a list in O(√N) time? Find out here—and remember what you've learned almost effortlessly through our integrated spaced repetition system.
Conversation
Replying to
When people struggle to learn complex ideas like quantum search, how often is that—perhaps even invisibly—because they're not fully fluent in the prerequisite concepts? They might "know" the prereqs, but only with so much cognitive load / delay that they can't absorb more.
2
3
42
This second essay begins to play out that notion.
Our first essay (quantum.country/qcvc) introduced QC's basics. Many readers reviewed that essay's concepts 5+ times over the last few weeks; with that growing fluency, we hope they'll find quantum search more accessible.
2
15
75
Thank you guys so much for your work on this material. I am really loving it! The quizzes and reminders to review are working great for me! I would be thrilled to see high quality material presented using this approach across a wide range of topics. 👏🏻👏🏻👏🏻👏🏻
1
3
Thank you! Delighted you're enjoying it.
This is kind of a silly connection, but I thought it was cool--geometrically, the Grover iterations do the same thing as these collisions between boxes and a wall: youtube.com/watch?v=jsYwFi (hitting the wall = reflecting across |s>, collision between boxes = reflecting across |E>)
5
Hi! you can read it here: Thread by : "New "mnemonic essay" on quantum computation with How can any procedure possibly search a list in O(√N) […]" threadreaderapp.com/thread/1118572
See you soon. 🤖
Guessing, first sieve data into a sorted array of values!







