It is not the case that Quantum computers solve certain problems (factoring, discrete log) in polynomial time where classical Turing machines require exponential time.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.