It is not the case that A formal proof that P ⊊ BQP would establish that quantum computation transcends classical polynomial-time bounds as a matter of mathematical necessity.
?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.