Related papers: Tensor network algorithm to solve polaron impurity…
The quantum theory of the Friedmann cosmological model with dust and cosmological constant ($\Lambda$) is not exactly solvable analytically. We apply Path Integral Monte Carlo (PIMC) techniques to study its quantum dynamics using the…
The Numerical Renormalization Group is used to solve quantum impurity problems, which describe magnetic impurities in metals, nanodevices, and correlated materials within DMFT. Here we present a simple generalization of the Wilson Chain,…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We develop an all-electron path integral Monte Carlo (PIMC) method with free-particle nodes for warm dense matter and apply it to water and carbon plasmas. We thereby extend PIMC studies beyond hydrogen and helium to elements with core…
Modern ConvNets continue to achieve state-of-the-art results over a vast array of vision and image classification tasks, but at the cost of increasing parameters. One strategy for compactifying a network without sacrificing much expressive…
Tensor completion is the problem of estimating the missing values of high-order data from partially observed entries. Data corruption due to prevailing outliers poses major challenges to traditional tensor completion algorithms, which…
Tensor analytics lays mathematical basis for the prosperous promotion of multiway signal processing. To increase computing throughput, mainstream processors transform tensor convolutions to matrix multiplications to enhance parallelism of…
In the present paper we propose two new algorithms of tensor completion for three-order tensors. The proposed methods consist in minimizing the average rank of the underlying tensor using its approximate function namely the tensor nuclear…
The recent low-rank prior based models solve the tensor completion problem efficiently. However, these models fail to exploit the local patterns of tensors, which compromises the performance of tensor completion. In this paper, we propose a…
Quantitative descriptions of strongly correlated materials pose a considerable challenge in condensed matter physics and chemistry. A promising approach to address this problem is quantum embedding methods. In particular, the dynamical…
We solve the problem of polaron localization on an attractive impurity by means of direct-space Diagrammatic Monte Carlo implemented for the system in the thermodynamic limit. In particular we determine the ground state phase diagram in…
A summary of the relationship between the Langevin equation, Fokker-Planck-Kolmogorov forward equation (FPKfe) and the Feynman path integral descriptions of stochastic processes relevant for the solution of the continuous-discrete filtering…
In this work we develop an alternative approach for solution of Quantum Trajectories using the Path Integral method. The state-of-the-art technique in the field is to solve a set of non-linear, coupled partial differential equations (PDEs)…
We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We…
As an effective emulator of ill-conditioned power flow, continuous Newton methods (CNMs) have been extensively investigated using explicit and implicit numerical integration algorithms. Explicit CNMs are prone to non-convergence issues due…
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems. The first algorithm is based on a universal tangent direction, which has been recently proposed for…
Feynman diagrams are an essential tool for simulating strongly correlated electron systems. However, stochastic quantum Monte Carlo sampling suffers from the sign problem, particularly when solving a multiorbital quantum impurity model.…
The derivation of path integrals is reconsidered. It is shown that the expression for the discretized action is not unique, and the path integration domain can be deformed so that at least Gaussian path integrals become probabillistic. This…