Organizer: Marc Fischlin
In the last decades a new model of computation based on quantum mechanics has gained attention in the computer science community. We give an introduction to this model and, with the help of some examples, explain why it seems to invalidate the complexity-theoretical Church-Turing thesis. We also provide an overview of the main results and open problems in the field, with a focus on the relevent topics in crypto: quantum search and quantum key distribution.
Giannicola Scarpa graduated from the University of Salerno in Computer Science in 2009. From 2009 to 2013 he was a PhD student at CWI, Amsterdam, the Netherlands, under the supervision of Ronald de Wolf. He received his PhD from University of Amsterdam in November 2013, defending a PhD thesis entitled “Quantum entanglement in non-local games, graph parameters and zero-error information theory”.