BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:A practical introduction to quantum computing: from qubits to quan
tum machine learning and beyond
DTSTART;VALUE=DATE-TIME:20201127T093000Z
DTEND;VALUE=DATE-TIME:20201127T113000Z
DTSTAMP;VALUE=DATE-TIME:20210618T164000Z
UID:indico-event-970906@indico.cern.ch
CONTACT:QTI-info@cern.ch
DESCRIPTION:Speakers: Elias Fernandez-Combarro Alvarez (Universidad de Ovi
edo (ES))\n*** The webcast is now over - The recording link is posted at t
he bottom of this page ***\n\nGeneral description of the course\n\nQuantum
computing is one the most promising new trends in information processing.
In this course\, we will introduce from scratch the basic concepts of the
quantum circuit model (qubits\, gates and measures) and use them to study
some of the most important quantum algorithms and protocols\, including t
hose that can be implemented with a few qubits (BB84\, quantum teleportati
on\, superdense coding...) as well as those that require multi-qubit syste
ms (Deutsch-Jozsa\, Grover\, Shor..). We will also cover some of the most
recent applications of quantum computing in the fields of optimization and
simulation (with special emphasis on the use of quantum annealing\, the q
uantum approximate optimization algorithm and the variational quantum eige
nsolver) and quantum machine learning (for instance\, through the use of q
uantum support vector machines and quantum variational classifiers). We wi
ll also give examples of how these techniques can be used in chemistry sim
ulations and high energy physics problems.\n\nThe focus of the course will
be on the practical aspects of quantum computing and on the implementatio
n of algorithms in quantum simulators and actual quantum computers (as the
ones available on the IBM Quantum Experience and D-Wave Leap). No previou
s knowledge of quantum physics is required and\, from the mathematical poi
nt of view\, only a good command of basic linear algebra is assumed. Some
familiarity with the python programming language would be helpful\, but is
not required either. \n\n====\n\nLecture 4: Multiqubit systems \n\nMul
tiqubit gates and universality. Quantum parallelism. Deutsch-Jozsa algorit
hm. Grover algorithm. Shor algorithm. HHL algorithm.\n\n===\n\nBiography o
f the speaker\n\nElías F. Combarro holds degrees from the University of
Oviedo (Spain) in both Mathematics (1997\, award for second highest grades
in the country) and Computer Science (2002\, award for highest grades in
the country). After some research stays at the Novosibirsk State Universit
y (Russia)\, he obtained a Ph.D. in Mathematics (Oviedo\, 2001) with a dis
sertation on the properties of some computable predicates under the superv
ision of Prof. Andrey Morozov. Since 2009\, Elías F. Combarro has been an
associate professor at the Computer Science Department of the University
of Oviedo. He has published more than 50 research papers in international
journals on topics such as Computability Theory\, Machine Learning\, Fuz
zy Measures and Computational Algebra. His current research focuses on the
application Quantum Computing to algebraic\, optimization and machine lea
rning problems. From July 2020 he has been a Cooperation Associate at CERN
openlab.\nhttps://indico.cern.ch/event/970906/
URL:https://indico.cern.ch/event/970906/
END:VEVENT
END:VCALENDAR