{"id":902,"date":"2012-02-03T03:31:34","date_gmt":"2012-02-03T08:31:34","guid":{"rendered":"https:\/\/scottaaronson.blog\/?p=902"},"modified":"2016-12-10T04:55:35","modified_gmt":"2016-12-10T09:55:35","slug":"whether-or-not-god-plays-dice-i-do","status":"publish","type":"post","link":"https:\/\/scottaaronson.blog\/?p=902","title":{"rendered":"Whether or not God plays dice, I do"},"content":{"rendered":"<p><span style=\"color: #ff0000;\"><strong>Another Update (Feb. 7):<\/strong><\/span> I have a <a href=\"http:\/\/spectrum.ieee.org\/tech-talk\/computing\/hardware\/why-im-wagering-100000-on-quantum-computing\">new piece up at <em>IEEE Spectrum<\/em><\/a>, explaining why I made this bet.\u00a0 Thanks to Rachel Courtland for soliciting the piece and for her suggestions improving it.<\/p>\n<p><span style=\"color: #ff0000;\"><strong>Update:<\/strong><\/span> My $100,000 offer for disproving scalable quantum computing has been <a href=\"http:\/\/news.slashdot.org\/story\/12\/02\/04\/140207\/100000-prize-prove-quantum-computers-impossible\">Slashdotted<\/a>.\u00a0 Reading through the comments was amusing as always.\u00a0 The top comment suggested that winning my prize was trivial: &#8220;Just point a gun at his head and ask him &#8216;Convinced?'&#8221;\u00a0 (For the record: no, I wouldn&#8217;t be, even as I handed over my money.\u00a0 And if you want to be a street thug, why limit yourself to victims who happen to have made public bets about quantum computing?)\u00a0 Many people assumed I was a QC skeptic, and was offering the prize because I hoped to <em>spur research aimed at disproving QC<\/em>.\u00a0 (Which is actually an interesting misreading: I wonder how much &#8220;pro-paranormal&#8221; research has been spurred by James Randi&#8217;s million-dollar prize?)\u00a0 Other people said the bet was irrelevant since D-Wave has already built scalable QCs.\u00a0 (Oh, how I wish I could put the D-Wave boosters and the QC deniers in the same room, and let them duke it out with each other while leaving me alone for a while!)\u00a0 One person argued that it would be easy to prove the impossibility of scalable QCs, just like it would&#8217;ve been easy to prove the impossibility of scalable <em>classical<\/em> computers in 1946: the only problem is that both proofs would then be invalidated by advances in technology.\u00a0 (I think he understands the word &#8220;proof&#8221; differently than I do.)\u00a0 Then, buried deep in the comments, with a score of 2 out of 5, was <a href=\"http:\/\/news.slashdot.org\/comments.pl?sid=2654443&amp;cid=38928845\"><em>one person<\/em><\/a> who understood precisely:<\/p>\n<p style=\"padding-left: 30px;\">I think he&#8217;s saying that while a general quantum computer might be a very long way off, the underlying theory that allows such a thing to exist is on very solid ground (which is why he&#8217;s putting up the money). Of course this prize might still cost him since if the news of the prize goes viral he&#8217;s going to spend the next decade getting spammed by kooks.<\/p>\n<p>OK, <a href=\"http:\/\/news.slashdot.org\/comments.pl?sid=2654443&amp;cid=38929023\">two people<\/a>:<\/p>\n<ul>There&#8217;s some needed context.\u00a0 Aaronson himself works on quantum complexity theory.\u00a0 Much of his work deals with quantum computers (at a conceptual level&#8211;what is and isn&#8217;t possible).\u00a0 Yet there are some people who reject the idea the quantum computers can scale to &#8220;useful&#8221; sizes&#8211;including some very smart people like Leonid Levin (of Cook-Levin Theorem fame)&#8211;and some of them send him email, questions, comments on his blog, etc. saying so.\u00a0 These people are essentially asserting that Aaronson&#8217;s career is rooted in things that can&#8217;t exist.\u00a0 Thus, Aaronson essentially said &#8220;prove it.&#8221;\u00a0 It&#8217;s true that proving such a statement would be very difficult &#8230; But the context is that Aaronson gets mail and questions all the time from people who simply assert that scalable QC is impossible, and he&#8217;s challenging them to be more formal about it.\u00a0 He also mentions, in fairness, that if he does have to pay out, he&#8217;d consider it an honor, because it would be a great scientific advance.<\/ul>\n<hr \/>\n<p>For better or worse, I&#8217;m now offering <span style=\"color: #ff0000;\"><em><strong>a US$100,000 award for<\/strong><\/em> <strong><em>a demonstration, convincing to me, that scalable quantum computing is impossible in the physical world<\/em>.<\/strong><\/span>\u00a0 This award has no time limit other than my death, and is entirely at my discretion (though if you want to convince me, a good approach would be to convince most of the physics community first).\u00a0 I might, also at my discretion, decide to split the award among several people or groups, or give a smaller award for a discovery that dramatically weakens the possibility of scalable QC while still leaving it open.\u00a0 I don&#8217;t promise to read every claimed refutation of QC that&#8217;s emailed to me.\u00a0 Indeed, you needn&#8217;t even bother to send me your refutation directly: just convince most of the physics community, and believe me, I&#8217;ll hear about it!\u00a0 The prize amount will not be adjusted for inflation.<\/p>\n<p>The impetus for this prize was a <a href=\"http:\/\/rjlipton.wordpress.com\/2012\/01\/30\/perpetual-motion-of-the-21st-century\/\">post on Dick Lipton&#8217;s blog<\/a>, entitled &#8220;Perpetual Motion of the 21st Century?&#8221;\u00a0 (See also <a href=\"http:\/\/rjlipton.wordpress.com\/2012\/02\/02\/quantum-groundhog-day\/\">this followup post<\/a>.)\u00a0 The post consists of a debate between well-known quantum-computing skeptic Gil Kalai and well-known quantum-computing researcher Aram Harrow (<em>Shtetl-Optimized<\/em> commenters both), about the assumptions behind the Quantum Fault-Tolerance Theorem.\u00a0 So far, the debate covers well-trodden ground, but I understand that it will continue for a while longer.\u00a0 Anyway, in the comments section of the post, I pointed out that a refutation of scalable QC would require, not merely poking this or that hole in the Fault-Tolerance Theorem, but the construction of a dramatically-new, classically-efficiently-simulable picture of physical reality: something I don&#8217;t expect but would welcome as the scientific thrill of my life.\u00a0 Gil more-or-less <a href=\"http:\/\/rjlipton.wordpress.com\/2012\/01\/30\/perpetual-motion-of-the-21st-century\/#comment-17907\">dared me<\/a> to put a large cash prize behind my words&#8212;as I&#8217;m now, apparently, known for doing!&#8212;and I accepted his dare.<\/p>\n<p>To clarify: no, I don&#8217;t expect ever to have to pay the prize, but that&#8217;s not, by itself, a sufficient reason for offering it.\u00a0 After all, I <em>also<\/em> don&#8217;t expect Newt to win the Republican primary, but I&#8217;m not ready to put $100,000 on the line for that belief.\u00a0 The <em>real<\/em> reason to offer this prize is that, if I <em>did<\/em> have to pay, at least doing so would be an honor: for I&#8217;d then (presumably) simply be adding a little to the well-deserved Nobel Prize coffers of one of the greatest revolutionaries in the history of physics.<\/p>\n<p>Over on Lipton&#8217;s blog, my offer was <a href=\"http:\/\/rjlipton.wordpress.com\/2012\/01\/30\/perpetual-motion-of-the-21st-century\/#comment-17915\">criticized<\/a> for being &#8220;like offering $100,000 to anyone who can prove that Bigfoot doesn\u2019t exist.&#8221;\u00a0 To me, though, that completely misses the point.\u00a0 As I wrote there, whether Bigfoot exists is a question about the contingent history of evolution on Earth.\u00a0 By contrast, whether scalable quantum computing is possible is a question about the laws of physics.\u00a0 It\u2019s perfectly conceivable that future developments in physics would conflict with scalable quantum computing, in the same way that relativity conflicts with faster-than-light communication, and the Second Law of Thermodynamics conflicts with perpetuum mobiles.\u00a0 It\u2019s for such a development in physics that I\u2019m offering this prize.<\/p>\n<p><span style=\"color: #ff0000;\"><strong>Update:<\/strong><\/span> If anyone wants to offer a counterpart prize for a demonstration that scalable quantum computing <em>is<\/em> possible, I&#8217;ll be happy for that&#8212;as I&#8217;m sure, will many experimental QC groups around the world.\u00a0 <em>I&#8217;m<\/em> certainly not offering such a prize.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Another Update (Feb. 7): I have a new piece up at IEEE Spectrum, explaining why I made this bet.\u00a0 Thanks to Rachel Courtland for soliciting the piece and for her suggestions improving it. Update: My $100,000 offer for disproving scalable quantum computing has been Slashdotted.\u00a0 Reading through the comments was amusing as always.\u00a0 The top [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_seo_schema_type":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"{title}\n\n{excerpt}\n\n{url}","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},"_wpas_customize_per_network":false,"jetpack_post_was_ever_published":false},"categories":[31,5,11,4],"tags":[],"class_list":["post-902","post","type-post","status-publish","format-standard","hentry","category-announcements","category-complexity","category-nerd-interest","category-quantum"],"jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/902","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=902"}],"version-history":[{"count":9,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/902\/revisions"}],"predecessor-version":[{"id":3033,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/902\/revisions\/3033"}],"wp:attachment":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=902"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=902"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=902"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}