Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer¶
Shor, P. W. (1996). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Search Problem
- Their graph and integer representations, validity predicates, and solvers differ, but each demands a concrete admissible output.
This sourceOriginal full paper inspected. The section seeks a nontrivial factor and develops a quantum order-finding solver with stated success conditions; this entry uses the factor-output task, not a universal complexity claim.
- Their graph and integer representations, validity predicates, and solvers differ, but each demands a concrete admissible output.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:73a701e356ce · see in the full table