Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Accelerating quantum Monte Carlo simulations on many-core processors via OpenMP nested threading

Ye Luo

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

Accelerating Quantum Monte Carlo Simulations with Emerging Architectures

Akila Gothandaraman

•Jan 1, 2009•1 citation

Overcoming the large-Z problem in quantum monte carlo

PETER J. REYNOLDS

The Z6 scaling of computational effort in quantum Monte Carlo (QMC) results in part from a type of critical slowing down. This insight leads to an attack based on acceleration algorithms which modify the dynamics in Langevin-based simulations without changing the steady-state. Configuration space is more rapidly sampled and steps are inherently more decorrelated. A second approach uses a hybrid Metropolis–Green function Monte Carlo method which factors the core and valence wave function, and treats the former variationally with accurate trial functions, and the latter exactly in the presence of the variationally evoling core. This allows separation of the relevant core and valence time scales, and has sped up quantum simulations by over three orders of magnitude.

International Journal of Quantum Chemistry•Mar 17, 1990•7 citations

High-Speed Algorithm for Quantum Monte Carlo Simulation

Yutaka Okabe, Macoto Kikuchi

Springer series in solid-state sciences•Jan 1, 1987•0 citations

Machine learning quantum data to accelerate quantum Monte Carlo

Tong Jiang, Andrew Zhao, Shashwat Kumar +6 more

Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we overcome this bottleneck by compressing quantum measurement data into machine-learning models that efficiently provide the wavefunction overlaps needed by QMC. This accelerates quantum-classical QMC by orders of magnitude, enabling chemically accurate simulations on up to 40 qubits, more than doubling the scale of previous hardware demonstrations with comparable accuracy. We demonstrate our approach on hydrogen chains and strongly correlated iron-sulfur clusters using measurements from Google's Willow processor. By enabling efficient reuse of quantum-state information on the classical coprocessor, our framework addresses a fundamental bottleneck in hybrid quantum algorithms that will persist even into the fault-tolerant era.

arXiv:2611.08151•Nov 5, 2026•0 citations

Hybrid algorithms in quantum Monte Carlo

Jeongnim Kim, K. Esler, Jeremy McMinis +4 more

With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.

Journal of Physics Conference Series•Dec 20, 2012•79 citations

Fast and scalable quantum computing simulation on multi-core and many-core platforms

Armin Ahmadzadeh, Hamid Sarbazi‐Azad

Quantum Information Processing•May 14, 2023•7 citations
The Z6 scaling of computational effort in quantum Monte Carlo (QMC) results in part from a type of critical slowing down. This insight leads to an attack based on acceleration algorithms which modify the dynamics in Langevin-based simulations without changing the steady-state. Configuration space is more rapidly sampled and steps are inherently more decorrelated. A second approach uses a hybrid Metropolis–Green function Monte Carlo method which factors the core and valence wave function, and treats the former variationally with accurate trial functions, and the latter exactly in the presence of the variationally evoling core. This allows separation of the relevant core and valence time scales, and has sped up quantum simulations by over three orders of magnitude.
Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we overcome this bottleneck by compressing quantum measurement data into machine-learning models that efficiently provide the wavefunction overlaps needed by QMC. This accelerates quantum-classical QMC by orders of magnitude, enabling chemically accurate simulations on up to 40 qubits, more than doubling the scale of previous hardware demonstrations with comparable accuracy. We demonstrate our approach on hydrogen chains and strongly correlated iron-sulfur clusters using measurements from Google's Willow processor. By enabling efficient reuse of quantum-state information on the classical coprocessor, our framework addresses a fundamental bottleneck in hybrid quantum algorithms that will persist even into the fault-tolerant era.
With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.