Algorithms for quantum computation

Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124-134.

Type

Conference paper

Intellectual base

Primary research

Year

1994

Link

https://doi.org/10.1109/SFCS.1994.365700verified

Cited from

physics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Superposition

  • This sourceDemonstrates exponential speedup of quantum algorithm by maintaining superposition through a complex unitary evolution.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:09be7783cfbb · see in the full table