Quantum Walks and Swinging Pendulums: Two Sides of the Same Coin ⚡ экспресс
Quantum walks on graphs and systems of harmonic oscillators (masses and springs) are two BQP-complete problems (the hardest class for a quantum computer). The work establishes an elegant direct mapping between them, like a Rosetta Stone that translates from one computational 'language' to another. The mapping preserves the problem structure, requires modest resources, and allows direct transfer of algorithms from one paradigm to another. This not only simplifies proofs of computational completeness but also provides a recipe for creating new quantum algorithms.
It turns out that two completely different languages describe one quantum reality. In one, a particle strolls through a city along all streets simultaneously. This is a quantum walk, and it’s linked to spectroscopy of that road network. In the other, coupled pendulums swap nudges. Scientists have built a bridge: any walking algorithm can be precisely turned into oscillations — and vice versa.
It’s like translating a symphony from the language of violins to the piano without losing a single note. The translation preserves the entire structure: the arrangement of nodes and the data input. Now you can choose the most convenient representation — like a map or a timetable. This simplifies proving complexity.
An unexpected conclusion: the chaotic trajectories of a wanderer and the measured rhythms of springs are mathematically indistinguishable. Ideas from one field instantly work in the other. Quantum computers will become better at modeling molecules and the evolution of black holes.
Richard Feynman dreamed of quantum machines that unveil nature’s secrets.
🎯 The harmonic oscillator is one of the most universal models in physics. It describes everything: from atomic vibrations in a crystal to ripples in spacetime.
🎬 Perhaps the sentient ocean in Lem’s Solaris is a giant network of interconnected oscillators, where every wave carries a thought.