I have gained some interest in quantum computing ever since I have been reading Scott Aaronson's blog. The fact that using this computational model, you would be able to factor integers in polynomial time just amazes me.
The only real knowledge I have about the model is stuff I picked up from the blog and from recent youtube video's where Aaronson discusses the subject. I have also recently read that the first quantum computer was sold.
Now I am wondering, and I hope this is not a stupid question, is quantum computing a turing complete computational model?
Also, how come there is an efficient factoring algorithm and not, say, an efficient algorithm for the graph isomorphism problem? What are the boundaries?
I hope answers will give me a more clear image of quantum computing.