MCQST Colloquium: Dorit Aharonov

19 October 2021
from 14:30 to 16:00

MCQST Colloquium | Dorit Aharonov - Professor at the Hebrew University of Jerusalem

MCQST Colloquium

Address / Location

ONLINE

Zoom: https://lmu-munich.zoom.us/j/97696367352

Meeting ID: 976 9636 7352

Password: mcqst2022

The MCQST Colloquium Series features interdisciplinary talks given by visiting international speakers. The monthly colloquial covers topics spanning all MCQST research units and will be broadcasted live, being made available to audiences worldwide. The main goal of the series is to create the framework for idea exchange, to strengthen links with QST leading groups worldwide, as well as to act as an integral part of the local educational environment.


MCQST Colloquium: Dorit Aharonov

On October 19th 2021, we are excited to invite you to the colloquium offered by Dorit Aharonov, Professor at the Hebrew University of Jerusalem.

Title & Abstract

The 3rd quantum revolution: Quantum Algorithmic Experiments

Following the second quantum revolution, which had completely undermined how we think of algorithms, the last decade gave birth to a third quantum revolution - which has changed the way we think of physical experiments. I will demonstrate this with some examples of how quantum computational ideas such as quantum error correction and quantum algorithms can be used to enhance conventional quantum experiments, to achieve increased efficiency and precision in sensing, metrology, and more. I will then describe my recent work together with Cotler and Qi in which we generalize these developments and provide what we believe to be a universal mathematical model for quantum experiments; we call these QUantum ALgorithmic Measurements (QUALMs). In this framework, we show that certain experimental tasks (such as determining the time reversal symmetry of a many body quantum system), can be performed exponentially more efficiently if enhanced with even simple quantum computational abilities. Improvements on our initial protocols were recently implemented experimentally on Google's quantum computer (Hsin-Yuan Huang et.al., 2021). These and other results which I will mention, suggest that quantum experiments constitute a new and exciting playground in which quantum-computational advantages can be exhibited.

Based on joint work with Cotler and Qi: https://arxiv.org/abs/2101.04634


About the Speaker

Dorit Aharonov is a Professor at the school of computer science and engineering at the Hebrew university of Jerusalem, and the CSO of QEDMA quantum computing. In her PhD, Aharonov proved the quantum fault tolerance theorem together with her advisor Ben-Or; this theorem is one of the main pillars of quantum computation. She later contributed several pioneering works in a variety of areas within quantum complexity and algorithms, including quantum walks, quantum adiabatic computation, Hamiltonian complexity, quantum cryptography and quantum verification. Much of her research can be viewed as creating a bridge between physics and computer science, attempting to study fundamental physics questions using computational language. Aharonov was educated at the Hebrew university in Jerusalem (BSc in Math and Physics, PhD in Computer Science and Physics) and then continued to a postdoc at IAS Princeton (Mathematics) and UC Berkeley (Computer Science). She had joined the faculty of the computer science department of the Hebrew university of Jerusalem in 2001. In 2005 Aharonov was featured by the journal Nature as one of four theoreticians making waves in their chosen field; in 2006 she had won the Krill prize, and in 2014 she was awarded the prestigious Michael Bruno award. In 2020 she joined forces with Dr. Asif Sinay and Prof Netanel Lindner to co-found the company QEDMA quantum computing where she is now the CSO. In parallel, she continues to lead her quantum computation research group at the Hebrew university. 


If you would like to get more information about future talks, you can sign up for our mailing lists using the following links:

Accept privacy?

Accept privacy?

Scroll to top