{"id":125,"date":"2004-08-20T17:36:46","date_gmt":"2004-08-20T07:36:46","guid":{"rendered":"http:\/\/michaelnielsen.org\/?p=125"},"modified":"2004-08-20T17:36:46","modified_gmt":"2004-08-20T07:36:46","slug":"doubling-up","status":"publish","type":"post","link":"https:\/\/michaelnielsen.org\/blog\/doubling-up\/","title":{"rendered":"Doubling up"},"content":{"rendered":"<p>As luck would have it, I submitted two papers to the quant-ph preprint archive today.  They should both show up in a day or two.  Both contain what I unabashedly think is some pretty neat stuff, so I&#8217;ll describe them here.<\/p>\n<p>The first (joint work with Chris Dawson, Henry Haselgrove, Andrew Hines, Duncan Mortimer, and Tobias Osborne) paper relates quantum computing to something that, on the surface, you&#8217;d think had absolutely nothing to do with quantum computing: counting solutions to sets of polynomial equations.<\/p>\n<p>In particular, we show that the problem of determining the output of a quantum computation is actually <em>equivalent<\/em> to the problem of being able to estimate the number of solutions to certain sets of polynomial equations, which we explicitly construct.<\/p>\n<p>This is really quite odd.  After all, it is believed pretty likely that quantum computers can be used to simulate <em>any<\/em> physical system.  If you believe this, then what this result tells you is that simulating nature can be boiled down to counting solutions to polynomial equations.<\/p>\n<p>What the heck does the simulation of physical systems have to do with counting solutions to polynomial equations?  A priori, you wouldn&#8217;t think they&#8217;d be all that related.  Yet the two problems turn out to be the same, in some sense.  I find this really quite remarkable.<\/p>\n<p>I should say, by the way, that other people have shown some related results in the past.  I won&#8217;t give an account of that history here, though, as we have a detailed discussion in the paper, and I won&#8217;t do it justice in this small space.<\/p>\n<p>The second paper (joint with Denes Petz, who has been visiting us at UQ), is a  short expository note.  It&#8217;s a simple elementary account of what may be just about the most important result in quantum information theory &#8211; the strong subadditivity inequality for entropy, first proved by Lieb and Ruskai in 1973.  Almost everything we know about entropy comes from this inequality.<\/p>\n<p>In the 1980s Denes found a simple (and, I think, extremely beautiful) proof of this result.  Our note gives an account of this proof that is (a) short; (b) easy-to-understand (we assume only basic linear algebra and quantum mechanics); and (c) where you can learn something interesting at pretty much every step, if you pay attention.   That&#8217;s the kind of proof I love to read, myself, which is why I&#8217;m so excited about this note!<\/p>\n","protected":false},"excerpt":{"rendered":"<p>As luck would have it, I submitted two papers to the quant-ph preprint archive today. They should both show up in a day or two. Both contain what I unabashedly think is some pretty neat stuff, so I&#8217;ll describe them here. The first (joint work with Chris Dawson, Henry Haselgrove, Andrew Hines, Duncan Mortimer, and&hellip; <a class=\"more-link\" href=\"https:\/\/michaelnielsen.org\/blog\/doubling-up\/\">Continue reading <span class=\"screen-reader-text\">Doubling up<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-125","post","type-post","status-publish","format-standard","hentry","category-3","entry"],"_links":{"self":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/125","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/comments?post=125"}],"version-history":[{"count":0,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/125\/revisions"}],"wp:attachment":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/media?parent=125"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/categories?post=125"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/tags?post=125"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}