Study of Quantum Annealing and the type of related applications
Akash Kalluvilayil Venugopalan, R. K. Karishmah, Ranjith Pillai, D. Sreedev, Vishnu Balachandran, Payel Bhattacharjee · 2021
Most of the modern day computations are considered as an NP-hard like solving a puzzle or traveling salesman problem. Over the decades, engineers are exploring for many approaches of solution, out of which Quantum Annealing has depicted the efficacy. In this paper, we do a review study of Quantum Annealing (i.e., an approach to find the global mini-mum of a particular function that can provide better heuristics for the NP-hard optimization problem) and discussed briefly about quantum computers. Not only that, we also showcase few applications of quantum annealing which include scheduling problem, lung cancer detection, coherence in quantum annealer, and clustering.