ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

خوارزمية شور×تقدير الطور الكمومي×
المجالالحوسبة الكموميةالحوسبة الكمومية
العائلةMachine learningMachine learning
سنة النشأة19941995
صاحب الطريقةPeter ShorAlexei Kitaev
النوعQuantum algorithmSubroutine algorithm
المصدر التأسيسي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 ↗Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗
الأسماء البديلةShor factorization, quantum factorizationQPE, phase kickback
ذات صلة33
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 3 المصادر
  3. PUBLISHED
  1. v1
  2. 3 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Shor's Algorithm · Quantum Phase Estimation. استُرجع بتاريخ 2026-06-15 من https://scholargate.app/ar/compare