ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

Quantum Monte Carlo×Shor's Algorithm×
分野量子コンピューティング量子コンピューティング
系統Machine learningMachine learning
提唱年19531994
提唱者Nicholas Metropolis and colleaguesPeter Shor
種類Monte Carlo simulationQuantum 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 CarloShor factorization, quantum factorization
関連33
概要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データセット
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Quantum Monte Carlo · Shor's Algorithm. 2026-06-17に以下より取得 https://scholargate.app/ja/compare