Related papers: Convergence of the Cumulant Expansion and Polynomi…
We present a technique that enables the evaluation of perturbative expansions based on one-loop-renormalized vertices up to large expansion orders. Specifically, we show how to compute large-order corrections to the random phase…
We present a new algorithm for calculating the Renyi entanglement entropy of interacting fermions using the continuous-time quantum Monte Carlo method. The algorithm only samples interaction correction of the entanglement entropy, which by…
Numerically exact continuous-time Quantum Monte Carlo algorithm for finite fermionic systems with non-local interactions is proposed. The scheme is particularly applicable for general multi-band time-dependent correlations since it does not…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…
We present numerically exact continuous-time Quantum Monte Carlo algorithm for fermions with a general non-local in space-time interaction. The new determinantal grand-canonical scheme is based on a stochastic series expansion for the…
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
We describe a controllable and unbiased strong-coupling diagrammatic Monte Carlo technique that is applicable to a wide range of fermionic systems and spin models. Unlike previous strong coupling methods that generally rely on the…
We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…
We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…
An algorithm for obtaining the Taylor coefficients of an expansion of Feynman diagrams is proposed. It is based on recurrence relations which can be applied to the propagator as well as to the vertex diagrams. As an application, several…
We present simple conditions under which the limiting genealogical process associated with a class of interacting particle systems with non-neutral selection mechanisms, as the number of particles grows, is a time-rescaled Kingman…
The derivation of effective macroscopic theories approximating microscopic systems of interacting particles is a major question in non-equilibrium statistical mechanics. In these notes we present an approximation of systems made by many…
Exponential observables, formulated as $\log \langle e^{\hat{X}}\rangle$ where $\hat{X}$ is an extensive quantity, play a critical role in study of quantum many-body systems, examples of which include the free-energy and entanglement…
A recently developed lattice method for large numbers of strongly interacting nonrelativistic fermions exhibits a heavy tail in the distributions of correlators for large Euclidean time {\tau} and large number of fermions N, which only…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…