For those local to Seattle: Next week, on Tuesday, I’m giving a talk here at UW:<\/p>\n
\nTowards Robust and Powerful Quantum Computers
\nColloquium
\nTuesday, April 18, 2006
\n3:30 pm, EE-105
\nAbstract
\nToday, a massive effort, spanning many hundreds of research groups coming from multiple disparate disciplines, is underway to build a robust large scale quantum computer. These groups are undertaking this task because the payoffs for building a quantum computer are large and because of a remarkable set of theoretical insights, collectively known as the theory of fault-tolerant quantum computation, which assures them that building a robust quantum computer is possible. In this talk I will discuss my research into the theory of fault-tolerant quantum computation as well as into the study of the algorithmic power of quantum computers. On this first topic, I will highlight methods for achieving fault-tolerant quantum computation which are remarkably similar to how fault-tolerance is achieved in classical computers. Such “self-correcting” quantum systems are best thought of as being the equivalent of the classical transistor which jump started the classical computer revolution. On the second topic of quantum algorithms, I will highlight the similarities and differences between quantum and classical computers and describe how these differences have lead to new quantum algorithms for classically hard problems.\n<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"
For those local to Seattle: Next week, on Tuesday, I’m giving a talk here at UW: Towards Robust and Powerful Quantum Computers Colloquium Tuesday, April 18, 2006 3:30 pm, EE-105 Abstract Today, a massive effort, spanning many hundreds of research groups coming from multiple disparate disciplines, is underway to build a robust large scale quantum … <\/p>\n
Continue reading “Blabbering Bacon”<\/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,76],"tags":[],"class_list":["post-1225","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-quantum","category-self-meet-center-center-meet-self"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1225","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=1225"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1225\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1225"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1225"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}