We start by briefly reminding the notion of uncertainty and superposition from quantum physics. Based on this, the concept of a quantum bit, the role of measurements, as well as the fundamental structure of a quantum algorithm are introduced. Next, quantum registers and entanglement are discussed. Operators to manipulate quantum registers are presented. The problem of decoherence is sketched. Next, the algorithm of Deutsch-Jozsa reveals the potential of exponential speedup by quantum algorithms. Algorithms to speedup unstructured search (Grover) and factorization (Shor) are sketched. Quantum cryptography is briefly addressed. A glimpse on quantum information follows. Finally, the possible mid term use of quantum computers is discussed.
Note: The talk assumes background knowledge in linear algebra.
Johanna Barzen studied media science, musicology and phonetics at the University of Cologne. Next to this she studied costume design at the ifs (international film school Cologne) and worked in several film productions in the costume department in different roles. Currently she is Postdoc and research staff member at the Institute of Architecture of Application Systems (IAAS) at the University Stuttgart performing research on Digital Humanities, Pattern Languages and Quantum Computing.
Frank Leymann is a full professor of computer science at University of Stuttgart, Germany. His research interests include service-oriented architectures and associated middleware, workflow- and business process management, cloud computing and associated systems management aspects, and patterns. Frank is co-author of more than 450 peer-reviewed papers, about 70 patents, and several industry standards. He is elected member of the Academy of Europe.
