How so?
1) One time pads are provably secure albeit impractical
2) Integer factorization is BQP, but not necessarily NP-complete.
1) One time pads are provably secure albeit impractical
2) Integer factorization is BQP, but not necessarily NP-complete.
2) Integer factorization is trivially in NP (the decision problem "n has a factor < x" has a certificate: the factor)