This workshop focuses on combinatorial optimization using quantum computers or pseudo-quantum technology.
Combinatorial optimization problems are important challenges that appear in all aspects of our society and industry, such as shift scheduling and logistics planning. However, as the scale of the problem increases, the number of combinations increases rapidly, leading to a so-called "combinatorial explosion," making it difficult to solve. Therefore, combinatorial optimization using quantum computers is attracting attention.
In this workshop, participants will learn about combinatorial optimization using "quantum annealing," a type of quantum computer. We will provide an opportunity for participants to experience the process of solving combinatorial optimization problems by deepening their understanding through specific demonstrations and conducting programming exercises using a pseudo-quantum annealing machine.
This is an excellent opportunity to experience practical applications of quantum technology and deepen your understanding of this innovative field. We look forward to your participation.
【Date and Time】
Nov 25 (Mon), Nov 26 (Tue) 10:00-13:10
※Number of sessions: 6 in total (3 sessions per day x 2 days)
【Format】
In-person
※There are no plans for recording or online streaming.
【Venue】
AIC Lounge, 2nd Floor, Hiyoshi Kyoseikan Collaboration Complex
【Target Participants】
Keio students and faculty/staff
・Those interested in combinatorial optimization and programming using quantum computers (knowledge of simple Python statements such as for loops is desirable)
・No special knowledge of quantum computers is required
・Open to all majors and years
【What to bring】
Google account (keio.jp), laptop PC
【Advance Registration】
Required
Click here for Keio students to apply
※Please note that if there are many applications, a lottery may be held.
【Organizer, etc.】
AIC
Please see here for details regarding application contents, etc.