Popular

quantum annealing

Quantum annealing is a heuristic method for solving integer optimization problems, relying on the principles of quantum mechanics. Unlike the classical analog, where crossing a high barrier requires thermal excitation and is random, here quantum tunneling dominates: the system 'passes' through narrow barriers, effectively leaving local minima and striving for the global one. Programming the problem reduces to setting longitudinal fields and couplings in the Ising model.

History

The idea appeared in the 1980s-90s as a generalization of the classical simulated annealing algorithm. The first commercial machine based on this principle was created by the Canadian company D-Wave Systems in 2011.

How it works

The problem is encoded in the energy of an artificial 'quantum magnet' consisting of many elements (qubits). The system is started in a simple but highly uncertain state and the control fields are slowly changed. Thanks to the tunneling effect (seeping through obstacles), it ends up with high probability in the state with the lowest energy — that is the answer.

💡 The D-Wave Advantage processor with 5000+ qubits solves some quadratic optimization problems in milliseconds, while a classical supercomputer would take hours for the same — but only for specially crafted instances.
Links in the knowledge graph 1
Scientists
Leo Esaki
Related tags
quantum algorithmquantum computerquantum tunneling
Laws
tunnel effect

Related articles

No articles yet