{"id":1062,"date":"2005-09-14T04:05:08","date_gmt":"2005-09-14T11:05:08","guid":{"rendered":"http:\/\/dabacon.org\/pontiff\/?p=1062"},"modified":"2005-09-14T04:05:08","modified_gmt":"2005-09-14T11:05:08","slug":"prehistoric-quantum-algorithms","status":"publish","type":"post","link":"https:\/\/dabacon.org\/pontiff\/2005\/09\/14\/prehistoric-quantum-algorithms\/","title":{"rendered":"Prehistoric Quantum Algorithms"},"content":{"rendered":"

In 1993, Bernstein and Vazirani had demonstrated a superpolynomial query complexity speedup for quantum computers over classical computers. Charlie Bennett wrote a article<\/a> in Nature in April 1993 about these new recent developements in quantum computing. In this article, Charlie wrote:<\/p>\n

\nAn early but probably vain hope was that quantum parallelism might provide a fast way of solving problems such as factoring or the travelling-salesman problem, which appear to be hard in the same way as finding a needle in a haystack is hard, that is because they involve a search for a successful solution among exponentially many candidates. A computer able to test all the candidates in parallel, and signal unambiguously if it found one that worked, would solve these problems exponentially faster than known methods.
\nIt is easy to program a quantum computer to branch out into exponentially many computational paths; the difficult part is getting the paths to intefere in a useful way at the end, so that the answer comes out with a non-negligible probability. This difficulty is illustrated by the factoring problem above. Suppose the quantum computer is programmed to factor a 100-digit number by trying in parallel to divite it by all numbers of fifty digits or fewer. If any of the approximately 10^50 computation yeilds a zero remainder, it will in a sense have solved the problem. But if there is only one successful path, the interference pattern among all the paths, which determines the behaviour of the computer as a whole, will scarecely be affected. Quantum computers cannot amplify an answer found on a single computation to a detectable level because interference is an additive process, to which each path contributes only as much weight as it started out with.\n<\/p><\/blockquote>\n

How strange: to use brute force factoring as the example of a hard problem for quantum computing! Amazingly, Charlie wasn’t even the first to perform this strange analogy. Here is Greg Egan in the book Quarantine in 1992:<\/p>\n

\nLet a computer smear-with the right kind of quantum randomness-and you create, in effect, a ‘parallel’ machine with an astronomical number of processors…All you have to do is to be sure that when you collapse the system, you choose the version that happened to find a needle in the mathematical haystack.\n<\/p><\/blockquote>\n

Which makes one wonder, why the heck were all these people thinking about factoring and quantum computers right before Shor’s discovery? Strange, no?<\/p>\n","protected":false},"excerpt":{"rendered":"

In 1993, Bernstein and Vazirani had demonstrated a superpolynomial query complexity speedup for quantum computers over classical computers. Charlie Bennett wrote a article in Nature in April 1993 about these new recent developements in quantum computing. In this article, Charlie wrote: An early but probably vain hope was that quantum parallelism might provide a fast … <\/p>\n

Continue reading “Prehistoric Quantum Algorithms”<\/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,63],"tags":[],"class_list":["post-1062","post","type-post","status-publish","format-standard","hentry","category-computer-science","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\/1062","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=1062"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1062\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1062"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1062"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1062"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}