For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.

Srinivasan Arunachalam studies quantum algorithms. He considers two natural complexity measures often used to understand and compare classical and quantum algorithms: gate complexity and query complexity. He also looks at the sample and query complexity of quantum machine learning algorithms.

Event details of Quantum algorithms and learning theory
Date 25 April 2018
Time 14:00 -15:00
Location Agnietenkapel
Room Location

S. Arunachalam: Quantum Algorithms and Learning Theory.

Supervisors

Prof. R.M. de Wolf

Prof. H.M. Buhrman

Agnietenkapel

Room Location

Oudezijds Voorburgwal 229 - 231
1012 EZ Amsterdam

Entrance

This event is open to the public.