Dear all,

This week Johannes Bausch from Cambridge is visiting us. He'll be in the centre today and tomorrow for the 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]
• Algorithm for maximum finding [Durr, Hoyer 1996 and Ahuja, Kapoor 1999]
• 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.

Best wishes,

Lídia