Abstract:
We start by very briefly sketching 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. Success amplification is introduced. The famous quantum algorithm for factorizing prime numbers (Shor) is sketched that allows breaking todays security. Error correction for quantum computers is introduced and the limitations of current quantum computers are discussed. The hybrid nature of quantum applications is revealed.
Vita:
Frank Leymann is a full professor of computer science at University of Stuttgart, Germany. His research interests include software architecture, highly-distributed applications, middleware, pattern languages, and quantum computing. Frank is co-author of about 600 peer-reviewed papers (H-index 93), more than 70 patents, and several industry standards. He is elected member of both, the Academia Europaea, Academia Scientarium et Artium Europea, he is fellow of several organizations, and Kurt Goedel visiting professor for quantum computing at TU Vienna. Also, he is a Technology Fellow at WSO2. His advice is asked for by the EU, several German government institutions, and CxOs of a couple of companies.
