Good ideas and conversation. No ads, no tracking. Login or Take a Tour!
user-inactivated · 4000 days ago · link · · parent · post: Government Lab Reveals It Has Operated Quantum Internet For Over Two Years
There's an interesting class of problems, BQP/BPP, that a quantum computer can solve in polynomial time. Whether it's a superset of P, the class of problems an ordinary computer can solve in polynomial time is still an open question, but there are problems (interger factorization, for example) that are known to be in BQP but not known to be in P. So they might be able to efficiently solve problems that can't be efficiently solved on an ordinary computer, or it might be that they can be solved efficiently on an ordinary computer but we haven't been clever enough to figure out how yet. edit: As ike says, this is an answer to the question you asked, but not really related to the technology this article is about.