Unverified50% confidenceFactExact time
Grover's algorithm was proposed by Lov Grover in 1996 and is a quantum search algorithm capable of finding a target item in an unordered database with O(√N) time complexity.
1
Sources
50%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
为何大语言模型无法破解对称加密？AI能力边界与密码学安全解析
Related Claims
UnverifiedGrover算法要求量子计算机执行串行量子操作，无法像经典计算那样简单横向扩展并行65% similarUnverifiedBitap算法由Ricardo Baeza-Yates和Gaston Gonnet于1992年提出，时间复杂度为O(mn/w)60% similarUnverified大O符号由德国数学家保罗·巴赫曼于1894年引入，用于描述算法复杂度的渐近行为58% similarUnverified差分启发式方法在学术文献中以ALT算法（A* + Landmarks + Triangle inequality）出现，由Andrew Goldberg和Chris Harrelson在2005年论文《Computing the Shortest Path: A* Search Meets Graph Theory》中系统提出58% similarUnverifiedPeter Shor在1994年提出了Shor算法，理论上能让足够强大的量子计算机在多项式时间内破解RSA和ECC加密57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/714139API
curl https://kongchang.com/api/v1/knowledge/claims/714139MCP
get_claim(id=714139)