To Move Fast, Quantum Maze Solvers Must Forget the Past
Quantum algorithms can find their way out of mazes exponentially faster than classical ones, at the cost of forgetting the paths they took. A new result suggests that the trade-off may be inevitable. Read more at QuantaMagazine.org. Music is “Confusing Disco” by Birocratic.
The podcast Quanta Science Podcast is embedded on this page from an open RSS feed. All files, descriptions, artwork and other metadata from the RSS-feed is the property of the podcast owner and not affiliated with or validated by Podplay.