TL;DR
This paper establishes an exact isomorphism between Galperin's bouncing billiards method for learning digits of pi and Grover's quantum search algorithm, offering a novel visualization approach.
Contribution
It introduces a new analogy linking classical billiard collisions to quantum search algorithms, enhancing understanding of Grover's algorithm.
Findings
Demonstrates a precise isomorphism between bouncing billiards and Grover's algorithm
Provides a visual and intuitive understanding of quantum search processes
Connects classical physics with quantum computing concepts
Abstract
In "Playing Pool with ", Galperin invented an extraordinary method to learn the digits of by counting the collisions of billiard balls. Here I demonstrate an exact isomorphism between Galperin's bouncing billiards and Grover's algorithm for quantum search. This provides an illuminating way to visualize Grover's algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
But what is quantum computing? (Grover's Algorithm)· youtube
Why colliding blocks compute pi· youtube
