Related papers: Continuous momentum dependence in the dynamical cl…
We added an extra condition, original lattice symmetry of chosen cluster around cluster central site, to the cluster approximation methods with periodic boundary condition such as dynamical cluster approximation (DCA), effective medium…
Two widely-used non-local extensions of dynamical mean field theory (DMFT), cellular DMFT (CDMFT) and the dynamical cluster approximation (DCA), both yield self-energies marred by having some unphysical properties: CDMFT yields real-space…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
We investigate a difference-of-convex (DC) formulation where the second term is allowed to be weakly convex. We examine the precise behavior of a single iteration of the difference-of-convex algorithm (DCA), providing a tight…
Despite the ability to produce human-level speech for in-domain text, attention-based end-to-end text-to-speech (TTS) systems suffer from text alignment failures that increase in frequency for out-of-domain text. We show that these failures…
In this work we introduce the Dual Boson Diagrammatic Monte Carlo technique for strongly interacting electronic systems. This method combines the strength of dynamical mean-filed theory for non-perturbative description of local correlations…
Results from a modified Diffusion Limited Aggregation (DLA) model are presented. The modifications of the classical DLA model are in the attachment to the cluster rules and in the scheme of particle generation/killing. In the classical DLA…
The four-site DCA method of including intersite correlations in the dynamical mean field theory is used to investigate the metal-insulator transition in the Hubbard model. At half filling a gap-opening transition is found to occur as the…
In fully-dynamic consistent clustering, we are given a finite metric space $(M,d)$, and a set $F\subseteq M$ of possible locations for opening centers. Data points arrive and depart, and the goal is to maintain an approximately optimal…
We study the Hubbard model using the Cellular Dynamical Mean-Field Theory (CDMFT) with quantum Monte Carlo (QMC) simulations. We present the algorithmic details of CDMFT with the Hirsch-Fye QMC method for the solution of the…
We have implemented the dynamical vertex approximation (D$\Gamma$A) in its full parquet-based version to include spatial correlations on all length scales and in {\sl all} scattering channels. The algorithm is applied to study the…
A method, called the adaptive cluster approximation (ACA), for single-impurity Anderson models is proposed. It is based on reduced density-matrix functional theory, where the one-particle reduced density matrix is used as the basic…
We propose a modified coupled cluster Monte Carlo algorithm that stochastically samples connected terms within the truncated Baker--Campbell--Hausdorff expansion of the similarity transformed Hamiltonian by construction of coupled cluster…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
The density classification (DC) task, a computation which maps global density information to local density, is studied using one-dimensional non-unitary quantum cellular automata (QCAs). Two approaches are considered: one that preserves the…
The difference-of-convex algorithm (DCA) is a conceptually simple method for the minimization of (possibly) nonconvex functions that are expressed as the difference of two convex functions. At each iteration, DCA constructs a global…
We further develop an extended dynamical mean field approach introduced earlier. It goes beyond the standard $D=\infty$ dynamical mean field theory by incorporating quantum fluctuations associated with intersite (RKKY-like) interactions.…
We formulate a finite-temperature scheme of the variational cluster approximation (VCA) particularly suitable for an exact-diagonalization cluster solver. Based on the analytical properties of the single-particle Green's function matrices,…
We introduce three novel semi-parametric extensions of probabilistic canonical correlation analysis with identifiability guarantees. We consider moment matching techniques for estimation in these models. For that, by drawing explicit links…
The central problem in electronic structure theory is the computation of the eigenvalues of the electronic Hamiltonian -- an unbounded, self-adjoint operator acting on a Hilbert space of antisymmetric functions. Coupled cluster (CC)…