Welcome to DU! The truly grassroots left-of-center political community where regular people, not algorithms, drive the discussions and set the standards. Join the community: Create a free account Support DU (and get rid of ads!): Become a Star Member Latest Breaking News Editorials & Other Articles General Discussion The DU Lounge All Forums Issue Forums Culture Forums Alliance Forums Region Forums Support Forums Help & Search

Science

In reply to the discussion: Nasa buys into 'quantum' computer [View all]

napoleon_in_rags

(3,992 posts)
1. Wow! Really?
Thu May 16, 2013, 11:33 AM
May 2013
In one case it took less than half a second to do something that took conventional software 30 minutes.

A classic example of one of these "combinatorial optimisation" problems is that of the travelling sales rep, who needs to visit several cities in one day, and wants to know the shortest path that connects them all together in order to minimise their mileage.


Aren't all those NP hard problems mappable to each other? I mean I thought if you could do one, you could pretty much do them all.

If so, wow! They really got it going on. The code breaking implications are profound also.

Recommendations

0 members have recommended this reply (displayed in chronological order):

Wow! Really? napoleon_in_rags May 2013 #1
NP-hard > NP-complete gurthang May 2013 #2
Holy Guacamole. napoleon_in_rags May 2013 #3
Wolfram's definition is correct, gurthang May 2013 #4
Complexity classes are surprising complex! napoleon_in_rags May 2013 #5
Latest Discussions»Culture Forums»Science»Nasa buys into 'quantum' ...»Reply #1