I've been looking into quantum algorithms, Deutsch–Jozsa, Grover, Shor.

To me all they share is that they do something in parallel and then cleverly extra some specific information for that. Which to me means QC can provide efficient parallel programming if the goal itself isnt the direct result. By this I mean if the goal was actually knowing the result of each calculation.

Is there a property that all problems that QC will excel at share?

  • $\begingroup$ @MarkS Yes, sorry $\endgroup$ – QurakNerd Jul 2 at 20:42

Browse other questions tagged or ask your own question.