Dear all, This week Johannes Bausch <http://www.damtp.cam.ac.uk/people/jkrb2/> from Cambridge is visiting us. He'll be in the centre today and tomorrow for the Open Source Quantum Computing workshop <http://squids.ch/2019/05/open-source-quantum-computing-workshop/>, will come to Hönggerberg on Wednesday and will visit IBM on Thursday. Tomorrow's QIT group meeting will be replaced with Johannes' lecture at the workshop: *Maximum finding with quantum computers* * Motivation: finding the maximum of a list * Grover’s algorithm: extension to unknown number of elements * Toy example: finding ‘not the smallest element’ * Circuit to compare bit strings [Sena Oliveira, Melo Sousa & Viana Ramos 2006 <https://ieeexplore.ieee.org/abstract/document/4433341>] * Algorithm for maximum finding [Durr, Hoyer 1996 <http://arxiv.org/abs/quant-ph/9607014>andAhuja, Kapoor 1999 <http://arxiv.org/abs/quant-ph/9911082>] * Extensions, speed-ups and applications This will take place at 9:00 in HG D3.1. It will be followed by a coffee break and then a tutorial on how to implement this algorithm on ProjectQ by Ngyuen Damien, from Huawei. For the full programme of the workshop, see the website <http://squids.ch/2019/05/open-source-quantum-computing-workshop/>. Best wishes, Lídia