Put simply, the state of 1 process is dependent on the state of the opposite program, regardless of the length involving them. For instance, integer factorization as well as the discrete logarithm difficulty are acknowledged being in BQP and they are suspected to generally be beyond P. On the con