Home▸Quantum Computing▸Quantum vs Classical Annealing: Tunneling Through Barriers

Quantum Annealing vs Classical Simulated Annealing

Race a classical simulated-annealing marble against a quantum-annealing probability cloud across the same rugged energy landscape. Tune barrier height and width to see when tunneling wins and when it doesn't.

Quantum Computing3DAdvanced60 FPS

Details

CategoryQuantum Computing

RenderingThree.js · WebGL

DifficultyAdvanced

Target FPS60

ControlsBarrier height and width sliders reshape the landscape's two barriers live; Tall & thin / Wide & short presets jump to demonstrative configurations; Randomize valleys reshuffles the well depths and positions; Start temperature and Tunneling strength sliders tune each search's schedule; Run speed sets steps per frame; Run/Pause and Reset control the live side-by-side race.

quantum annealingsimulated annealingquantum tunnelingoptimizationlocal minimacombinatorial optimization

Related simulations

Simulated Annealing — Escaping Local MinimaSolve a travelling-salesman tour with simulated annealing: accept worse moves with…

Future Technology Teleportation SimulationThis simulation explores the theoretical requirements for instantaneous matter transfer.…

Quantum Thermodynamics System InteractiveThis interactive simulation explores the complex relationship between quantum mechanics and… ⊞ All 160 in Quantum Computing →

Watch a classical simulated-annealing marble and a quantum-annealing probability cloud search the same rugged 1D energy landscape for its global minimum. The marble can only escape a valley by thermally hopping over a barrier — a move whose odds depend purely on how tall that barrier is. The quantum cloud gets an extra channel, tunneling, whose odds depend mainly on how thin the barrier is. Tune barrier height and width to build landscapes where tunneling is decisive and landscapes where it makes no difference at all.

⚙ Under the hood

Race a classical simulated-annealing marble against a quantum-annealing probability cloud on the same rugged 1D energy landscape. Tune barrier height and width to see when quantum tunneling escapes a local minimum that traps the classical search, and when a wide-but-short barrier lets classical do just as well.

quantum annealingsimulated annealingquantum tunnelingoptimizationlocal minimacombinatorial optimization

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install