Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs

• URL: http://arxiv.org/abs/2411.01452v1
• Date: Sun, 03 Nov 2024 06:19:42 GMT
• Title: Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
• Authors: Jun Takahashi, Sam Slezak, Elizabeth Crosson,
• Abstract summary: Heisenberg antiferromagnets (AFM) with bipartite interaction graphs are a popular target of computational Quantum Monte Carlo studies. We introduce a ground state variant of the series expansion QMC method, and for the special class of AFM on interaction graphs with an $O(1)$-bipartite component (star-like) We prove rapid mixing of the associated QMC Markov chain (polynomial time in the number of qubits) by using Jerrum and Sinclair's method of canonical paths.
• Score: 0.0
• License:
• Abstract: Quantum Monte Carlo (QMC) methods have proven invaluable in condensed matter physics, particularly for studying ground states and thermal equilibrium properties of quantum Hamiltonians without a sign problem. Over the past decade, significant progress has also been made on their rigorous convergence analysis. Heisenberg antiferromagnets (AFM) with bipartite interaction graphs are a popular target of computational QMC studies due to their physical importance, but despite the apparent empirical efficiency of these simulations it remains an open question whether efficient classical approximation of the ground energy is possible in general. In this work we introduce a ground state variant of the stochastic series expansion QMC method, and for the special class of AFM on interaction graphs with an $O(1)$-bipartite component (star-like), we prove rapid mixing of the associated QMC Markov chain (polynomial time in the number of qubits) by using Jerrum and Sinclair's method of canonical paths. This is the first Markov chain analysis of a practical class of QMC algorithms with the loop representation of Heisenberg models. Our findings contribute to the broader effort to resolve the computational complexity of Heisenberg AFM on general bipartite interaction graphs.

Related papers

• Preempting Fermion Sign Problem: Unveiling Quantum Criticality through Nonequilibrium Dynamics [4.1098478048719524]
  We propose an innovative framework based on nonequilibrium critical dynamics to preempt sign problem. By virtue of universal scaling theory of imaginary-time relaxation dynamics, we demonstrate that accurate critical point and critical exponents can be obtained in the short-time stage. We for the first time reveal the quantum phase diagram in the Hubbard model hosting $rm SU(3)$-symmetric Dirac fermions.
  arXiv  Detail & Related papers  (2024-10-24T15:37:45Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Dynamics of magnetization at infinite temperature in a Heisenberg spin chain [105.07522062418397]
  In a chain of 46 superconducting qubits, we study the probability distribution, $P(mathcalM)$, of the magnetization transferred across the chain's center. The first two moments of $P(mathcalM)$ show superdiffusive behavior, a hallmark of KPZ. The third and fourth moments rule out the KPZ conjecture and allow for evaluating other theories.
  arXiv  Detail & Related papers  (2023-06-15T17:58:48Z)
• Non-Hermitian strongly interacting Dirac fermions: a quantum Monte-Carlo study [2.580765958706854]
  In this letter, we investigate the interplay between non-Hermitian physics and strong correlation in Dirac-fermion systems. We decipher the ground-state phase diagram of the Honeycomb Hubbard model in the presence non-Hermitian asymmetric spin resolved hopping processes. Our study reveals that critical properties of the quantum phase transition between Dirac semi-metal and AF ordered phases are consistent with the universality class in Hermitian system.
  arXiv  Detail & Related papers  (2023-02-20T17:22:01Z)
• Quasiclassical approaches to the generalized quantum master equation [0.0]
  The generalized quantum master equation (GQME) expresses correlation functions in terms of a non-Markovian equation of motion. We study the approximate solution of the GQME, obtained by calculating the kernels with two methods, namely Ehrenfest mean-field theory and spin mapping. We find that the accuracy of the predictions of the GQME depends strongly on the specific technique used to calculate the kernels.
  arXiv  Detail & Related papers  (2022-09-02T14:14:05Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Genuine Multipartite Correlations in a Boundary Time Crystal [56.967919268256786]
  We study genuine multipartite correlations (GMC's) in a boundary time crystal (BTC) We analyze both (i) the structure (orders) of GMC's among the subsystems, as well as (ii) their build-up dynamics for an initially uncorrelated state.
  arXiv  Detail & Related papers  (2021-12-21T20:25:02Z)
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity [0.0]
  Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum computer by preparing a quantum state that encodes the entire probability distribution followed by a projective measurement. We investigate the complexity of adiabatically preparing such quantum states for the Gibbs distributions of various models including the Ising chain, hard-sphere models on different graphs, and a model encoding the unstructured search problem.
  arXiv  Detail & Related papers  (2021-09-07T11:43:45Z)
• 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)
• Finite Temperature Auxiliary Field Quantum Monte Carlo in the Canonical Ensemble [15.163835008676621]
  We present a new approach for performing AFQMC simulations in the canonical ensemble that does not require knowledge of chemical potentials. We benchmark the accuracy of our technique on illustrative Bose and Fermi Hubbard models and demonstrate that it can converge more quickly to the ground state than grand canonical AFQMC simulations.
  arXiv  Detail & Related papers  (2020-10-19T19:44:59Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.