Finite Temperature Auxiliary Field Quantum Monte Carlo in the Canonical Ensemble

• URL: http://arxiv.org/abs/2010.09813v1
• Date: Mon, 19 Oct 2020 19:44:59 GMT
• Title: Finite Temperature Auxiliary Field Quantum Monte Carlo in the Canonical Ensemble
• Authors: Tong Shen, Yuan Liu, Yang Yu and Brenda Rubenstein
• Abstract summary: 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.
• Score: 15.163835008676621
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Finite temperature auxiliary field-based Quantum Monte Carlo methods, including Determinant Quantum Monte Carlo (DQMC) and Auxiliary Field Quantum Monte Carlo (AFQMC), have historically assumed pivotal roles in the investigation of the finite temperature phase diagrams of a wide variety of multidimensional lattice models and materials. Despite their utility, however, these techniques are typically formulated in the grand canonical ensemble, which makes them difficult to apply to condensates like superfluids and difficult to benchmark against alternative methods that are formulated in the canonical ensemble. Working in the grand canonical ensemble is furthermore accompanied by the increased overhead associated with having to determine the chemical potentials that produce desired fillings. Given this backdrop, in this work, we present a new recursive approach for performing AFQMC simulations in the canonical ensemble that does not require knowledge of chemical potentials. To derive this approach, we exploit the convenient fact that AFQMC solves the many-body problem by decoupling many-body propagators into integrals over one-body problems to which non-interacting theories can be applied. 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. We believe that our novel use of HS-transformed operators to implement algorithms originally derived for non-interacting systems will motivate the development of a variety of other methods and anticipate that our technique will enable direct performance comparisons against other many-body approaches formulated in the canonical ensemble.

Related papers

• Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs [0.0]
  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.
  arXiv  Detail & Related papers  (2024-11-03T06:19:42Z)
• A quantum computing approach to fixed-node Monte Carlo using classical shadows [0.0]
  We study an approach to avoid an exponentially scaling step by using a fixed-node Monte Carlo method. We consider H$_4$, ferrocene and benzene molecules using up to 12 qubits as examples. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces.
  arXiv  Detail & Related papers  (2024-10-24T16:41:25Z)
• 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)
• Koopmon trajectories in nonadiabatic quantum-classical dynamics [0.0]
  We present a mixed quantum-classical (MQC) particle method based on the theory of Koopman wavefunctions. We reproduce the results of fully quantum simulations with levels of accuracy that are not achieved by standard MQC Ehrenfest simulations.
  arXiv  Detail & Related papers  (2023-12-21T14:22:16Z)
• 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)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• 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)
• From entanglement certification with quench dynamics to multipartite entanglement of interacting fermions [0.0]
  We propose an experimentally friendly protocol to measure the quantum Fisher information (QFI) It relies on recording the short-time dynamics of simple observables after a quench from a thermal state. It can be implemented in standard cold-atom experiments and other platforms with temporal control over the system Hamiltonian.
  arXiv  Detail & Related papers  (2020-05-06T18:00:58Z)

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.