विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| क्वांटम मोंटे कार्लो× | शोर का एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | क्वांटम कंप्यूटिंग | क्वांटम कंप्यूटिंग |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1953 | 1994 |
| प्रवर्तक≠ | Nicholas Metropolis and colleagues | Peter Shor |
| प्रकार≠ | Monte Carlo simulation | Quantum algorithm |
| मौलिक स्रोत≠ | 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 ↗ |
| उपनाम≠ | QMC, variational Monte Carlo, diffusion Monte Carlo | Shor factorization, quantum factorization |
| संबंधित | 3 | 3 |
| सारांश≠ | 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. |
| ScholarGateडेटासेट ↗ |
|
|