Skip to content
gentic.news — AI News Intelligence Platform
Connecting to the Living Graph…
Subgraph Atlas · centered on entity

Shor's algorithm

technology2 mentions· velocity: stable

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best

Two-hop subgraph: this entity, every entity it directly relates to, and every entity those neighbors relate to. Drag a node, scroll to zoom, click to inspect — or click any neighbor and re-center the atlas there.

0 nodes · 0 edges · loading…
companypersonai_modelproductresearch_labbenchmarkframework
drag to move · scroll to zoom · click a node
How to read this: the white-ringed node is Shor's algorithm. Surrounding nodes are direct relationships; the second ring is what those neighbors connect to. Edge thickness scales with source-article evidence. Click any node and choose Center graph here to walk the graph.