您的瀏覽器不支援JavaScript語法,網站的部份功能在JavaScript沒有啟用的狀態下無法正常使用。

Institute of Information Science, Academia Sinica

Events

Print

Press Ctrl+P to print from browser

Seminar

:::

(Quantum) lower bounds for approximating the top eigenvector

  • LecturerMr. Yan Lin Chen (Algorithm and Complexity group, CWI and QuSoft)
    Host: Kai-Min Chung
  • Time2023-05-11 (Thu.) 11:40 ~ 13:40
  • LocationAuditorium 101 at IIS new Building
Abstract
In this talk, we will talk about classical and quantum query lower bounds for approximating the top eigenvector. We will also talk about some possible approaches to achieve the tight upper bound for approximating the top eigenvector. (This is an ongoing project with Andras Gilyen and Ronald de Wolf)