{"id":1570,"date":"2007-07-09T12:04:52","date_gmt":"2007-07-09T19:04:52","guid":{"rendered":"http:\/\/dabacon.org\/pontiff\/?p=1570"},"modified":"2007-07-09T12:04:52","modified_gmt":"2007-07-09T19:04:52","slug":"focs-2007-4-quantum","status":"publish","type":"post","link":"https:\/\/dabacon.org\/pontiff\/2007\/07\/09\/focs-2007-4-quantum\/","title":{"rendered":"FOCS 2007, 4 Quantum"},"content":{"rendered":"<p>The list of <a href=\"http:\/\/focs2007.org\/\">FOCS 2007<\/a> papers has been <a href=\"http:\/\/focs2007.org\/accepted.html\">posted<\/a> (via <a href=\"http:\/\/blog.geomblog.org\/2007\/07\/focs-07-list-out.html\">Geomblog<\/a>).  Quantum papers:<\/p>\n<blockquote><p>\n<tt>Andrew M. Childs, Leonard J. Schulman and Umesh V. Vazirani.<br \/>\nQuantum algorithms for hidden nonlinear structures<\/tt> [arXiv:0705.2784]<br \/>\n<tt>Oded Regev and Ben Toner.<br \/>\nSimulating Quantum Correlations with Finite Communication<\/tt> [not available online yet \ud83d\ude41 ]<br \/>\n<tt>Dorit Aharonov, Daniel Gottesman, Sandy Irani and Julia Kempe.<br \/>\nThe power of quantum systems on a line<\/tt> [arXiv:0705.4077]<br \/>\n<tt>Andris Ambainis, Andrew Childs, Ben Reichardt, Robert Spalek and Shengyu<br \/>\nZhang.<br \/>\nAny AND-OR formula of size N can be evaluated in time N^{1\/2+o(1)} on a quantum computer<\/tt> [arXiv:0704.3628 and arXiv:quant-ph\/0703015]\n<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"<p>The list of FOCS 2007 papers has been posted (via Geomblog). Quantum papers: Andrew M. Childs, Leonard J. Schulman and Umesh V. Vazirani. Quantum algorithms for hidden nonlinear structures [arXiv:0705.2784] Oded Regev and Ben Toner. Simulating Quantum Correlations with Finite Communication [not available online yet \ud83d\ude41 ] Dorit Aharonov, Daniel Gottesman, Sandy Irani and Julia &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/dabacon.org\/pontiff\/2007\/07\/09\/focs-2007-4-quantum\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;FOCS 2007, 4 Quantum&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[20,22,63],"tags":[],"class_list":["post-1570","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-conferences","category-quantum"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1570","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/comments?post=1570"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1570\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1570"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1570"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1570"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}