Unverified50% confidenceFactExact time
Shor's algorithm on a quantum computer can theoretically complete integer factorization in polynomial time, completely overturning the security assumptions of RSA, but a practically capable quantum computer does not yet exist.
1
Sources
50%
Confidence
Long-term
Relevance
9/20/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedShor算法利用量子傅里叶变换（QFT）在多项式时间内求解模指数函数周期，而经典计算机需要亚指数时间75% similarUnverifiedBreaking 2048-bit RSA requires approximately 4,000 logical qubits, corresponding to millions of physical qubits.72% similarUnverifiedThe MIT-IBM collaboration platform can connect the latest quantum algorithm theories to real quantum hardware for validation, shortening the cycle from research to deployment.65% similarUnverifiedSemiconductor spin qubits encode quantum information using the electron spin states in silicon-based semiconductors and are compatible with existing CMOS industry chains, a route on which Intel pins high hopes.63% similarUnverifiedQuantinuum的H系列处理器已实现超过99.8%的双量子比特门保真度63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/937134API
curl https://kongchang.com/api/v1/knowledge/claims/937134MCP
get_claim(id=937134)