Conversation

📣 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.

quantum.country

How the quantum search algorithm works

An explanation of how the quantum search algorithm works, & introduction to the design of quantum algorithms

5:49 PM · Apr 17, 2019Twitter Web Client

Replying to

@andy_matuschak

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.

Andy Matuschak

@andy_matuschak

Apr 17, 2019

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.

quantum.country

Quantum computing for the very curious

Presented in an experimental mnemonic medium which makes it almost effortless to remember what you read

Replying to

and

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. 👏🏻👏🏻👏🏻👏🏻

Michael is back in San Francisco, soon in Santa Fe

@michael_nielsen

Apr 18, 2019

Thank you! Delighted you're enjoying it.

Replying to

and

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>)