{"id":190627,"date":"2005-08-30T00:00:54","date_gmt":"2005-08-30T07:00:54","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/is-there-an-interestingrealisticuniversal-model-for-noise-which-reduces-quantum-computation-to-classical-computation\/"},"modified":"2016-09-09T15:30:23","modified_gmt":"2016-09-09T22:30:23","slug":"is-there-an-interestingrealisticuniversal-model-for-noise-which-reduces-quantum-computation-to-classical-computation","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/is-there-an-interestingrealisticuniversal-model-for-noise-which-reduces-quantum-computation-to-classical-computation\/","title":{"rendered":"Is there an (interesting?\/realistic?\/universal?) model for noise which reduces quantum computation to classical computation?"},"content":{"rendered":"<div class=\"asset-content\">\n<p>Quantum computation is a remarkable model of computation initiated by Deutsch and others in the mid 1980s. Shor&#8217;s famous result (in 1994) gave a polynomial quantum algorithm for factoring, and along with results by Simon, Grover and others indicates that quantum computers may well be much more powerful than ordinary computers. Quantum error-correction and the remarkable &#8220;threshold theorem&#8221; (achieved by several groups of researchers in the mid 1990&#8217;s) show that the full power of quantum computation is preserved for noisy quantum computers when the noise rate is small and the noise satisfies certain natural &#8220;locality&#8221; conditions.<\/p>\n<p>Studying models of noise under which the power of quantum computers reduces to the power of classical computers is an interesting complexity-theoretic\/mathematical problem. We will (informally) discuss potential examples for such models where the noise rate is still small and the &#8220;locality&#8221; condition is (in some sense) approximately satisfied.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Quantum computation is a remarkable model of computation initiated by Deutsch and others in the mid 1980s. Shor&#8217;s famous result (in 1994) gave a polynomial quantum algorithm for factoring, and along with results by Simon, Grover and others indicates that quantum computers may well be much more powerful than ordinary computers. Quantum error-correction and the [&hellip;]<\/p>\n","protected":false},"featured_media":198230,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_hide_image_in_river":0,"footnotes":""},"research-area":[],"msr-video-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-session-type":[],"msr-impact-theme":[],"msr-pillar":[],"msr-episode":[],"msr-research-theme":[],"class_list":["post-190627","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/NIgeaBDNBeg","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/190627","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/190627\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/198230"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=190627"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=190627"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=190627"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=190627"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=190627"},{"taxonomy":"msr-session-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-session-type?post=190627"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=190627"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=190627"},{"taxonomy":"msr-episode","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-episode?post=190627"},{"taxonomy":"msr-research-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-theme?post=190627"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}