Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Algoritma Grover× | Kuantum Monte Carlo× | |
|---|---|---|
| Bidang | Perkomputeran Kuantum | Perkomputeran Kuantum |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 1996 | 1953 |
| Pengasas≠ | Lov Grover | Nicholas Metropolis and colleagues |
| Jenis≠ | Quantum algorithm | Monte Carlo simulation |
| Sumber perintis≠ | 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 ↗ | Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. DOI ↗ |
| Alias≠ | quantum search, amplitude amplification | QMC, variational Monte Carlo, diffusion Monte Carlo |
| Berkaitan | 3 | 3 |
| Ringkasan≠ | 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 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. |
| ScholarGateSet data ↗ |
|
|