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

ULTRA-QMC: A Universal Quantum Monte Carlo Framework

Mohsen Doust Mohammadi

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.20583.92322

Related papers

Quantum Monte Carlo (QMC) Methods

Kaoru Ohno, Keivan Esfarjani, Yoshiyuki Kawazoe

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

Faster Quantum Monte Carlo Simulation by Random Compilation

John M. Martyn, Joshua Lin, Neill C. Warrington +2 more

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.

quant-pharXiv:2609.10486•Sep 10, 2026•1 citation

Quantum Monte Carlo (QMC) Methods

Kaoru Ohno, Keivan Esfarjani, Yoshiyuki Kawazoe

Springer eBooks•Jan 1, 2018•0 citations

Bell Sampling in Quantum Monte Carlo Simulations

Poetri Sonya Tarabunga, Yi-Ming Ding

Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This Letter introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion, where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional Z_{2} lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This Letter establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.

arXiv:2505.14869•Physical Review Letters•Nov 13, 2025•2 citations

Title: Quantum Monte Carlo with Integrated Constraint Mapping

Jincheng Zhang

Quantum Monte Carlo (QMC) methods offer a powerful approach to solving complex quantum mechanical problems, particularly those with intricate constraints. However, traditional QMC implementations often struggle with the computational demands associated with handling these constraints effectively. This paper introduces a novel hybrid approach that integrates constraint mapping techniques directly into the Monte Carlo framework, aiming to significantly improve the efficiency and scalability of QMC for problems demanding robust constraint handling. We demonstrate the effectiveness of this integrated method through rigorous analysis and illustrative examples, addressing the limitations of current approaches and presenting a framework for tackling high-dimensional problems with inherent constraints. The core mechanism revolves around dynamically adapting constraint mappings during the Monte Carlo integration process, thereby reducing the computational burden and enhancing the algorithm's ability to navigate complex solution spaces.

•Sep 6, 2026•0 citations

Quantum Monte Carlo Methods

Stephen Fahy

Kluwer international series in engineering and computer science•Jan 1, 1996•1 citation
Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.
Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This Letter introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion, where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional Z_{2} lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This Letter establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.
Quantum Monte Carlo (QMC) methods offer a powerful approach to solving complex quantum mechanical problems, particularly those with intricate constraints. However, traditional QMC implementations often struggle with the computational demands associated with handling these constraints effectively. This paper introduces a novel hybrid approach that integrates constraint mapping techniques directly into the Monte Carlo framework, aiming to significantly improve the efficiency and scalability of QMC for problems demanding robust constraint handling. We demonstrate the effectiveness of this integrated method through rigorous analysis and illustrative examples, addressing the limitations of current approaches and presenting a framework for tackling high-dimensional problems with inherent constraints. The core mechanism revolves around dynamically adapting constraint mappings during the Monte Carlo integration process, thereby reducing the computational burden and enhancing the algorithm's ability to navigate complex solution spaces.