Browse
Submit Data
Databases
API
Help

Dataset Information

26 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A combined variational and diagrammatic quantum Monte Carlo approach to the many-electron problem.

ABSTRACT: Two of the most influential ideas developed by Richard Feynman are the Feynman diagram technique and his variational approach. Here we show that combining both, and introducing a diagrammatic quantum Monte Carlo method, results in a powerful and accurate solver to the generic solid state problem, in which a macroscopic number of electrons interact by the long range Coulomb repulsion. We apply it to the quintessential problem of solid state, the uniform electron gas, which is at the heart of the density functional theory success in describing real materials, yet it has not been adequately solved for over 90 years. Our method allows us to calculate numerically exact momentum and frequency resolved spin and charge response functions. This method can be applied to a number of moderately interacting electron systems, including models of realistic metallic and semiconducting solids.

SUBMITTER: Chen K

PROVIDER: S-EPMC6700185 | biostudies-literature | 2019 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A combined variational and diagrammatic quantum Monte Carlo approach to the many-electron problem.

Chen Kun K Haule Kristjan K

Nature communications 20190819 1

Two of the most influential ideas developed by Richard Feynman are the Feynman diagram technique and his variational approach. Here we show that combining both, and introducing a diagrammatic quantum Monte Carlo method, results in a powerful and accurate solver to the generic solid state problem, in which a macroscopic number of electrons interact by the long range Coulomb repulsion. We apply it to the quintessential problem of solid state, the uniform electron gas, which is at the heart of the ...[more]

PMID: 31427574

Similar Datasets

Streaming Variational Monte Carlo.

Project description:Nonlinear state-space models are powerful tools to describe dynamical structures in complex time series. In a streaming setting where data are processed one sample at a time, simultaneous inference of the state and its nonlinear dynamics has posed significant challenges in practice. We develop a novel online learning framework, leveraging variational inference and sequential Monte Carlo, which enables flexible and accurate Bayesian joint filtering. Our method provides an approximation of the filtering posterior which can be made arbitrarily close to the true filtering distribution for a wide class of dynamics models and observation models. Specifically, the proposed framework can efficiently approximate a posterior over the dynamics using sparse Gaussian processes, allowing for an interpretable model of the latent dynamics. Constant time complexity per sample makes our approach amenable to online learning scenarios and suitable for real-time applications.

| S-EPMC10082974 | biostudies-literature

The Sign Problem in Density Matrix Quantum Monte Carlo.

Project description:Density matrix quantum Monte Carlo (DMQMC) is a recently developed method for stochastically sampling the N-particle thermal density matrix to obtain exact-on-average energies for model and ab initio systems. We report a systematic numerical study of the sign problem in DMQMC based on simulations of atomic and molecular systems. In DMQMC, the density matrix is written in an outer product basis of Slater determinants. In principle, this means that DMQMC needs to sample a space that scales in the system size, N, as O[(exp(N))2]. In practice, removing the sign problem requires a total walker population that exceeds a system-dependent critical walker population (Nc), imposing limitations on both storage and compute time. We establish that Nc for DMQMC is the square of Nc for FCIQMC. By contrast, the minimum Nc in the interaction picture modification of DMQMC (IP-DMQMC) is only linearly related to the Nc for FCIQMC. We find that this difference originates from the difference in propagation of IP-DMQMC versus canonical DMQMC: the former is asymmetric, whereas the latter is symmetric. When an asymmetric mode of propagation is used in DMQMC, there is a much greater stochastic error and is thus prohibitively expensive for DMQMC without the interaction picture adaptation. Finally, we find that the equivalence between IP-DMQMC and FCIQMC seems to extend to the initiator approximation, which is often required to study larger systems with large basis sets. This suggests that IP-DMQMC offers a way to ameliorate the cost of moving between a Slater determinant space and an outer product basis.

| S-EPMC8515812 | biostudies-literature

Variational Principles in Quantum Monte Carlo: The Troubled Story of Variance Minimization.

