Playing Pool with $|ψ\rangle$: from Bouncing Billiards to Quantum Search
Google, Mountain View, CA 94043, USA
Department of Physics, Stanford University, Stanford, CA 94305, USA
|Published:||2020-11-02, volume 4, page 357|
|Citation:||Quantum 4, 357 (2020).|
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
In ``Playing Pool with $\pi$'' , Galperin invented an extraordinary method to learn the digits of $\pi$ 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.
► BibTeX data
 G. Galperin, ``Playing pool with $\pi$'', Regular and Chaotic Dynamics, v. 8, no. 4 (2003).
 Grant Sanderson, ``The most unexpected answer to a counting puzzle'', https://youtu.be/HEfHFsfGXjs.
 L. K. Grover, ``A Fast quantum mechanical algorithm for database search,'' Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC), 1996, pages 212-219; arXiv:quant-ph/9605043.
 Maria Mannone and Davide Rocchesso, Quantum Computing in the Arts and Humanities 193 (2022) ISBN:978-3-030-95537-3.
 X. M. Aretxabaleta, M. Gonchenko, N. L. Harshman, S. G. Jackson, M. Olshanii, and G. E. Astrakharchik, "The dynamics of digits: Calculating pi with Galperin's billiards", arXiv:1712.06698, (2017).
 Jiang Liu, "A Classical $\pi$ Machine and Grover's Algorithm", arXiv:2105.10257, (2020).
The above citations are from Crossref's cited-by service (last updated successfully 2023-06-09 11:01:14) and SAO/NASA ADS (last updated successfully 2023-06-09 11:01:15). The list may be incomplete as not all publishers provide suitable and complete citation data.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.