BQP ⊆ DLOG

BQP is contained in DLOG.

Statement

Migrated verbatim from bounded-error-quantum-polynomial-time § Notable problems:

• Integer factorization and discrete logarithm are in $\mathbf{BQP}$ via Shor’s algorithm — Shor97. This directly breaks RSA, Diffie-Hellman, DSA, and ECDSA.

Notes

class: unstated: no citing page says which notion of reduction is meant. Recording a class the wiki does not state would add a claim.

class: free because a containment between complexity classes is proved by any argument at all; the reduction-class axis does not discriminate here, and unstated would wrongly suggest the information is missing.

Recorded during migration and not fixed — these are claims about the source text, not changes to it:

• POLARITY INVERTED, same as sub-edge 0.
• Not wikilinked despite content/Assumptions/discrete-logarithm.md existing.