A series of informal presentations on quantum computing with topics: computational complexity, entanglement, stochastic quantum evolutions, and randomized measurements
Tentative program for May 30th:
9:00-9:30: S. True (U. Boston) Complexity of Entanglement
9:30-10:00: M. Votto (LPMMC) Revealing entanglement structure via partial transpose moments
10:00-10:30: A. Hamma (U. Boston) Magic hinders quantum verification
11:00-11:30: M. Engelbrecht (ITP Innsbruck) Party-local Clifford transformations of stabilizer states
11:30-12:00: L. Joshi (ITP Innsbruck) Measuring spectral form factors and otocs
12:00-12:15: B. Vermersch (LPMMC) Open questions for tomorrow
14:00-14:30: A. Rath (LPMMC) Measuring the operator entanglement barrier and the quantum Fisher information on quantum processors
14:30-15:00: C. Lancien (Fourier institute) TBA
15:30-16:00: J. Carrasco (ITP Innsbruck) Concentration of measure: a possible application of Levy’s lemma
16:00-16:30: T. Kraft (ITP Innsbruck) Classical shadows for boson sampling
16:30-17:00: X. Waintal (CEA Grenoble) Simulating quantum computers with approximate quantum state compression algorithms
17:00-17:30: B. Vermersch (LPMMC) Open questions for tomorrow
You areYou wishSubmitShare the linkCopyCopiedClose the modal windowShare the URL of this pageI recommend:Consultable at this address:La page sera alors accessible depuis votre menu "Mes favoris".Stop videoPlay videoMutePlay audioChat: A question? Chatbot Robo FabricaMatomo traffic statisticsX (formerly Twitter)