To Move Fast, Quantum Maze Solvers Must Forget the Past

episode

The Quanta Podcast not yet transcribed

▲ 0

Transcript

This episode hasn't been transcribed yet Upvotes decide what gets transcribed next — 0 so far. Sign in to upvote

Related

recent transcribed audio

A.I. Safety Goes Mainstream + a ‘Hard Fork’ Exit AMA 1h 25m · 18 Sep 2026 · Hard Fork

Layoffs at the Kansas City Star will hurt local communities 15 min · 18 Sep 2026 · Kansas City Today

AWP: Beyond the Exam Room: Purpose, Myopia, and Population Health 54 min · 17 Sep 2026 · EyeCode Media

Planning Commission Meeting - Sep 17, 2026 1h 11m · 17 Sep 2026 · Leesburg Planning Commission

Heritage Commission - Sep 14, 2026 1h 57m · 17 Sep 2026 · Loudoun County Board Committees and Advisory Boards

Historic District Review Committee - Sep 14, 2026 1h 36m · 17 Sep 2026 · Loudoun County Board Committees and Advisory Boards

Report any issue

Source

Recorded21 Nov 2023

Publisherquantapodcast.quantamagazine.org ↗

Handlerec:4092199

Show notes

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.

Ask this episode

“What did the council decide on item 42?” — answered with the speaker and the moment.

Sign in