ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Thuật toán Grover×Monte Carlo lượng tử×Thuật toán Shor×
Lĩnh vựcTính toán lượng tửTính toán lượng tửTính toán lượng tử
HọMachine learningMachine learningMachine learning
Năm ra đời199619531994
Người khởi xướngLov GroverNicholas Metropolis and colleaguesPeter Shor
LoạiQuantum algorithmMonte Carlo simulationQuantum algorithm
Công trình gốcGrover, 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 ↗
Tên gọi khácquantum search, amplitude amplificationQMC, variational Monte Carlo, diffusion Monte CarloShor factorization, quantum factorization
Liên quan333
Tóm tắtGrover'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.
ScholarGateBộ dữ liệu
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Grover's Algorithm · Quantum Monte Carlo · Shor's Algorithm. Truy cập ngày 2026-06-15 từ https://scholargate.app/vi/compare