ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Algorisme de Shor×Algorisme de Grover×Distribució de Clau Quàntica (BB84)×Estimació de Fase Quàntica×
CampComputació quànticaComputació quànticaComputació quànticaComputació quàntica
FamíliaMachine learningMachine learningMachine learningMachine learning
Any d'origen1994199619841995
Autor originalPeter ShorLov GroverCharles Bennett and Gilles BrassardAlexei Kitaev
TipusQuantum algorithmQuantum algorithmCryptographic protocolSubroutine algorithm
Font seminalShor, 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 ↗Grover, 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 ↗Bennett, C. H., Brassard, G. (1984). Quantum cryptography: public key distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, 175–179. link ↗Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗
ÀliesShor factorization, quantum factorizationquantum search, amplitude amplificationBB84, quantum cryptographyQPE, phase kickback
Relacionats3323
ResumShor'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.Grover'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 Key Distribution (QKD) BB84 is a cryptographic protocol allowing two parties to establish a shared secret key using quantum mechanics. Proposed by Bennett and Brassard in 1984, BB84 provides information-theoretic security: an eavesdropper's presence is guaranteed to be detected, and the secret key is provably secure against unlimited computational power.Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling.
ScholarGateConjunt de dades
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Shor's Algorithm · Grover's Algorithm · Quantum Key Distribution (BB84) · Quantum Phase Estimation. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare