Seminar at SMU Delhi

A (Alice) and B (Bob) wish to generate at two different places the same i.i.d. sequence $X_1, X_2, ...$ with values in the finite set $\{1,2,...,N\}$ with $P(X_n = j) = p_j >0$ but in such a manner that their common data set cannot be accessed by E (Eve), an evesdropper. Using a biorthogonal sequence in a complex Hilbert space of dimension $N$ and a quantum theoretical protocol along with a telephone we shall achieve this goal. The protocol is based on simple linear algebra and probability on a finite set. The lecture will be accessible to M.Stat students. Reference: Bennet, C. H. and Brassard, G. Quantum key distribution and coin tossing. \emph{Proc. IEEE Int. Conf. on computers, systems and signal processing}, Bangalore 1984, p. 175--179, IEEE, N.Y. 1984.