Digitising SU(2) Gauge Fields and the Freezing Transition

• URL: http://arxiv.org/abs/2201.09625v1
• Date: Mon, 24 Jan 2022 12:09:09 GMT
• Title: Digitising SU(2) Gauge Fields and the Freezing Transition
• Authors: Tobias Hartung, Timo Jakobs, Karl Jansen, Johann Ostmeyer, Carsten Urbach
• Abstract summary: For any Lie group other than U$(1)$, there is no class ofally dense discrete subgroups. Discretisations limited to subgroups are bound to lead to freezing of Monte Carlo simulations at weak couplings. A generalised version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient discretisations of gauge groups are crucial with the long term perspective of using tensor networks or quantum computers for lattice gauge theory simulations. For any Lie group other than U$(1)$, however, there is no class of asymptotically dense discrete subgroups. Therefore, discretisations limited to subgroups are bound to lead to a freezing of Monte Carlo simulations at weak couplings, necessitating alternative partitionings without a group structure. In this work we provide a comprehensive analysis of this freezing for all discrete subgroups of SU$(2)$ and different classes of asymptotically dense subsets. We find that an appropriate choice of the subset allows unfrozen simulations for arbitrary couplings, though one has to be careful with varying weights of unevenly distributed points. A generalised version of the Fibonacci spiral appears to be particularly efficient and close to optimal.

Related papers

• Digitizing SU(2) Gauge Fields and What to Look Out for When Doing So [0.0]
  We present our results for a handful of discretization approaches for the non-trivial example of SU(2). A generalized version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
  arXiv  Detail & Related papers  (2022-12-19T14:31:47Z)
• Gluon Digitization via Character Expansion for Quantum Computers [0.0]
  Scheme based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.
  arXiv  Detail & Related papers  (2022-03-04T14:12:52Z)
• Optimal Clustering with Bandit Feedback [57.672609011609886]
  This paper considers the problem of online clustering with bandit feedback. It includes a novel stopping rule for sequential testing that circumvents the need to solve any NP-hard weighted clustering problem as its subroutines. We show through extensive simulations on synthetic and real-world datasets that BOC's performance matches the lower boundally, and significantly outperforms a non-adaptive baseline algorithm.
  arXiv  Detail & Related papers  (2022-02-09T06:05:05Z)
• 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)
• Local versions of sum-of-norms clustering [77.34726150561087]
  We show that our method can separate arbitrarily close balls in the ball model. We prove a quantitative bound on the error incurred in the clustering of disjoint connected sets.
  arXiv  Detail & Related papers  (2021-09-20T14:45:29Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• On the universal constraints for relaxation rates for quantum dynamical semigroup [0.0]
  A conjecture for the universal constraints for relaxation rates of a quantum dynamical semigroup is proposed. It holds for several interesting classes of semigroups, e.g. unital semigroups and semigroups derived in the weak coupling limit from the proper microscopic model.
  arXiv  Detail & Related papers  (2020-11-20T00:40:13Z)
• Computationally efficient sparse clustering [67.95910835079825]
  We provide a finite sample analysis of a new clustering algorithm based on PCA. We show that it achieves the minimax optimal misclustering rate in the regime $|theta infty$.
  arXiv  Detail & Related papers  (2020-05-21T17:51:30Z)
• Efficient Clustering for Stretched Mixtures: Landscape and Optimality [4.2111286819721485]
  This paper considers a canonical clustering problem where one receives unlabeled samples drawn from a balanced mixture of two elliptical distributions. We show that the non-optimal clustering function exhibits desirable geometric properties when the sample size exceeds some constant statistical objectives.
  arXiv  Detail & Related papers  (2020-03-22T17:57:07Z)
• Statistical power for cluster analysis [0.0]
  Cluster algorithms are increasingly popular in biomedical research. We estimate power and accuracy for common analysis through simulation. We recommend that researchers only apply cluster analysis when large subgroup separation is expected.
  arXiv  Detail & Related papers  (2020-03-01T02:43:15Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

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.