Equal Time

Jun 07, 2010 16:22

About the article I linked to a couple of days ago, claiming that quantum computers do not help with NP-complete problems: someone who seems to know more than the Ars Technica reporter has pointed out some problems with the paper. Plausible, anyway.

cs, geekery

Leave a comment

Comments 1

be_well_lowell June 8 2010, 14:51:26 UTC
Thanks for the link; I was wondering about something along those lines. Specifically, when I worked on massively parallel adiabatic problems in grad school, resolution limitations caused us to catch local minima that theory said we should be able to avoid. Given the meaning of the word "quantum," I suspected that would apply to these quantum applications also. [It looks like I was wrong, and all of the issues are along entirely other avenues, but I'm not quite sure from the more knowledgeable comments I've seen.]

Reply


Leave a comment

Up