An Introduction to the Lindblad Master Equation. Derivation from microscopic principles (part II)

The theory of open quantum system is one of the most essential tools for the development of quantum technologies. Furthermore, the Lindblad (or Gorini-Kossakowski-Sudarshan-Lindblad) Master Equation plays a key role as it is the most general generator of Markovian dynamics in quantum systems. In this presentation, we present this equation together with its derivation from microscopic principles. The presentation tries to be as self-contained and straightforward as possible to be useful to readers with no previous knowledge of this field. Undergrad, master, and PhD students are encouraged to assist.

Reference: https://pubs.aip.org/aip/adv/article/10/2/025106/1021638/A-short-introduction-to-the-Lindblad-master

Link to video

https://gloton.ugr.es/owncloud/index.php/s/pKaLRyWuVD7Ewae

An introduction to the Lindblad Master Equation I. Derivation from microscopic principles (part I)

The theory of open quantum system is one of the most essential tools for the development of quantum technologies. Furthermore, the Lindblad (or Gorini-Kossakowski-Sudarshan-Lindblad) Master Equation plays a key role as it is the most general generator of Markovian dynamics in quantum systems. In this presentation, we present this equation together with its derivation from microscopic principles. The presentation tries to be as self-contained and straightforward as possible to be useful to readers with no previous knowledge of this field. Undergrad, master, and PhD students are encouraged to assist.

Reference: https://pubs.aip.org/aip/adv/article/10/2/025106/1021638/A-short-introduction-to-the-Lindblad-master

Link to google meet
https://meet.google.com/boc-uamd-iti

Link to video of first lecture

https://gloton.ugr.es/owncloud/index.php/s/73FkMiOen2Ggrfb

Quantum computing for machine learning and data science III

Quantum computing is an emerging research field at the intersection of physics, computer science and applied mathematics. Quantum computers are devices that exploit coherent quantum phenomena to speed-up calculations. Quantum machine learning is a subfield of quantum computing that investigates the application of quantum computers algorithms for machine learning problems. This course will give an elementary introduction to quantum machine learning, and review a few examples of quantum algorithms for classification and clustering problems. In our first meeting, we will give a general introduction, and review quantum algorithms for solving linear systems of equations, Grover search and simulating sparse Hamiltonian dynamics.

Date: 16 June 2023

Time: 11:00 am

Location: Computational Physics Laboratory, Department of Electromagnetism and Condensed Mater, Ground Floor, Faculty of Science (next to the giant pendulum)

Quantum computing for machine learning and data science II

Quantum computing is an emerging research field at the intersection of physics, computer science and applied mathematics. Quantum computers are devices that exploit coherent quantum phenomena to speed-up calculations. Quantum machine learning is a subfield of quantum computing that investigates the application of quantum computers algorithms for machine learning problems. This course will give an elementary introduction to quantum machine learning, and review a few examples of quantum algorithms for classification and clustering problems. In our first meeting, we will give a general introduction, and review quantum algorithms for solving linear systems of equations, Grover search and simulating sparse Hamiltonian dynamics.

Date: 13 June 2023

Time: 11:00 am

Location: Computational Physics Laboratory, Department of Electromagnetism and Condensed Mater, Ground Floor, Faculty of Science (next to the giant pendulum)

Quantum computing for machine learning and data science

Quantum computing is an emerging research field at the intersection of physics, computer science and applied mathematics. Quantum computers are devices that exploit coherent quantum phenomena to speed-up calculations. Quantum machine learning is a subfield of quantum computing that investigates the application of quantum computers algorithms for machine learning problems. This course will give an elementary introduction to quantum machine learning, and review a few examples of quantum algorithms for classification and clustering problems. In our first meeting, we will give a general introduction, and review quantum algorithms for solving linear systems of equations, Grover search and simulating sparse Hamiltonian dynamics.

Date: 2 June 2023

Time: 11:00 am

Location: Computational Physics Laboratory, Department of Electromagnetism and Condensed Mater,  Ground Floor, Faculty of Science (next to the giant pendulum)

Quantum Statistical Inference—Hypothesis Testing and Parameter Estimation

In this second lecture we will revisit the Hypothesis testing and parameter estimation scenarios discussed in the previous lecture, except we shall be invoking quantum theory. In the case of quantum Hypothesis testing I shall review Holevo’s optimality theorem which establishes the conditions for achieving the maximum probability of success in a hypothesis testing scenario involving quantum states and measurements. We shall also cast these conditions in terms of semi-definite programs and apply them to obtain the optimal measurement (aka the Helstrom measurement) for the case of binary hypothesis testing. We will then consider quantum parameter estimation, review the quantum version of the Cramér-Rao bound and the Quantum Fisher Information (QFI). These concepts will be applied to the simple case of interferometry where we will encounter the Standard and Heisenberg limits in estimation precision.

Seminar Michalis Skotiniotis: Classical Statistical Inference—Hypothesis Testing and Parameter Estimation

Statistical inference is an important branch of decision theory and deals with taking optimal decisions in the face of uncertainty. For instance, the decision of whether a new drug combats a given disease or not is taken based on samples taken from medical trials and forms the primary example of classical hypothesis testing. On the other hand, determining the precision in the estimation of a certain physical constant—such as the value of the gravitational constant g—is an example of parameter estimation. In this talk we will go through both these tasks from the point of view of statistical decision theory. In the case of hypothesis testing we will derive the optimal decision rule for minimizing the probability of erroneously identifying the likely hypothesis, as well as several variants of symmetric and asymmetric hypothesis testing (the famous Neyman-Pearson theorem). For parameter estimation we will derive the celebrated Cramér-Rao theorem which sets a lower bound on the precision of any unbiased estimator, and we will connect this to the traditional error propagation formula we all know and love (or hate as the case may be).

Use the following link (https://gloton.ugr.es/owncloud/index.php/s/p6avxB0j8lBz3Qa) to download the notes for this seminar