Project description:We investigate the use of different variational principles in quantum Monte Carlo, namely, energy and variance minimization, prompted by the interest in the robust and accurate estimation of electronic excited states. For two prototypical, challenging molecules, we readily reach the accuracy of the best available reference excitation energies using energy minimization in a state-specific or state-average fashion for states of different or equal symmetry, respectively. On the other hand, in variance minimization, where the use of suitable functionals is expected to target specific states regardless of the symmetry, we encounter severe problems for a variety of wave functions: as the variance converges, the energy drifts away from that of the selected state. This unexpected behavior is sometimes observed even when the target is the ground state and generally prevents the robust estimation of total and excitation energies. We analyze this problem using a very simple wave function and infer that the optimization finds little or no barrier to escape from a local minimum or local plateau, eventually converging to a lower-variance state instead of the target state. For the increasingly complex systems becoming in reach of quantum Monte Carlo simulations, variance minimization with current functionals appears to be an impractical route.

| S-EPMC7365558 | biostudies-literature

Variational Hamiltonian Monte Carlo via Score Matching.

Project description:Traditionally, the field of computational Bayesian statistics has been divided into two main subfields: variational methods and Markov chain Monte Carlo (MCMC). In recent years, however, several methods have been proposed based on combining variational Bayesian inference and MCMC simulation in order to improve their overall accuracy and computational efficiency. This marriage of fast evaluation and flexible approximation provides a promising means of designing scalable Bayesian inference methods. In this paper, we explore the possibility of incorporating variational approximation into a state-of-the-art MCMC method, Hamiltonian Monte Carlo (HMC), to reduce the required expensive computation involved in the sampling procedure, which is the bottleneck for many applications of HMC in big data problems. To this end, we exploit the regularity in parameter space to construct a free-form approximation of the target distribution by a fast and flexible surrogate function using an optimized additive model of proper random basis, which can also be viewed as a single-hidden layer feedforward neural network. The surrogate function provides sufficiently accurate approximation while allowing for fast computation in the sampling procedure, resulting in an efficient approximate Bayesian inference algorithm. We demonstrate the advantages of our proposed method using both synthetic and real data problems.

| S-EPMC10162593 | biostudies-literature

Easing the Monte Carlo sign problem.

Project description:Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems. However, in many interesting situations, QMC methods are faced with a sign problem, causing the severe limitation of an exponential increase in the runtime of the QMC algorithm. In this work, we develop a systematic, generally applicable, and practically feasible methodology for easing the sign problem by efficiently computable basis changes and use it to rigorously assess the sign problem. Our framework introduces measures of non-stoquasticity that-as we demonstrate analytically and numerically-at the same time provide a practically relevant and efficiently computable figure of merit for the severity of the sign problem. Complementing this pragmatic mindset, we prove that easing the sign problem in terms of those measures is generally an NP-complete task for nearest-neighbor Hamiltonians and simple basis choices by a reduction to the MAXCUT-problem.

| S-EPMC7428338 | biostudies-literature

Learning Efficient, Collective Monte Carlo Moves with Variational Autoencoders.

Project description:Discovering meaningful collective variables for enhancing sampling, via applied biasing potentials or tailored MC move sets, remains a major challenge within molecular simulation. While recent studies identifying collective variables with variational autoencoders (VAEs) have focused on the encoding and latent space discovered by a VAE, the impact of the decoding and its ability to act as a generative model remains unexplored. We demonstrate how VAEs may be used to learn (on-the-fly and with minimal human intervention) highly efficient, collective Monte Carlo moves that accelerate sampling along the learned collective variable. In contrast to many machine learning-based efforts to bias sampling and generate novel configurations, our methods result in exact sampling in the ensemble of interest and do not require reweighting. In fact, we show that the acceptance rates of our moves approach unity for a perfect VAE model. While this is never observed in practice, VAE-based Monte Carlo moves still enhance sampling of new configurations. We demonstrate, however, that the form of the encoding and decoding distributions, in particular the extent to which the decoder reflects the underlying physics, greatly impacts the performance of the trained VAE.

| S-EPMC11210279 | biostudies-literature

Unbiasing fermionic quantum Monte Carlo with a quantum computer.

