ScholarGate
Asistent

Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Shorov algoritmus×Kvantové odhadovanie fázy×
OdborKvantové výpočtyKvantové výpočty
RodinaMachine learningMachine learning
Rok vzniku19941995
TvorcaPeter ShorAlexei Kitaev
TypQuantum algorithmSubroutine algorithm
Pôvodný zdrojShor, 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 ↗Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗
Ďalšie názvyShor factorization, quantum factorizationQPE, phase kickback
Príbuzné33
ZhrnutieShor'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.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.
ScholarGateDátová sada
  1. v1
  2. 3 Zdroje
  3. PUBLISHED
  1. v1
  2. 3 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

ScholarGatePorovnať metódy: Shor's Algorithm · Quantum Phase Estimation. Získané 2026-06-15 z https://scholargate.app/sk/compare