—I know that interrupting is not the right thing to do in your committee, but I feel I need to say something, which is that there's this myth that quantum computers are so vastly more powerful than classical computers that they can solve everything, exponentially faster. That is not true. Quantum computers will solve some problems exponentially faster than classical computers—for instance, if you want to factor numbers and break cryptography, but for other problems, in particular NP-hard problems, there is strong evidence that quantum computers cannot offer a significant advantage in solving NP-complete or NP-hard problems, no more than quadratic improvement, which is not to be sneezed at, but is very, very far from being exponential.
So, yes, some NP-hard problems could be solved faster with quantum computers, but not as spectacularly as other problems like those that allow us to break cryptography. It's not a uniform speed up for all problems when you have a quantum computer. For some problems, yes; for some others, no.