Read out

CANCELLATION Guest Talk: Quantum Computing: A Brief Introduction

We have to inform you that the guest talk planned for 11.12.2018 will not take place. We will hope­fully have Prof. Leymann visiting us in a couple months. 

Abstract 

We start by briefly remin­ding the notion of uncer­tainty and super­po­si­tion from quantum physics. Based on this, the concept of a quantum bit, the role of measu­re­ments, as well as the funda­mental struc­ture of a quantum algo­rithm are intro­duced. Next, quantum regis­ters and entan­gle­ment are discussed. Opera­tors to mani­pu­late quantum regis­ters are presented. The problem of deco­he­rence is sket­ched. Next, the algo­rithm of Deut­sch-Jozsa reveals the poten­tial of expo­nen­tial speedup of quantum algo­rithms. Algo­rithms to speedup unstruc­tured search (Grover) and facto­riza­tion (Shor) are sket­ched. A glimpse on quantum infor­ma­tion follows. Finally, the possible mid term use of quantum compu­ters is discussed.

Note: The talk assumes back­ground know­ledge in linear algebra.

Bio 

Frank Leymann is a full professor of computer science at Univer­sity of Stutt­gart, Germany. His rese­arch inte­rests include service- oriented archi­tec­tures and asso­ciated midd­le­ware, work­flow- and busi­ness process manage­ment, cloud compu­ting and asso­ciated systems manage­ment aspects, and patterns. Frank is co-author of more than 400 peer-­re­viewed papers, about 70 patents, and several industry stan­dards. He is elected member of the Academy of Europe.



Back to overview