Project description:Interacting many-electron problems pose some of the greatest computational challenges in science, with essential applications across many fields. The solutions to these problems will offer accurate predictions of chemical reactivity and kinetics, and other properties of quantum systems1-4. Fermionic quantum Monte Carlo (QMC) methods5,6, which use a statistical sampling of the ground state, are among the most powerful approaches to these problems. Controlling the fermionic sign problem with constraints ensures the efficiency of QMC at the expense of potentially significant biases owing to the limited flexibility of classical computation. Here we propose an approach that combines constrained QMC with quantum computation to reduce such biases. We implement our scheme experimentally using up to 16 qubits to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed with the help of quantum computers, while achieving accuracy that is competitive with state-of-the-art classical methods without burdensome error mitigation. Compared with the popular variational quantum eigensolver7,8, our hybrid quantum-classical computational model offers an alternative path towards achieving a practical quantum advantage for the electronic structure problem without demanding exceedingly accurate preparation and measurement of the ground-state wavefunction.

| S-EPMC8930773 | biostudies-literature

Properties of Markov Chain Monte Carlo Performance across Many Empirical Alignments.

Project description:Nearly all current Bayesian phylogenetic applications rely on Markov chain Monte Carlo (MCMC) methods to approximate the posterior distribution for trees and other parameters of the model. These approximations are only reliable if Markov chains adequately converge and sample from the joint posterior distribution. Although several studies of phylogenetic MCMC convergence exist, these have focused on simulated data sets or select empirical examples. Therefore, much that is considered common knowledge about MCMC in empirical systems derives from a relatively small family of analyses under ideal conditions. To address this, we present an overview of commonly applied phylogenetic MCMC diagnostics and an assessment of patterns of these diagnostics across more than 18,000 empirical analyses. Many analyses appeared to perform well and failures in convergence were most likely to be detected using the average standard deviation of split frequencies, a diagnostic that compares topologies among independent chains. Different diagnostics yielded different information about failed convergence, demonstrating that multiple diagnostics must be employed to reliably detect problems. The number of taxa and average branch lengths in analyses have clear impacts on MCMC performance, with more taxa and shorter branches leading to more difficult convergence. We show that the usage of models that include both Γ-distributed among-site rate variation and a proportion of invariable sites is not broadly problematic for MCMC convergence but is also unnecessary. Changes to heating and the usage of model-averaged substitution models can both offer improved convergence in some cases, but neither are a panacea.

| S-EPMC8042746 | biostudies-literature

Fast and accurate quantum Monte Carlo for molecular crystals.

Project description:Computer simulation plays a central role in modern-day materials science. The utility of a given computational approach depends largely on the balance it provides between accuracy and computational cost. Molecular crystals are a class of materials of great technological importance which are challenging for even the most sophisticated ab initio electronic structure theories to accurately describe. This is partly because they are held together by a balance of weak intermolecular forces but also because the primitive cells of molecular crystals are often substantially larger than those of atomic solids. Here, we demonstrate that diffusion quantum Monte Carlo (DMC) delivers subchemical accuracy for a diverse set of molecular crystals at a surprisingly moderate computational cost. As such, we anticipate that DMC can play an important role in understanding and predicting the properties of a large number of molecular crystals, including those built from relatively large molecules which are far beyond reach of other high-accuracy methods.

| S-EPMC5828600 | biostudies-literature

Ab Initio Geometry and Bright Excitation of Carotenoids: Quantum Monte Carlo and Many Body Green's Function Theory Calculations on Peridinin.

Project description:In this letter, we report the singlet ground state structure of the full carotenoid peridinin by means of variational Monte Carlo (VMC) calculations. The VMC relaxed geometry has an average bond length alternation of 0.1165(10) Å, larger than the values obtained by DFT (PBE, B3LYP, and CAM-B3LYP) and shorter than that calculated at the Hartree-Fock (HF) level. TDDFT and EOM-CCSD calculations on a reduced peridinin model confirm the HOMO-LUMO major contribution of the Bu(+)-like (S2) bright excited state. Many Body Green's Function Theory (MBGFT) calculations of the vertical excitation energy of the Bu(+)-like state for the VMC structure (VMC/MBGFT) provide an excitation energy of 2.62 eV, in agreement with experimental results in n-hexane (2.72 eV). The dependence of the excitation energy on the bond length alternation in the MBGFT and TDDFT calculations with different functionals is discussed.

| S-EPMC4864508 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data