Related papers: Two Quantum Cluster Approximations
We examine the generalized leading-logarithmic approximation (LLA) equations for compound states of n-reggeized gluons. It is shown that in multi-color QCD, when $N_c \rightarrow \infty$, these equations have a sufficient number of…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
We present second-order molecular cluster perturbation theory (MCPT(2)), a linear scaling methodology to calculate arbitrarily large systems with explicit calculation of individual wavefunctions in a coupled-cluster framework. This new…
In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…
For the treatment of interacting electrons in crystal lattices approximations based on the picture of effective sites, coupled in a self-consistent fashion, have proven very useful. Particularly in the presence of strong local correlations,…
We study both static and transport properties of model quantum dots, employing density functional theory as well as (numerically) exact methods. For the lattice model under consideration the accuracy of the local-density approximation…
Clustering multi-dimensional points is a fundamental task in many fields, and density-based clustering supports many applications as it can discover clusters of arbitrary shapes. This paper addresses the problem of Density-Peaks Clustering…
Using Gaussian integral transform techniques borrowed from functional-integral field theory and the replica trick we derive a version of the coherent-potential approximation (CPA) suited for describing ($i$) the diffusive (hopping) motion…
Symplectic symmetry approach to clustering (SSAC) in atomic nuclei, recently proposed, is modified and further developed in more detail. It is firstly applied to the light two-cluster $^{20}$Ne + $\alpha$ system of $^{24}$Mg, the latter…
We present a massively parallel quantum Monte Carlo based implementation of real-space dynamical mean-field theory for general inhomogeneous correlated fermionic lattice systems. As a first application, we study magnetic order in a binary…
Clustering is one of the most fundamental problem in Machine Learning. Researchers in the field often require a lower bound on the size of the clusters to maintain anonymity and upper bound for the ease of analysis. Specifying an optimal…
We present massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of $n$ input $d$-dimensional vectors under Hamming, $\ell_1, \ell_2$ and $\ell_\infty$ distances. All our…
In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are…
D-theory provides an alternative lattice regularization of the (1+1)-d CP(N-1) quantum field theory. In this formulation the continuous classical CP(N-1) fields emerge from the dimensional reduction of discrete SU(N) quantum spins. In…
Centered kernel alignment (CKA) is a popular metric for comparing representations, determining equivalence of networks, and neuroscience research. However, CKA does not account for the underlying manifold and relies on numerous heuristics…
Density functional theory (DFT) provides convenient electronic structure methods for the study of molecular systems and materials. Regular Kohn-Sham DFT calculations rely on unitary transformations to determine the ground-state electronic…
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Loschmidt echo, FD) in a classically chaotic system. It was thought that such evaluation would be intractable, but instead we show that a…
Simulations in finite density, beta=0 lattice QCD by means of the Monomer-Dimer-Polymer algorithm show a signal of first order transition at finite temporal size. This behaviour agrees with predictions of the mean field approximation, but…
We study domain growth properties of two species of particles executing biased diffusion on a half-filled square lattice, consisting of just two lanes. Driven in opposite directions by an external ``electric'' field, the particles form…
With the emergence of Artificial Intelligence, numerical algorithms are moving towards more approximate approaches. For methods such as PCA or diffusion maps, it is necessary to compute eigenvalues of a large matrix, which may also be dense…