Talk Timings: May 1, 2021 (Saturday) 3.00 PM-3.55 PM IST
Abstract:
The traveling salesman problem is a well-known combinatorial optimization problem, and finding its exact solution is an NP-hard problem as its solution space grows exponentially with the problem size. Such problems appear quite frequently in logistics, finance, and pharmaceutical industries. There exist algorithms to find approximate solutions in the desired time. In this talk, I will present a few such problems and procedures (simulated annealing, quantum annealing, and Quantum Approximate Optimization Algorithm) for their solutions.
Bio:
Dr. Arun completed his Ph.D. in Hybrid Quantum Computation from the Centre for Quantum Technologies, NUS, Singapore after completing his Masters in Physics from IIT-Roorkee. He has more than 10 years of research experience in quantum computation and information, simulation & optimization. He has written ten research articles, including five single-author and four first-author papers, and has presented papers in 14 international conferences plus 6 invited talks. He has teaching and working experience with students from NUS Singapore, IQOQI Innsbruck Austria, University of Guadalajara Mexico, IISER Mohali, and HRI Allahabad. Currently, he is working as a quantum research scientist at QpiAI.