"We show that Shor's algorithm, the most complex quantum algorithm known to date, is realizable in a way where, yes, all you have to do is go in the lab, apply more technology, and you should be able to make a bigger quantum computer … It might still cost an enormous amount of money to build — you won’t be building a quantum computer and putting it on your desktop anytime soon — but now it’s much more an engineering effort, and not a basic physics question."
"Turning to quantum mechanics, we know immediately that here we get only the ability, apparently, to predict probabilities. Might I say immediately, so that you know where I really intend to go, that we always have had (secret, secret, close the doors!) we always have had a great deal of difficulty in understanding the world view that quantum mechanics represents. At least I do, because I'm an old enough man that I haven't got to the point that this stuff is obvious to me. Okay, I still get nervous with it. And therefore, some of the younger students ... you know how it always is, every new idea, it takes a generation or two until it becomes obvious that there's no real problem. It has not yet become obvious to me that there's no real problem. I cannot define the real problem, therefore I suspect there's no real problem, but I'm not sure there's no real problem. So that's why I like to investigate things. Can I learn anything from asking this question about computers—about this may or may not be mystery as to what the world view of quantum mechanics is? So I know that quantum mechanics seem to involve probability—and I therefore want to talk about simulating probability."
"Back in the 1940s, researchers were just discovering how to use vacuum tubes as simple switches. … These switches could then form logic gates, which could be linked together to form the first logic circuits. That’s where we’re at now with quantum processors. We have verified that all the components work. The next step is to engineer the smallest, yet most interesting circuit possible."