Quantum computers have the potential to solve certain types of problems much faster than classical computers. This is due to their ability to leverage quantum phenomena such as superposition and entanglement to perform computations. In some cases, a quantum computer can solve a problem exponentially faster than a classical computer.
However, it's important to note that not all calculations can be accelerated by quantum computers. Quantum computers excel at solving specific types of problems, such as factoring large numbers, simulating quantum systems, or solving certain optimization problems. For other types of problems, classical computers are still more efficient.
When it comes to comparing the speed of quantum and classical computers, it's crucial to consider the specific problem being solved. It's not accurate to say that a quantum computer is always faster than a classical computer. In fact, quantum computers are still in the early stages of development, and large-scale, error-corrected quantum computers that can outperform classical computers for a wide range of problems have not yet been realized.
So, the statement that a normal computer would take 9,000 years to perform a calculation that a quantum computer can do is highly dependent on the specific calculation and the capabilities of the quantum computer being used. It's challenging to make broad generalizations about the speed comparison between classical and quantum computers without considering the specific context.