tag:blogger.com,1999:blog-6555947.post109158144839506846..comments2024-04-08T04:56:51.603-06:00Comments on The Geomblog: Scott Aaronson is a very patient man...Suresh Venkatasubramanianhttp://www.blogger.com/profile/15898357513326041822noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-6555947.post-1163714008772056022006-11-16T14:53:00.000-07:002006-11-16T14:53:00.000-07:00For each finite size Hard NP problem there is a fi...For each finite size Hard NP problem there is a finite network of entangled Bose-Einstein condensates that can cycle through all the permutations in absolutely no time.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1091653146037858262004-08-04T14:59:00.000-06:002004-08-04T14:59:00.000-06:00Since planar steiner tree is probably easy in prac...Since planar steiner tree is probably easy in practice (like planar TSP which in practice can be solved for thousands of points), it might be safe to assume this is not relelvant. Indeed, to beat existing computer programs you need to run instances with hundreds of thousands of points in the plane. At this point the physical noise is going to be so dominant, that whatever you are going to get from it is going to be noise.<br /><br />Not to mention that the physical solution is only approximate and converges to a local minimum, not a golbal one. In short, dont throw away your new super computer, it might still be useful for something.Anonymousnoreply@blogger.com