My understanding is that QC is in some ways, theoretically, able to efficiently compute exponential problems. Such as integer factorization.
I’m inspired by Scott Aaronson saying about the invisible electric fence for P!=NP. In all sorts of different ways, something stops hard problems from having efficient solutions.
https://scottaaronson.blog/?p=1720
I know someone who used to work on QC and they said offhand “Maybe building a large quantum computer will be just as hard as solving hard computational problems.” Aka, maybe the invisible fence is there for QC too.
I also know that due to the way QC affects cryptography, it gets a lot of funding from governments. It’s an arms race. This could produce a lot of business, without actual results.
So I want to hear from a quantum computing researcher. Do any of you seriously believe in quantum supremacy?