This book is a pedagogical presentation aimed at advanced undergraduate students, beginning graduate students and professionals who are looking for an introductory text to the field of Distance Geometry, and some of its applications.

This versions profits from feedback acquired at undergraduate/graduate courses in seminars and a number of workshops.


This book is about quantum computing and quantum algorithms. The book starts with a chapter introducing the basic rules of quantum mechanics and how they can be used to build quantum circuits and perform computations.
Further, Grover's algorithm is presented for unstructured search discussing its consequences and applications. 
Next, important techniques are discussed such as Quantum Fourier Transform and quantum phase estimation. Finally, Shor's algorithm for integer factorization is explained.
At last, quantum walks are explained in detail covering both the discrete and continuous time models,and applications of this techniques are described for the design and analyses of quantum algorithms.