QNickel Workshop
7-11.10.2024
QNickel - Quantum Computing and Programming Workshop
Join a free, remote workshop and expand your ability to create quantum programs.
This is an intermediate-level workshop (a follow-up to the QBronze workshop).
The event is free, but if you can, we encourage you to support the fundraising for the victims of the recent flooding in Poland:
Key information
Workshop dates: 7-11.10.2024 (5 days)
Duration of classes each day: from 7:00 PM to 10:00 PM (UTC+2)
Online meeting platform: Zoom
Instructor: Alex Linden
Mentors: Martyna Czuba, Justyna Zawalska, Paweł Gora, Amrit Chhetri, Mateusz Anuszewski
Registration form: https://docs.google.com/forms/d/e/1FAIpQLScQjiYIjJU9Ch9Nq9OqOciNaJ9gtVYDlREtOzGvCmifcJyGjQ/viewform (will be open until 6.10.2024 or until the registration limit is reached).
Additional details
The workshop will be conducted in English based on QNickel materials.
Participants will solve programming tasks in Python using the Qiskit and Cirq platforms.
A series of live lectures will be prepared for participants to assist in independently solving tasks.
Meetings will be organized online on the Zoom platform. Discord will also be used as an auxiliary communication tool.
Throughout the workshops, mentors will provide support, answering questions, and checking progress.
The workshop will be held over 4 days, with approximately 15 hours of training.
Participants who successfully complete the assignments will receive certificates!
Anticipated schedule
CONVENTIONAL QUANTUM ALGORITHMS IN QISKIT
DAY 1 (7.10.2024) | (19:00 – 22:00 UTC+2)
Qiskit introduction
Classical gates
Phase kickback
Deutsch algorithm
DAY 2 (8.10.2024) | (19:00 – 22:00 UTC+2)
Deutsch-Jozsa algorithm
Bernstein-Vazirani algorithm
Day 3 (9.10.2024) | (19:00 – 22:00 UTC+2)
Simon algorithm
SOLVING MAX-CUT PROBLEM USING GROVER'S SEARCH IN CIRQ
DAY 4 (10.10.2024) | (19:00 – 22:00 UTC+2)
Cirq introduction
Grover algorithm revisited
DAY 5 (11.10.2024) | (19:00 – 22:00 UTC+2)
Max-Cut Problem and Bipartite Graphs
Adders and numbers checking
Grover algorithm for Max-Cut Problem
Organizers