One thing I would like to see addressed is the misconception that QC can help turn NP problems into P. I see this floating from time to time.
One thing I would like to see addressed is the misconception that QC can help turn NP problems into P. I see this floating from time to time.
Yes, totally. I feel like the computational complexity part of quantum computing is actually pretty well explained to the 'layman' by some of Scott Aaronson's work, but unfortunately it's not well placed in context (i.e. it very much focuses on the theoretical CS, and not the whole QC picture). You have to sort of start digging for material about computational complexity theory/quantum and stumble into his output.