Quantum Cryptography

Quantum Computing



Publications / Slides

The Impossibility of Pseudo-Telepathy
Without Quantum Entanglement
research project,
joint work with Alain Tapp and Stefan Wolf, Université de Montréal, Canda

Will be presented:
- International Symposium on Information Theory 2003 in Yokohama, Japan, July 2003 (ISIT 2003, IEEE Conference).

Slides not yet available.

Paper:
- Abstract not yet available
- Extended Abstract PDF (168 kb), Postscript (131 kb), ZIP(PS) (54 kb).

...how to Convince Your (Smart) Children
of Quantum Entanglement
research project,
joint work with Stefan Wolf, Université de Montréal, Canada

Presented:
- International Symposium on Information Theory 2002 in Lausanne, July 2002 (ISIT 2002, IEEE Conference).

Slides not yet available.

Paper:
- Abstract PDF (107 kb), ZIP(PS) (32 kb), PS (74 kb)
- Extended Abstract PDF (166 kb).

Classical Pseudo-Telepaty
and Coloring Graphs
(diploma thesis and research project, supervisor: Stefan Wolf, University of Waterloo, Canada)

Talks held at
- Univesity of Waterloo (Canada) in January 2001,
- Swiss Federal Institute of Technology (ETH Zurich) in April 2001.

Slides of the talk and more detailed slides.

Paper: PDF (444 kb), PS.GZ (857 kb),
PS (857 kb), ZIP(PS) (468 kb),

Linking Classic and
Quantum Key Agreement
term project, supervisor: Stefan Wolf, ETH Zurich

Talk held at ETH Zurich in June 2001 (Slides)

Paper: PDF (126 kb), ZIP(PS)(130 kb),
PS (553 kb),

The Grover Algorithm
...and a short introduction into quantum computing, supervisor: Jochen Giesen, ETH Zurich

Talk held in January 2000 at ETH Zurich (Slides)

Autor: Viktor Galliard

Home: http://math.galliard.ch

Classical Pseudo-Telepathy and Colouring Graphs: Abstract
In 1935, Einstein, Podolsky and Rosen described a Gedankenexperiment which in their opinion disclosed a paradoxical consequence of quantum mechanics, predicting that when measurements are carried out on certain particles, so-called EPR pairs, their outcome is perfectly correlated even when the measurements are spacelike seperated.
Bell could generally show in 1964 that certain separated quantum systems cannot be classically simulated by using only hidden local variables and without any communication.
This raises the following question: For a given a quantum scenario, what is the amount of information that must be exchanged for perfectly simulating it?
It was shown by Brassard, Cleve and Tapp in 1999 that surprisingly, a small number of bits is sufficient in some cases (even though the number of possible measurement bases is uncountably infinite).
The analysis of a so-called pseudo-telepathy game which is closely related to the mentioned questions leads to problems of graph theory and combinatorics of finite sets.