Cluster truncated Wigner approximation for bond-disordered Heisenberg spin models

• URL: http://arxiv.org/abs/2407.01682v1
• Date: Mon, 1 Jul 2024 18:00:06 GMT
• Title: Cluster truncated Wigner approximation for bond-disordered Heisenberg spin models
• Authors: Adrian Braemer, Javad Vahedi, Martin Gärttner,
• Abstract summary: Cluster Truncated Wigner Approximation (cTWA) applied to quench dynamics in bond-disordered Heisenberg spin chains with power-law interactions. We develop a discrete sampling scheme for the initial Wigner function, as an alternative to the originally introduced scheme based on Gaussian approximations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a comprehensive numerical investigation of the cluster Truncated Wigner Approximation (cTWA) applied to quench dynamics in bond-disordered Heisenberg spin chains with power-law interactions. We find that cTWA yields highly accurate results over a wide parameter range. However, its accuracy hinges on a suitable choice of clusters. By using a clustering strategy inspired by the strong disorder renormalisation group (SDRG)/real-space renormalization group (RSRG), clusters of two spins are sufficient to obtain essentially exact results in the regime of strong disorder. Surprisingly, even for rather weak disorder, e.g.\ in the presence of very long-range interactions, this choice of clustering outperforms a naive choice of clusters of consecutive spins. Additionally, we develop a discrete sampling scheme for the initial Wigner function, as an alternative to the originally introduced scheme based on Gaussian approximations. This sampling scheme puts cTWA on the same conceptional footing as regular dTWA for single spins and yields some reduction in the Monte Carlo shot noise compared to the Gaussian scheme.

Related papers

• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• The role of gaps in digitized counterdiabatic QAOA for fully-connected spin models [0.0]
  CD corrections to the quantum approximate optimization algorithm (QAOA) have been proposed, yielding faster convergence within the desired accuracy than standard QAOA. We show that the performances of the algorithm are related to the spectral properties of the instances analyzed.
  arXiv  Detail & Related papers  (2024-09-05T13:17:56Z)
• Matrix-product-state-based band-Lanczos solver for quantum cluster approaches [0.0]
  We present a matrix-product state (MPS) based band-Lanczos method as solver for quantum cluster methods. We show that our approach makes it possible to treat cluster geometries well beyond the reach of exact diagonalization methods.
  arXiv  Detail & Related papers  (2023-10-16T19:59:21Z)
• Partitioning-Guided K-Means: Extreme Empty Cluster Resolution for Extreme Model Compression [0.17188280334580192]
  We consider Iterative Product Quantization (iPQ) with Quant-Noise to be state-of-the-art in this area. iPQ with Quant-Noise suffers from preventable inference quality degradation due to prevalent empty clusters. We propose several novel enhancements aiming to improve the accuracy of iPQ with Quant-Noise by focusing on resolving empty clusters.
  arXiv  Detail & Related papers  (2023-06-24T18:19:29Z)
• 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)
• Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints [7.936519714074615]
  The Kaczmarz matrix (KZ) and its variants have been extensively studied due to their simplicity and efficiency in solving sub linear equation systems. We provide the first theoretical convergence guarantees for KHT by showing that it converges linearly to the solution of a system with sparsity constraints.
  arXiv  Detail & Related papers  (2023-04-20T07:14:24Z)
• Tight integration of neural- and clustering-based diarization through deep unfolding of infinite Gaussian mixture model [84.57667267657382]
  This paper introduces a it trainable clustering algorithm into the integration framework. Speaker embeddings are optimized during training such that it better fits iGMM clustering. Experimental results show that the proposed approach outperforms the conventional approach in terms of diarization error rate.
  arXiv  Detail & Related papers  (2022-02-14T07:45:21Z)
• 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)
• Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond [63.59034509960994]
  We study shuffling-based variants: minibatch and local Random Reshuffling, which draw gradients without replacement. For smooth functions satisfying the Polyak-Lojasiewicz condition, we obtain convergence bounds which show that these shuffling-based variants converge faster than their with-replacement counterparts. We propose an algorithmic modification called synchronized shuffling that leads to convergence rates faster than our lower bounds in near-homogeneous settings.
  arXiv  Detail & Related papers  (2021-10-20T02:25:25Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)

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.