Quantum Markov chain Monte Carlo method with programmable quantum simulators
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917458095374336 |
|---|---|
| author | D'Arcangelo, Mauro Javanmard, Younes Pearson, Natalie |
| author_facet | D'Arcangelo, Mauro Javanmard, Younes Pearson, Natalie |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_21255 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Markov chain Monte Carlo method with programmable quantum simulators D'Arcangelo, Mauro Javanmard, Younes Pearson, Natalie Quantum Physics 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. |
| title | Quantum Markov chain Monte Carlo method with programmable quantum simulators |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2505.21255 |