Peter Selinger – Number-theoretic methods in quantum computing

April 28th, 2016 An important problem in quantum computing is the so-called approximate synthesis problem: to find a quantum circuit, preferably as short as possible, that approximates a given unitary operator up to given epsilon. Moreover, the solution should be computed by an efficient algorithm. For nearly two decades, the…

Continue reading

Mireille Bousquet-Melou – Compter des cartes planaires colorées

11 déc. 2014 On illustrera quelques principes et approches de combinatoire énumérative, en se concentrant sur les objets classiques que sont les cartes planaires. On les rencontre aussi bien en informatique (géométrie algorithmique) qu’en mathématiques (probabilités ; algèbre) et en physique théorique (gravitation quantique). On verra passer de belles formules…

Continue reading

Rudolph Kalman – Can it be Done in Software?

Sept. 25, 2014 The symbiosis of software with computer, sensors and actuators creates a new kind of physical engineering system. Robots used in space exploration and GPS – on the ground, GPS is just a « giant Kalman filter » – are great examples. But the future potential is difficult to estimate.…

Continue reading