We invite you to the next (remote) meeting of the Warsaw Quantum Computing Group, 13.07 at 18:00 CEST! The talk "Variational Quantum Algorithms – how do they work?" will be given by Michał Stęchły.

If you are interested, please register (no later than 12.07, EOD).

Abstract:
Variational Quantum Algorithms (VQA) is a class of algorithms that seems to be most promising for the near-term quantum computers. In this talk, I'll explain how they work and what's the motivation behind them. I will focus on VQE and QAOA, but will also present a more general framework explaining how different elements of VQAs work together. The presentation will be partly based on my blog posts on this topic (https://www.mustythoughts.com/variational-quantum-eigensolver-explained and www.mustythoughts.com/Quantum-Approximate-Optimization-Algorithm-Explain...).

Bio:
Michal Stechly has a background in physics, machine learning and broadly defined engineering. Professionally, he has merged these skills to bridge the gap between research and software engineering. His main interests in quantum computing are variational algorithms, optimization and near-term applications. He works as a Quantum Software Engineer at the Toronto office of Zapata Computing (http://www.zapatacomputing.com) and is a core team member of Quantum Open Source Foundation (http://www.qosf.org) and Q4Climate initiative (http://www.q4climate.org). He also is an author of a blog Musty Thoughts (http://www.mustythoughts.com), where he shares his knowledge and experience about QC.