Quantum Markov chain Monte Carlo method with programmable quantum simulators

In this work, we present a quantum Markov chain algorithm for many-body systems that utilizes a special phase of matter known as the Many-Body Localized (MBL) phase. We show how the properties of the MBL phase enable one to address the conditions for ergodicity and sampling from distributions of quantum states. We demonstrate how to exploit the thermalized-to-localized transition to tune the acceptance rate of the Markov chain, and apply the algorithm to solve a range of combinatorial optimization problems of quadratic order and higher. The algorithm can be implemented on any quantum processing unit capable of simulating the Floquet dynamics of a one-dimensional Ising chain with nearest-neighbor interactions, providing a practical way of sampling from thermal distributions of Hamiltonians that cannot be natively implemented on the quantum hardware.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2026-04-13
DOI
https://doi.org/10.1103/7y57-1x19
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Markov chain Monte Carlo method with programmable quantum simulators

Natalie Pearson, Younes Javanmard, Mauro D'Arcangelo
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
article

Quantum Markov chain Monte Carlo method with programmable quantum simulators

Natalie Pearson, Younes Javanmard, Mauro D'Arcangelo
article en

Abstract

In this work, we present a quantum Markov chain algorithm for many-body systems that utilizes a special phase of matter known as the Many-Body Localized (MBL) phase. We show how the properties of the MBL phase enable one to address the conditions for ergodicity and sampling from distributions of quantum states. We demonstrate how to exploit the thermalized-to-localized transition to tune the acceptance rate of the Markov chain, and apply the algorithm to solve a range of combinatorial optimization problems of quadratic order and higher. The algorithm can be implemented on any quantum processing unit capable of simulating the Floquet dynamics of a one-dimensional Ising chain with nearest-neighbor interactions, providing a practical way of sampling from thermal distributions of Hamiltonians that cannot be natively implemented on the quantum hardware.

Physical review. A/Physical review, AVol. 113(5)
Pennsylvania Academy of Science (US)
Openalex Percentile: Top 99%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum Markov chain Monte Carlo method with programmable quantum simulators — Natalie Pearson, Younes Javanmard, et al. · Physical review. A/Physical review, A (2026) | TGRS Research Map | TGRS