Related papers: Parallelized Traveling Cluster Approximation to St…
We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use…
We develop a general theory of a boson decomposition for both local and non-local interactions in lattice fermion models which allows us to describe fermionic degrees of freedom and collective charge and spin excitations on equal footing.…
Applications that require substantial computational resources today cannot avoid the use of heavily parallel machines. Embracing the opportunities of parallel computing and especially the possibilities provided by a new generation of…
Large N gauge theories with adjoint matter can be numerically studied using lattice techniques. Eguchi-Kawai reductions holds for this theory and one can reduce the lattice model to a single site. Hybrid Monte Carlo algorithm can be used to…
Clustering is a fundamental problem in many scientific applications. Standard methods such as $k$-means, Gaussian mixture models, and hierarchical clustering, however, are beset by local minima, which are sometimes drastically suboptimal.…
We present a systematic approach for the semiclassical treatment of many-body dynamics of interacting, open spin systems. Our approach overcomes some of the shortcomings of the recently developed discrete truncated Wigner approximation…
Movement drives the spread of infectious disease, gene flow, and other critical ecological processes. To study these processes we need models for movement that capture complex behavior that changes over time and space in response to biotic…
The Coupled Cluster (CC) and full CI expansions are studied for three fermions with six and seven modes. Surprisingly the CC expansion is tailor made to characterize the usual SLOCC entanglement classes. It means that the notion of a SLOCC…
The numerical analysis of strongly interacting nanostructures requires powerful techniques. Recently developed methods, such as the time-dependent density matrix renormalization group (tDMRG) approach or the embedded-cluster approximation…
Cluster Monte Carlo algorithms are widely regarded as the most effective route to overcoming critical slowing down in lattice spin systems. Whether this acceleration persists in the presence of vacancies and multicritical fluctuations,…
Despite their formal simplicity, most lattice spin models cannot be easily solved, even under the simplifying assumptions of mean field theory. In this manuscript, we present a method for generating mean field solutions to classical…
We propose a parallel algorithm for the numerical solution of a class of second order semi-linear equations coming from stochastic optimal control problems, by means of a dynamic domain decomposition technique. The new method is an…
With the aggressive scaling of VLSI technology, the explosion of layout patterns creates a critical bottleneck for DFM applications like OPC. Pattern clustering is essential to reduce data complexity, yet existing methods struggle with…
We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in Exact Diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of…
Tensor canonical correlation analysis (TCCA) has garnered significant attention due to its effectiveness in capturing high-order correlations in multi-view learning. However, existing TCCA methods often underemphasize the characterization…
We introduce and motivate the study of quantum spin chains on a one-dimensional lattice. We classify the varieties of methods that have been used to study these models into three categories, - a) exact methods to study specific models b)…
Correlated fermions are of high interest in condensed matter (Fermi liquids, Wigner molecules), cold atomic gases and dense plasmas. Here we propose a novel approach to path integral Monte Carlo (PIMC) simulations of strongly degenerate…
The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with wide-ranging applications in logistics, routing, and intelligent systems. Due to its factorial complexity, solving large-scale instances…
Nested multi-step stochastic correction offers a possibility to improve updating algorithms for numerical simulations of lattice gauge theories with fermions. The corresponding generalisations of the two-step multi-boson (TSMB) algorithm as…