{"id":152,"date":"2019-07-16T10:13:54","date_gmt":"2019-07-16T10:13:54","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/?page_id=152"},"modified":"2019-09-11T12:15:03","modified_gmt":"2019-09-11T12:15:03","slug":"towards-a-quantum-computational-advantage-with-near-term-technologies","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/?page_id=152","title":{"rendered":"Towards a quantum computational advantage with near-term technologies"},"content":{"rendered":"

\"\"<\/p>\n

Omar Fawzi<\/a>, ENS Lyon<\/a>.<\/p>\n

One of the goals of quantum information science in the next few years is to use the available quantum technologies to demonstrate a speedup over classical computers for some computational task.<\/p>\n

In this talk, I will start by describing the model of quantum computing, the corresponding complexity classes as well as the basic quantum algorithmic techniques.<\/p>\n

Then, I will describe some of the recent research activity aiming to achieve a quantum computational advantage with current technologies, focusing on Bravyi, Gosset and Koenig’s paper quantum advantage with shallow circuits<\/a> and, if time permits, on Bouland, Fefferman, Nirkhe and Vazirani’s paper quantum supremacy and the complexity of random circuit sampling<\/a>.<\/p>\n

References:<\/p>\n

    \n
  1. John Watrous’ lecture notes.<\/a><\/li>\n
  2. Adam Bene Watts<\/a>, Robin Kothari<\/a>, Luke Schaeffer<\/a>, Avishay Tal<\/a>. \u00a0Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. \u00a0arXiv<\/a> 1906:08890<\/a>, June 2019.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"

    Omar Fawzi, ENS Lyon. One of the goals of quantum information science in the next few years is to use the available quantum technologies to demonstrate a speedup over classical computers for some computational task. In this talk, I will start by describing the model of quantum computing, the corresponding complexity classes as well as […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-152","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/152","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=152"}],"version-history":[{"count":5,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/152\/revisions"}],"predecessor-version":[{"id":167,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/152\/revisions\/167"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=152"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}