8 avril 2022
8 avril 2022 de 15 h 30 à 16 h 30 (heure de Montréal/HNE) Réunion Zoom
Lauréat 2021 du prix CAP-CRM
We show that every quantum computation can be described by a probabilistic update of a probability distribution on a finite phase space. Negativity in a quasiprobability function is not required in states or operations, which is a very unusual feature. Nonetheless, our result is consistent with Gleason’s Theorem and the Pusey-Barrett- Rudolph theorem.
The reason I have chosen this subject for my talk is two-fold: (i) It gives the audience a glimpse of the quest to understand the quantum mechanical cause for speed-up in quantum computation, which is one of the central questions on the theory side of the field, and (ii) Maybe there can be feedback from the audience. The structures underlying the above probabilistic model are the so-called Lambda-polytopes, which are highly symmetric objects. At present we only know very few general facts about them. Help with analysing them would be appreciated!
Joint work with Michael Zurel and Cihan Okay,
Journal reference: Phys. Rev. Lett. 125, 260404 (2020)