Transcorrelated Density Matrix Renormalization Group

• URL: http://arxiv.org/abs/2009.02614v3
• Date: Mon, 2 Nov 2020 16:19:27 GMT
• Title: Transcorrelated Density Matrix Renormalization Group
• Authors: Alberto Baiardi and Markus Reiher
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. The latter is optimized by applying the imaginary-time variant of time-dependent (TD) DMRG to the non-Hermitian transcorrelated Hamiltonian. We demonstrate the efficiency of tcDMRG at the example of the two-dimensional Fermi-Hubbard Hamiltonian, a notoriously difficult target for the DMRG algorithm, for different sizes, occupation numbers, and interaction strengths. We demonstrate fast energy convergence of tcDMRG, which indicates that tcDMRG could increase the efficiency of standard DMRG beyond quasi-monodimensional systems and provides a generally powerful approach toward the dynamic correlation problem of DMRG.

Related papers

• Probing universal critical scaling with scan-DMRG [0.0]
  We present high-quality data collapses for the order parameter and for the entanglement entropy for three minimal models. We show that scan-DMRG successfully captures the universal critical scaling when applied across the magnetic Wess-Zumino-Witten and non-magnetic Ising transitions in the frustrated Haldane chain.
  arXiv  Detail & Related papers  (2024-06-24T12:34:40Z)
• Binarized Diffusion Model for Image Super-Resolution [61.963833405167875]
  Binarization, an ultra-compression algorithm, offers the potential for effectively accelerating advanced diffusion models (DMs) Existing binarization methods result in significant performance degradation. We introduce a novel binarized diffusion model, BI-DiffSR, for image SR.
  arXiv  Detail & Related papers  (2024-06-09T10:30:25Z)
• Augmenting Density Matrix Renormalization Group with Clifford Circuits [0.49157446832511503]
  We present the seamless integration of Clifford circuits within the Density Matrix Renormalization Group algorithm. This framework is useful not only for its current application but also for its potential to be easily adapted to various other numerical approaches.
  arXiv  Detail & Related papers  (2024-05-15T09:53:08Z)
• Intelligent Hybrid Resource Allocation in MEC-assisted RAN Slicing Network [72.2456220035229]
  We aim to maximize the SSR for heterogeneous service demands in the cooperative MEC-assisted RAN slicing system. We propose a recurrent graph reinforcement learning (RGRL) algorithm to intelligently learn the optimal hybrid RA policy.
  arXiv  Detail & Related papers  (2024-05-02T01:36:13Z)
• Tensor network renormalization: application to dynamic correlation functions and non-hermitian systems [0.0]
  We present the implementation of the Loop-TNR algorithm, which allows for the computation of dynamical correlation functions. We highlight that the Loop-TNR algorithm can also be applied to investigate critical properties of non-Hermitian systems.
  arXiv  Detail & Related papers  (2023-11-30T18:34:32Z)
• Active RIS-aided EH-NOMA Networks: A Deep Reinforcement Learning Approach [66.53364438507208]
  An active reconfigurable intelligent surface (RIS)-aided multi-user downlink communication system is investigated. Non-orthogonal multiple access (NOMA) is employed to improve spectral efficiency, and the active RIS is powered by energy harvesting (EH) An advanced LSTM based algorithm is developed to predict users' dynamic communication state. A DDPG based algorithm is proposed to joint control the amplification matrix and phase shift matrix RIS.
  arXiv  Detail & Related papers  (2023-04-11T13:16:28Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Bond-weighted Tensor Renormalization Group [0.0]
  We propose an improved tensor renormalization group (TRG) algorithm, the bond-weighted TRG (BTRG) We show that BTRG outperforms the conventional TRG and the higher-order tensor renormalization group with the same bond dimension.
  arXiv  Detail & Related papers  (2020-11-03T13:08:54Z)
• Performance of the rigorous renormalization group for first order phase transitions and topological phases [0.0]
  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.
  arXiv  Detail & Related papers  (2020-10-29T18:00:07Z)
• Lightweight, Dynamic Graph Convolutional Networks for AMR-to-Text Generation [56.73834525802723]
  Lightweight Dynamic Graph Convolutional Networks (LDGCNs) are proposed. LDGCNs capture richer non-local interactions by synthesizing higher order information from the input graphs. We develop two novel parameter saving strategies based on the group graph convolutions and weight tied convolutions to reduce memory usage and model complexity.
  arXiv  Detail & Related papers  (2020-10-09T06:03:46Z)
• Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM [52.12831959365598]
  We propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored and Quantized Generalized GADMM, leverages the worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM) Numerical simulations corroborate that CQ-GGADMM exhibits higher communication efficiency in terms of the number of communication rounds and transmit energy consumption without compromising the accuracy and convergence speed.
  arXiv  Detail & Related papers  (2020-09-14T14:18:19Z)

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.