Quantum versus Population Dynamics over Cayley Graphs
Emil Prodan

TL;DR
This paper demonstrates that by decorating a graph appropriately, classical population dynamics can exactly simulate quantum particle hopping, providing a new classical platform for studying quantum effects.
Contribution
It introduces a method to map population dynamics on graphs to quantum dynamics through graph decoration, enabling classical simulation of quantum phenomena.
Findings
Exact mapping between population and quantum dynamics on graphs.
Population dynamics can simulate quantum effects.
Multiple examples illustrating the simulation capability.
Abstract
Consider a graph whose vertices are populated by identical objects, together with an algorithm for the time-evolution of the number of objects placed at each of the vertices. The discrete dynamics of these objects can be observed and studied using simple and inexpensive laboratory settings. There are many similarities but also many differences between such population dynamics and the quantum dynamics of a particle hopping on the same graph. In this work, we show that a specific decoration of the original graph enables an exact mapping between the models of population and quantum dynamics. As such, population dynamics over graphs is yet another classical platform that can simulate quantum effects. Several examples are used to demonstrate this claim.
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Complex Network Analysis Techniques
