{"id":358,"date":"2023-02-04T11:14:43","date_gmt":"2023-02-04T10:14:43","guid":{"rendered":"https:\/\/quantum.lis-lab.fr\/?p=358"},"modified":"2023-02-04T11:16:03","modified_gmt":"2023-02-04T10:16:03","slug":"jiaqi-leng-quics-university-of-maryland-quantum-simulation-of-real-space-dynamics","status":"publish","type":"post","link":"https:\/\/quantum.lis-lab.fr\/?p=358","title":{"rendered":"Jiaqi Leng (QuICS &#8211; University of Maryland): Quantum Simulation of Real-Space Dynamics"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\"><strong>Abstract :<\/strong> We develop quantum algorithms for simulating the dynamics of interacting quantum particles in $d$ dimensions. Compared to the best previous results, our algorithm is exponentially better in terms of the discretization error \\epsilon\u00a0and polynomially better in terms of the simulation time $T$ and the dimension $d$. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>When :<\/strong> Mardi 17 janvier \u00e0 14h00<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Where : <\/strong> <strong>(Only online) \u00a0<\/strong>Zoom \u00a0<a href=\"https:\/\/univ-amu-fr.zoom.us\/j\/83102045836?pwd=VERoYm45eWdveTZiRnA2TVpYUlk5QT09\">https:\/\/univ-amu-fr.zoom.us\/j\/83102045836?pwd=VERoYm45eWdveTZiRnA2TVpYUlk5QT09<\/a>ID : 831 0204 5836Passcode: 822671<\/p>\n\n\n\n<iframe loading=\"lazy\" src=\"https:\/\/amupod.univ-amu.fr\/video\/25265-jiaqi_leng___university_of_maryland_\/d79f594d4b89d92dd13369c59946063719b3a192a631248662cb98baa02c81be\/?is_iframe=true\" width=\"640\" height=\"360\" style=\"padding: 0; margin: 0; border:0\" allowfullscreen ><\/iframe>\n","protected":false},"excerpt":{"rendered":"<p>Abstract : We develop quantum algorithms for simulating the dynamics of interacting quantum particles in $d$ dimensions. Compared to the best previous results, our algorithm is exponentially better in terms of the discretization error \\epsilon\u00a0and polynomially [&#8230;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_crdt_document":"","footnotes":""},"categories":[18,17],"tags":[],"class_list":["post-358","post","type-post","status-publish","format-standard","hentry","category-complexity-theory","category-quantum-simulation"],"_links":{"self":[{"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/358","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=358"}],"version-history":[{"count":2,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/358\/revisions"}],"predecessor-version":[{"id":360,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/358\/revisions\/360"}],"wp:attachment":[{"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=358"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=358"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/quantum.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}