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

arXiv:2504.07295 · Computer Physics Communications

Advanced measurement techniques in quantum Monte Carlo: The permutation matrix representation approach

Nic Ezzell, Itay Hen

Published Jan 14, 2026• 0 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2026.110019

Related papers

METHODS IN QUANTUM MONTE CARLO

Malvin H. Kalos, G.A. Mikhailov

De Gruyter eBooks•Dec 31, 1987•0 citations

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.03740•Journal of Statistical Mechanics Theory and Experiment•Jul 1, 2020•15 citations

Quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs

E. Akaturk, Itay Hen

We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.

arXiv:2309.05166•Physical review. B./Physical review. B•Apr 25, 2024•6 citations

Permutation Matrix Representation for Quantum Simulation: Comparative Resource Analysis

Hriday Sabharwal, Itay Hen

We present a comparative study of the permutation matrix representation (PMR) method for Hamiltonian simulation alongside other leading quantum algorithms. Our analysis focuses on resource costs for simulating both time-independent and time-dependent Hamiltonians. For the time-independent case, we benchmark PMR against quantum signal processing (QSP) and qubitization, using the Rydberg interaction Hamiltonian as a representative example. For the time-dependent case, we compare the time-dependent extension of PMR with the quantum highly oscillatory protocol (qHOP), applied to a Floquet-driven transverse field Ising model in arbitrary spatial dimensions. In both regimes, we find that PMR offers complementary advantages in resource requirements and exhibits favorable scaling with certain system parameters, suggesting that it may provide practical benefits on resource-constrained quantum hardware.

quant-pharXiv:2605.29279•May 29, 2026•0 citations

An Introduction to Quantum Monte Carlo

Jan Tobochnik, Harvey Gould, Kenneth Mulder

Computers in Physics•Jul 1, 1990•4 citations

Mathematical Perspective on Quantum Monte Carlo Methods

Eric Cancès B

Mathematical physics studies•Jan 1, 2014•0 citations
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.
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.
We present a comparative study of the permutation matrix representation (PMR) method for Hamiltonian simulation alongside other leading quantum algorithms. Our analysis focuses on resource costs for simulating both time-independent and time-dependent Hamiltonians. For the time-independent case, we benchmark PMR against quantum signal processing (QSP) and qubitization, using the Rydberg interaction Hamiltonian as a representative example. For the time-dependent case, we compare the time-dependent extension of PMR with the quantum highly oscillatory protocol (qHOP), applied to a Floquet-driven transverse field Ising model in arbitrary spatial dimensions. In both regimes, we find that PMR offers complementary advantages in resource requirements and exhibits favorable scaling with certain system parameters, suggesting that it may provide practical benefits on resource-constrained quantum hardware.