{"id":107042,"date":"2020-05-13T19:09:55","date_gmt":"2020-05-14T02:09:55","guid":{"rendered":"https:\/\/lifeboat.com\/blog\/2020\/05\/experimental-realization-of-shors-quantum-factoring-algorithm-using-qubit-recycling"},"modified":"2020-05-13T19:09:55","modified_gmt":"2020-05-14T02:09:55","slug":"experimental-realization-of-shors-quantum-factoring-algorithm-using-qubit-recycling","status":"publish","type":"post","link":"https:\/\/lifeboat.com\/blog\/2020\/05\/experimental-realization-of-shors-quantum-factoring-algorithm-using-qubit-recycling","title":{"rendered":"Experimental realization of Shor\u2019s quantum factoring algorithm using qubit recycling"},"content":{"rendered":"

<\/a><\/p>\n

Circa 2012<\/p>\n

\n

Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms1<\/a>,2<\/a>,3<\/a><\/sup>. Shor\u2019s quantum algorithm4<\/a><\/sup> for fast number factoring is a key example and the prime motivator in the international effort to realize a quantum computer5<\/a><\/sup>. However, due to the substantial resource requirement, to date there have been only four small-scale demonstrations6<\/a>,7<\/a>,8<\/a>,9<\/a><\/sup>. Here, we address this resource demand and demonstrate a scalable version of Shor\u2019s algorithm in which the n<\/i>-qubit control register is replaced by a single qubit that is recycled n<\/i> times: the total number of qubits is one-third of that required in the standard protocol10<\/a>,11<\/a><\/sup>. Encoding the work register in higher-dimensional states, we implement a two-photon compiled algorithm to factor N<\/i> = 21. The algorithmic output is distinguishable from noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor\u2019s algorithm by harnessing scalable resource reductions applicable to all physical architectures.<\/p>\n","protected":false},"excerpt":{"rendered":"

Circa 2012 Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms1,2,3. Shor\u2019s quantum algorithm4 for fast number factoring is a key example and the prime motivator in the international effort to realize a quantum computer5. However, due to the substantial resource requirement, to date there have been only [\u2026]<\/p>\n","protected":false},"author":513,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[41,1617,17],"tags":[],"class_list":["post-107042","post","type-post","status-publish","format-standard","hentry","category-information-science","category-quantum-physics","category-sustainability"],"_links":{"self":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/107042","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/users\/513"}],"replies":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/comments?post=107042"}],"version-history":[{"count":0,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/107042\/revisions"}],"wp:attachment":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/media?parent=107042"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/categories?post=107042"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/tags?post=107042"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}