ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Algoriti ya Grover×Algorithmu ya Shor×
NyanjaUkokotoaji wa KwantamuUkokotoaji wa Kwantamu
FamiliaMachine learningMachine learning
Mwaka wa asili19961994
MwanzilishiLov GroverPeter Shor
AinaQuantum algorithmQuantum algorithm
Chanzo asiliaGrover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219. DOI ↗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. DOI ↗
Majina mbadalaquantum search, amplitude amplificationShor factorization, quantum factorization
Zinazohusiana33
MuhtasariGrover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement.Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory.
ScholarGateSeti ya data
  1. v1
  2. 3 Vyanzo
  3. PUBLISHED
  1. v1
  2. 3 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Download slides

ScholarGateLinganisha mbinu: Grover's Algorithm · Shor's Algorithm. Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/compare