Quantum annealing
In this video we review the basics of a paradigm in quantum computing called quantum annealing. Different from the gate-based model we are often exposed to, quantum annealing became the first approach to compete with classical algorithms in certain tasks, mostly related to optimization. We also give a few examples where quantum annealing can be applied in the scope of optimizing cost functions.
Prerequisite knowledge
- Basic knowledge about Hamiltonians and spin systems.
- Basic knowledge about optimization methods.
Main takeaways
- Gate-based models are not the only paradigm employed in quantum computing. Quantum annealing has been around for a while.
- Further progress in quantum computing will be with gate-based models because of scalability issues with quantum annealing.
- Quantum annealing serves as a good understanding of how physical systems can be mapped to optimization schemes in industrial problems.
Further thinking
Which field is better suited for quantum annealing?
a. Driving routes
b. Combinatory
c. Protein folding
d. All of the above
Further reading
Quantum annealing in the transverse Ising model. Tadashi Kadowaki and Hidetoshi Nishimori Phys. Rev. E 58, 5355–5363 (1998)
A numerical implementation of quantum annealing Diego de Falco et al. Conference: Stochastic Processes, Physics and Geometry July, 1988
Quantum Annealing for Industry Applications: Introduction and Review S. Yarkoni Et al. arXiv: 2112.07491