Related papers: An Efficient Cluster Algorithm for CP(N-1) Models
Categorical symmetries have recently been shown to generalize the classification of phases of matter, significantly broadening the traditional Landau paradigm. To test these predictions, we propose a simple spin chain model that encompasses…
Conservation of symmetries plays a crucial role in both classical and quantum simulations of many-body systems, enabling the tracking of states with specific symmetry properties and leading to substantial reductions in the number of…
It is shown how to adapt the non-perturbative coupled cluster method of many-body theory so that it may be successfully applied to Hamiltonian lattice $SU(N)$ gauge theories. The procedure involves first writing the wavefunctions for the…
The quantum link~\cite{Brower:1997ha} Hamiltonian was introduced two decades ago as an alternative to Wilson's Euclidean lattice QCD with gauge fields represented by bi-linear fermion/anti-fermion operators. When generalized this new…
Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a density peaks…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
We present a spin-free, size-extensive, and size-consistent coupled cluster method based on a generalised normal ordered exponential ansatz. This approach is a natural generalisation of single-reference coupled cluster theory for arbitrary…
A cluster algorithm is constructed and applied to study the chiral limit of the strongly coupled lattice Schwinger model involving staggered fermions. The algorithm is based on a novel loop representation of the model. Finite size scaling…
We introduce the Neural Collaborative Subspace Clustering, a neural model that discovers clusters of data points drawn from a union of low-dimensional subspaces. In contrast to previous attempts, our model runs without the aid of spectral…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach…
We study graph clustering in the Stochastic Block Model (SBM) in the presence of both large clusters and small, unrecoverable clusters. Previous convex relaxation approaches achieving exact recovery do not allow any small clusters of size…
Exact diagonalization (ED) is one of the most reliable and established numerical methods of quantum many-body theory. The main limiting factor of the method is the exponential scaling of Hilbert space dimension with system size.…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
We introduce the first work on benchmarking and evaluating deep clustering algorithms on large-scale non-categorical 3D CAD models. We first propose a workflow to allow expert mechanical engineers to efficiently annotate 252,648 carefully…
Subspace clustering algorithms are notorious for their scalability issues because building and processing large affinity matrices are demanding. In this paper, we introduce a method that simultaneously learns an embedding space along…
This work investigates variational compilation methods for simulating quantum systems with internal SU(2) symmetry. The central component of the research is the application of the Dynamic Mode Decomposition (DMD) method to extrapolate…
We study the Hamiltonian formulation of SU(2) Yang-Mills theory with staggered fermions in a (2+1)-dimensional small lattice system. We construct a gauge-invariant and finite-dimensional Hilbert space for the theory by applying the…
The simulation of strongly correlated electron systems remains a formidable challenge. Certain experimentally relevant dynamical response functions are especially difficult to calculate, due to issues of finite-size effects and the ill…
The simulation of real-time dynamics in lattice gauge theories is particularly hard for classical computing due to the exponential scaling of the required resources. On the other hand, quantum algorithms can potentially perform the same…