Quantum Markov chain Monte Carlo with programmable quantum simulators

• URL: http://arxiv.org/abs/2505.21255v1
• Date: Tue, 27 May 2025 14:37:35 GMT
• Title: Quantum Markov chain Monte Carlo with programmable quantum simulators
• Authors: Mauro D'Arcangelo, Younes Javanmard, Natalie Pearson,
• Abstract summary: We show how to address the conditions for ergodicity and sampling from distributions of quantum states using the Many-Body Localized phase.<n>The algorithm can be implemented on any quantum hardware capable of simulating the Floquet dynamics of a 1D Ising chain with nearest-neighbor interactions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 hardware capable of simulating the Floquet dynamics of a 1D Ising chain with nearest-neighbor interactions, providing a practical way of extending the range of simulable Hamiltonians of current QPUs.

Related papers

• Pulse-based optimization of quantum many-body states with Rydberg atoms in optical tweezer arrays [39.58317527488534]
  We explore a pulse-based variational quantum eigensolver algorithm for Rydberg atoms in optical tweezer arrays.<n>We numerically demonstrate that the ground states of the one-dimensional antiferromagnetic Heisenberg model and the mixed-field Ising model can be accurately prepared.
  arXiv  Detail & Related papers  (2025-07-25T10:51:49Z)
• Quantum-assisted variational Monte Carlo [1.283555556182245]
  We introduce a quantum-assisted variational Monte Carlo (QA-VMC) algorithm for solving the ground state of quantum many-body systems.<n>We demonstrate that the quantum-assisted proposal exhibits larger absolute spectral gaps and reduced autocorrelation times compared to conventional classical proposals.
  arXiv  Detail & Related papers  (2025-02-28T07:31:38Z)
• Real-time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm For Noisy Quantum Circuit Simulations [3.6733372067077954]
  We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems.<n>Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution.
  arXiv  Detail & Related papers  (2025-02-26T08:31:23Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Quantum Dynamical Hamiltonian Monte Carlo [0.0]
  A ubiquitous problem in machine learning is sampling from probability distributions that we only have access to via their log probability. We extend the well-known Hamiltonian Monte Carlo (HMC) method for Chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner.
  arXiv  Detail & Related papers  (2024-03-04T07:08:23Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Squeezing and quantum approximate optimization [0.6562256987706128]
  Variational quantum algorithms offer fascinating prospects for the solution of optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. We show numerically as well as on an IBM quantum chip how highly squeezed states are generated in a systematic procedure.
  arXiv  Detail & Related papers  (2022-05-20T18:00:06Z)
• Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials [0.0]
  We propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer. We show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work.
  arXiv  Detail & Related papers  (2022-03-28T11:16:33Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Entanglement from tensor networks on a trapped-ion QCCD quantum computer [2.943524728957949]
  We experimentally demonstrate a significant benefit of this approach to quantum simulation. In addition to all correlation functions, the entanglement structure of an infinite system is conveniently encoded within a small register of "bond qubits" We quantitatively determine the near-critical entanglement entropy of a correlated spin chain directly in the thermodynamic limit.
  arXiv  Detail & Related papers  (2021-04-22T18:00:00Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.