Performance of the rigorous renormalization group for first order phase transitions and topological phases

• URL: http://arxiv.org/abs/2010.15851v2
• Date: Sun, 26 Sep 2021 04:56:49 GMT
• Title: Performance of the rigorous renormalization group for first order phase transitions and topological phases
• Authors: Maxwell Block, Johannes Motruk, Snir Gazit, Michael P. Zaletel, Zeph Landau, Umesh Vazirani, Norman Y. Yao
• Abstract summary: The density matrix renormalization group (DMRG) has been established as a practically useful algorithm for finding the ground state in 1D systems. We study the accuracy and performance of a numerical implementation of RRG at first order phase transitions and in symmetry protected topological phases.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Expanding and improving the repertoire of numerical methods for studying quantum lattice models is an ongoing focus in many-body physics. While the density matrix renormalization group (DMRG) has been established as a practically useful algorithm for finding the ground state in 1D systems, a provably efficient and accurate algorithm remained elusive until the introduction of the rigorous renormalization group (RRG) by Landau et al. [Nature Physics 11, 566 (2015)]. In this paper, we study the accuracy and performance of a numerical implementation of RRG at first order phase transitions and in symmetry protected topological phases. Our study is motived by the question of when RRG might provide a useful complement to the more established DMRG technique. In particular, despite its general utility, DMRG can give unreliable results near first order phase transitions and in topological phases, since its local update procedure can fail to adequately explore (near) degenerate manifolds. The rigorous theoretical underpinnings of RRG, meanwhile, suggest that it should not suffer from the same difficulties. We show this optimism is justified, and that RRG indeed determines accurate, well-ordered energies even when DMRG does not. Moreover, our performance analysis indicates that in certain circumstances seeding DMRG with states determined by coarse runs of RRG may provide an advantage over simply performing DMRG.

Related papers

• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Implicit Bias of Gradient Descent for Logistic Regression at the Edge of Stability [69.01076284478151]
  In machine learning optimization, gradient descent (GD) often operates at the edge of stability (EoS) This paper studies the convergence and implicit bias of constant-stepsize GD for logistic regression on linearly separable data in the EoS regime.
  arXiv  Detail & Related papers  (2023-05-19T16:24:47Z)
• DynGFN: Towards Bayesian Inference of Gene Regulatory Networks with GFlowNets [81.75973217676986]
  Gene regulatory networks (GRN) describe interactions between genes and their products that control gene expression and cellular function. Existing methods either focus on challenge (1), identifying cyclic structure from dynamics, or on challenge (2) learning complex Bayesian posteriors over DAGs, but not both. In this paper we leverage the fact that it is possible to estimate the "velocity" of gene expression with RNA velocity techniques to develop an approach that addresses both challenges.
  arXiv  Detail & Related papers  (2023-02-08T16:36:40Z)
• From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent [50.4531316289086]
  Gradient Descent (SGD) has been the method of choice for learning large-scale non-root models. An overarching paper is providing general conditions SGD converges, assuming that GF on the population loss converges. We provide a unified analysis for GD/SGD not only for classical settings like convex losses, but also for more complex problems including Retrieval Matrix sq-root.
  arXiv  Detail & Related papers  (2022-10-13T03:55:04Z)
• Circulating Genuine Multiparty Entanglement in Quantum Network [0.0]
  We propose a scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size. We prove that the generalized geometric measure (GGM) of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. We show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians.
  arXiv  Detail & Related papers  (2021-12-19T11:26:16Z)
• Stochastic Reweighted Gradient Descent [4.355567556995855]
  We propose an importance-sampling-based algorithm we call SRG (stochastic reweighted gradient) We pay particular attention to the time and memory overhead of our proposed method. We present empirical results to support our findings.
  arXiv  Detail & Related papers  (2021-03-23T04:09:43Z)
• Uncomputably Complex Renormalisation Group Flows [0.0]
  We show that important physical properties of quantum many-body systems, such as its spectral gap and phase diagram, can be uncomputable. The structure of such uncomputable RG flows is so complex that it cannot be computed or approximated, even in principle.
  arXiv  Detail & Related papers  (2021-02-09T21:46:55Z)
• Direction Matters: On the Implicit Bias of Stochastic Gradient Descent with Moderate Learning Rate [105.62979485062756]
  This paper attempts to characterize the particular regularization effect of SGD in the moderate learning rate regime. We show that SGD converges along the large eigenvalue directions of the data matrix, while GD goes after the small eigenvalue directions.
  arXiv  Detail & Related papers  (2020-11-04T21:07:52Z)
• Orbital MCMC [82.54438698903775]
  We propose two practical algorithms for constructing periodic orbits from any diffeomorphism. We also perform an empirical study demonstrating the practical advantages of both kernels.
  arXiv  Detail & Related papers  (2020-10-15T22:25:52Z)
• Analysis of a density matrix renormalization group approach for transport in open quantum systems [0.0]
  Density matrix renormalization group-based tools have been widely used in the study of closed systems. We present an implementation based on state-of-the-art matrix product state (MPS) and tensor network methods. We show that this implementation is suited for studying thermal transport in one-dimensional systems.
  arXiv  Detail & Related papers  (2020-09-17T10:37:49Z)
• Transcorrelated Density Matrix Renormalization Group [0.0]
  We introduce the transcorrelated Density Matrix Renormalization Group (tcDMRG) theory for the efficient approximation of the energy for strongly correlated systems. tcDMRG encodes the wave function as a product of a fixed Jastrow or Gutzwiller correlator and a matrix product state. We demonstrate fast energy convergence of tcDMRG, which indicates that tcDMRG could increase the efficiency of standard DMRG beyond quasi-monodimensional systems.
  arXiv  Detail & Related papers  (2020-09-05T23:20:14Z)

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.