Tani’s quantum claw-finding algorithm is cited as the best quantum attack against Supersingular Isogeny-based Diffie-Helman. However, it requires exponential quantum memory. In this talk I’ll explain how Tani’s algorithm works as a natural quantum analogue of a classical random walk. I’ll give a brief explanation of why superposition, reversibility, and error correction imply huge costs to quantum memory. Combining these ideas, I conclude that Grover’s algorithm, or even classical van Oorschot-Wiener, would be a better use of any quantum hardware.