Bell Sampling in Quantum Monte Carlo Simulations.

Poetri Sonya Tarabunga, Yi-Ming Ding

Published Nov 14, 2025• 0 citations

Abstract

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.

DOI: 10.1103/fq8z-y55j

Related papers

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.14869Physical Review LettersNov 13, 20251 citation

Permutation matrix representation quantum Monte Carlo

Lalit Gupta, Tameem Albash, Itay Hen

Abstract We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its off-diagonal terms and is both parameter-free and Trotter error-free. In our approach, the quantum dimension consists of products of elements of a permutation group. As such, it allows for the study of a very wide variety of models on an equal footing. To demonstrate the utility of our technique, we use it to clarify the emergence of the sign problem in the simulations of non-stoquastic physical models. We showcase the flexibility of our algorithm and the advantages it offers over existing state-of-the-art by simulating transverse-field Ising model Hamiltonians and comparing the performance of our technique against that of the stochastic series expansion algorithm. We also study a transverse-field Ising model augmented with randomly chosen two-body transverse-field interactions.

arXiv:1908.03740Journal of Statistical Mechanics Theory and ExperimentJul 1, 202015 citations

Detecting symmetry-resolved entanglement: A quantum Monte Carlo approach

Kuangjie Chen, Weizhen Jia, Xiaopeng Li +2 more

Symmetry and entanglement are two fundamental concepts in quantum many-body physics. Their interplay is captured by symmetry-resolved entanglement, which decomposes the total entanglement into contributions from different symmetry sectors. Computing symmetry-resolved entanglement in strongly interacting higher-dimensional quantum systems remains challenging. Here, we formulate and implement an estimator-based quantum Monte Carlo (QMC) framework for computing symmetry-resolved Rényi entropies (SRRE) in sign-problem-free interacting lattice systems by measuring disorder (symmetry-twisted) operators in ordinary and replica ensembles and reconstructing SRRE from the corresponding charged moments. We validate the framework in two controlled one-dimensional settings: the transverse-field Ising model (TFIM), for which exact conformal-field-theory predictions are available, and the interacting Heisenberg chain, which tests the U(1) U ( 1 ) symmetry-sector reconstruction and its finite-size behavior. We then apply the method to the two-dimensional TFIM. Within the accessible system sizes and a phenomenological finite-size extrapolation, our data provide numerical evidence consistent with entanglement equipartition at the (2+1) ( 2 + 1 ) D Ising critical point. Our work establishes a practical numerical route to symmetry-resolved entanglement in interacting lattice models and provides a framework for future studies beyond one dimension.

arXiv:2604.02307SciPost PhysicsOct 21, 20260 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.10486Sep 10, 20260 citations

Stochastic series expansion quantum Monte Carlo for Rydberg arrays

Ejaaz Merali, Isaac J. S. De Vlugt, Roger G. Melko

Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.

arXiv:2107.00766SciPost Physics CoreApr 5, 20249 citations

A Unified Framework for Cluster Methods with Tensor Networks

Erdong Guo, David Draper

Markov Chain Monte Carlo (MCMC), and Tensor Networks (TN) are two powerful frameworks for numerically investigating many-body systems, each offering distinct advantages. MCMC, with its flexibility and theoretical consistency, is well-suited for simulating arbitrary systems by sampling. TN, on the other hand, provides a powerful tensor-based language for capturing the entanglement properties intrinsic to many-body systems, offering a universal representation of these systems. In this work, we leverage the computational strengths of TN to design a versatile cluster MCMC sampler. Specifically, we propose a general framework for constructing tensor-based cluster MCMC methods, enabling arbitrary cluster updates by utilizing TNs to compute the distributions required in the MCMC sampler. Our framework unifies several existing cluster algorithms as special cases and allows for natural extensions. We demonstrate our method by applying it to the simulation of the two-dimensional Edwards-Anderson Model and the three-dimensional Ising Model. This work is dedicated to the memory of Prof. David Draper.

arXiv:2409.04729Sep 7, 20240 citations