Quantum Computing: From Algorithms to Aplications
Day, Date & Time: Thursday, 30th March, 2017 at 2:30 pm
Venue: SSCU Auditorium
There are problem in computer science such as factorization of a number with prime factors or searching in a non ordered array, which takes exponentially larger time with increasing digits in the number or increasing entries in the list. Quantum computing is supposed to be in a position to solve such problemin polynomial time. This seminar will focus on providing necessary mathematical foundations for quantum computing along with physical realizations.Then Shor’s algorithm for factorizing large integers and indexing a number from a large unsorted list of integers in polynomial time using Grover’s algorithm will be discussed. Finally the calculation of potential energy of Hydrogen molecule by Iterative Phase Estimation Algorithm(IPEA) will be discussed.
1. SIAM Journal on computing, 26 (5), 1484, (1997)
2.STOC 96 proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212-219 (1996).
3.Nature Chemistry, 2, 106-111 (2010).
All ARE CORDIALLY INVITED TO ATTEND