A common misconception is that QC are "faster" in the sense that a single operation is completed faster which is incorrect. In actuality they are much slower, many many magnitudes slower due to need for retesting to compensate for noise. They are "faster" because they need to search less. An analogy might help. Imagine you have a task which requires 1 second per attempt and requires on average 3,600 attempts to complete successfully. It would take you on average 1 hour to complete. On the other hand if you could complete the task in such a way that it took 10 seconds to complete but on average only took four attempts although each attempt is slower the average time toa solution is now only 1 minute. This is how quantum computer works. They are "fast" because they exploit quantum properties to reduce the number of attempts.
Thank you for the insightful comment. The analogy helps a lot.
