Random Walk on Graphs in a Quantum Way

Presenter: Dr. Amlan Chakrabarti

Topic overview:

Quantum computing is an area of research that is attracting increasing attention because of the possibility
of a drastic speedup over classical computing for various important computational problems. A quantum
algorithm is defined by a sequence of operations that runs on a realistic model of quantum computation.
Since the first quantum algorithm proposed by David Deutsch (1985), several impressive quantum
algorithms have been developed. Quantum random walks on a graph, which are analogous to classical
stochastic walk, form the basis for some of the recent quantum algorithms that promise to significantly
outperform existing classical random walk algorithms. These randomized algorithms are significant
because they are often some of the simplest and fastest known ways to solve hard computational
problems. Important applications include solving a variety of graph theory problems, the fastest known
tests of primality, and solving Boolean satisfiability problems. The key ideas to be presented in this
tutorial will be based on the research work done by the presenter as a Post-doctoral Research Associate at
the Princeton University, USA (2011-2012).

Target Audience:

Participants should have a background of computer algorithms and graph theory. Engineers/Professionals
having a degree in computer science/information technology/mathematics/statistics/physics are welcome.

Content Details:

This tutorial will consist of two important sections:

1. Introduction to quantum computing and quantum algorithms and discussion on the basic
strategies for discrete-time and continuous-time quantum random walk over graphs.
2. A brief insight will be given to some of the interesting algorithms like Triangle Finding on a
graph, Binary Welded Tree problem and NAND formula evaluation based on the random
quantum walk model.

Format:

Standard presentation environment with LCD projector and Laptop and a white board will be good. If
software demonstration is done that will be taken care by the presenter.
Brief bio of the presenter:

Dr. Amlan Chakrabarti is presently associated with the Dept. of Electrical Engineering, Princeton
University as a Visiting Research Associate. He also holds the position of Reader and the Coordinator of
School of Information Technology, University of Calcutta, India. He is the recipient of BOYSCAST
fellowship award in Engineering Science, 2011, by DST, Govt. of India. He is an Post-doctoral fellow of
the Dept. of Electrical Engineering Princeton University (2011-2012), Ph.D.(Tech.) and M.Tech. from the
University of Calcutta. His did his research work in collaboration with Indian Statistical Institute (2004-
2008) in the domain of Quantum Computing. Earlier in his career, he had held academic positions in the
Dept. of CSE, West Bengal University of Technology, Meghnad Saha Institute of Technology and IIIT
Kolkata. He was an EDA engineer in Orcad Inc., Bangalore, India (2000-2001). He has also held visiting
positions in the GSI, Helmholtz Lab., Germany ( 2010), Dept. of CSE., State University at Buffalo New
York (2007). He is a member of IEEE and a life member of Computer Society of India. He is a reviewer
of IEEE Transactions on Computers, Elsevier SIMPAT and editorial board member of IJCA (USA). He
has been the program committee member of VDAT 2012, CISIM 2011, RETIS 2011, EAIT 2011,
PCSPA 2010, VLSI 2010, DATICS 2009 etc. He has around 45 publications in International Journals and
Conferences. He has been the Principal Investigator of projects funded by DRDO, DST and NIOH, India.
His research interests lies in Quantum Computation, VLSI Design, Embedded Systems and Image and
Video processing.