An aspect of quantum computing I heard of and find particularly interesting, is the ability to get an optimal solution to an NP-Complete problem in a quasi-linear time. The trick being that you only have a significant probability of getting the solution you want, but demonstrating that it’s optimal only takes linear computing time.
1 Like
