ScholarGate
Asistenti

Krahasoni metodat

Shqyrtoni metodat e zgjedhura krah për krah; rreshtat që ndryshojnë janë të theksuar.

Algoritmi i Groverit×Monte Carlo kuantik×Algoritmi i Shor-it×
FushaLlogaritja kuantikeLlogaritja kuantikeLlogaritja kuantike
FamiljaMachine learningMachine learningMachine learning
Viti i origjinës199619531994
KrijuesiLov GroverNicholas Metropolis and colleaguesPeter Shor
LlojiQuantum algorithmMonte Carlo simulationQuantum algorithm
Burimi themeluesGrover, 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 ↗Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. 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 ↗
Emërtime të tjeraquantum search, amplitude amplificationQMC, variational Monte Carlo, diffusion Monte CarloShor factorization, quantum factorization
Të lidhura333
PërmbledhjaGrover'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.Quantum Monte Carlo (QMC) is a stochastic computational method for computing ground state properties of quantum many-body systems. Combining classical Monte Carlo sampling with quantum mechanics, QMC approaches are among the most accurate methods available for electronic structure and condensed matter physics, achieving sub-percent accuracy for many systems.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 i të dhënave
  1. v1
  2. 3 Burimet
  3. PUBLISHED
  1. v1
  2. 3 Burimet
  3. PUBLISHED
  1. v1
  2. 3 Burimet
  3. PUBLISHED

Shko te kërkimi Shkarko diapozitivat

ScholarGateKrahasoni metodat: Grover's Algorithm · Quantum Monte Carlo · Shor's Algorithm. Marrë më 2026-06-15 nga https://scholargate.app/sq/compare