Cluster-Algorithm-Amenable Models of Gauge Fields and Matter

• URL: http://arxiv.org/abs/2312.16865v1
• Date: Thu, 28 Dec 2023 07:21:52 GMT
• Title: Cluster-Algorithm-Amenable Models of Gauge Fields and Matter
• Authors: Emilie Huffman
• Abstract summary: We focus on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration space. We develop new cluster algorithms and design classes of models for fermions coupled to $mathZ$ and $U(1)$ fields that are amenable to being simulated by these cluster algorithms in a sign-problem free way.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration space. We develop new cluster algorithms and design classes of models for fermions coupled to $\mathbb{Z}_2$ and $U(1)$ gauge fields that are amenable to being simulated by these cluster algorithms in a sign-problem free way. Such simulations should contain rich phase diagrams and are particularly relevant for quantum simulator experiments.

Related papers

• A simulation study of cluster search algorithms in data set generated by Gaussian mixture models [0.0]
  This study examines centroid- and model-based cluster search algorithms in various cases that Gaussian mixture models (GMMs) can generate. The results show that some cluster-splitting criteria based on Euclidean distance make unreasonable decisions when clusters overlap.
  arXiv  Detail & Related papers  (2024-07-27T07:47:25Z)
• A Modular Spatial Clustering Algorithm with Noise Specification [0.0]
  Bacteria-Farm algorithm is inspired by the growth of bacteria in closed experimental farms. In contrast with other clustering algorithms, our algorithm also has a provision to specify the amount of noise to be excluded during clustering.
  arXiv  Detail & Related papers  (2023-09-18T18:05:06Z)
• Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model [79.46465138631592]
  We devise an efficient algorithm that recovers clusters using the observed labels. We present Instance-Adaptive Clustering (IAC), the first algorithm whose performance matches these lower bounds both in expectation and with high probability.
  arXiv  Detail & Related papers  (2023-06-18T08:46:06Z)
• Quantum Monte Carlo for Gauge Fields and Matter without the Fermion Determinant [0.0]
  Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem. We focus on the meron cluster algorithm, which can solve the fermion sign problem in a class of models without involving the determinant.
  arXiv  Detail & Related papers  (2023-05-15T18:00:08Z)
• Aspects of scaling and scalability for flow-based sampling of lattice QCD [137.23107300589385]
  Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. It remains to be determined whether they can be applied to state-of-the-art lattice quantum chromodynamics calculations.
  arXiv  Detail & Related papers  (2022-11-14T17:07:37Z)
• A Non-Parametric Bootstrap for Spectral Clustering [0.7673339435080445]
  We develop two novel algorithms that incorporate the spectral decomposition of the data matrix and a non-parametric bootstrap sampling scheme. Our techniques are more consistent in their convergence when compared to other bootstrapped algorithms that fit finite mixture models.
  arXiv  Detail & Related papers  (2022-09-13T08:37:05Z)
• Personalized Federated Learning via Convex Clustering [72.15857783681658]
  We propose a family of algorithms for personalized federated learning with locally convex user costs. The proposed framework is based on a generalization of convex clustering in which the differences between different users' models are penalized.
  arXiv  Detail & Related papers  (2022-02-01T19:25:31Z)
• Lattice-Based Methods Surpass Sum-of-Squares in Clustering [98.46302040220395]
  Clustering is a fundamental primitive in unsupervised learning. Recent work has established lower bounds against the class of low-degree methods. We show that, perhaps surprisingly, this particular clustering model textitdoes not exhibit a statistical-to-computational gap.
  arXiv  Detail & Related papers  (2021-12-07T18:50:17Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Optimal Clustering in Anisotropic Gaussian Mixture Models [3.5590836605011047]
  We study the clustering task under anisotropic Gaussian Mixture Models. We characterize the dependence of signal-to-noise ratios on the cluster centers.
  arXiv  Detail & Related papers  (2021-01-14T00:31:52Z)
• Learning Gaussian Graphical Models via Multiplicative Weights [54.252053139374205]
  We adapt an algorithm of Klivans and Meka based on the method of multiplicative weight updates. The algorithm enjoys a sample complexity bound that is qualitatively similar to others in the literature. It has a low runtime $O(mp2)$ in the case of $m$ samples and $p$ nodes, and can trivially be implemented in an online manner.
  arXiv  Detail & Related papers  (2020-02-20T10:50:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.