Related papers: Analysis of a density matrix renormalization group approach for transport in open quantum systems

Analysis of a density matrix renormalization group approach for transport in open quantum systems

URL: http://arxiv.org/abs/2009.08200v1
Date: Thu, 17 Sep 2020 10:37:49 GMT
Title: Analysis of a density matrix renormalization group approach for transport in open quantum systems
Authors: Heitor P. Casagrande, Dario Poletti, Gabriel T. Landi
Abstract summary: 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.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Understanding the intricate properties of one-dimensional quantum systems coupled to multiple reservoirs poses a challenge to both analytical approaches and simulation techniques. Fortunately, density matrix renormalization group-based tools, which have been widely used in the study of closed systems, have also been recently extended to the treatment of open systems. We present an implementation of such method based on state-of-the-art matrix product state (MPS) and tensor network methods, that produces accurate results for a variety of combinations of parameters. Unlike most approaches, which use the time-evolution to reach the steady-state, we focus on an algorithm that is time-independent and focuses on recasting the problem in exactly the same language as the standard Density Matrix Renormalization Group (DMRG) algorithm, initially put forward by M. C. Ba\~nuls et al. in Phys. Rev. Lett. 114, 220601 (2015). Hence, it can be readily exported to any of the available DMRG platforms. We show that this implementation is suited for studying thermal transport in one-dimensional systems. As a case study, we focus on the XXZ quantum spin chain and benchmark our results by comparing the spin current and magnetization profiles with analytical results. We then explore beyond what can be computed analytically. Our code is freely available on github at https://www.github.com/heitorc7/oDMRG.

Related papers

Harmonic Path Integral Diffusion [0.4527270266697462]
We present a novel approach for sampling from a continuous multivariate probability distribution. Our method constructs a time-dependent bridge from a delta function centered at the origin of the state space.
arXiv Detail & Related papers (2024-09-23T16:20:21Z)
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)
Large-scale gradient-based training of Mixtures of Factor Analyzers [67.21722742907981]
This article contributes both a theoretical analysis as well as a new method for efficient high-dimensional training by gradient descent. We prove that MFA training and inference/sampling can be performed based on precision matrices, which does not require matrix inversions after training is completed. Besides the theoretical analysis and matrices, we apply MFA to typical image datasets such as SVHN and MNIST, and demonstrate the ability to perform sample generation and outlier detection.
arXiv Detail & Related papers (2023-08-26T06:12:33Z)
GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z)
Matrix Product Renormalization Group: Potential Universal Quantum Many-Body Solver [0.0]
We propose an improved formulation of continuous tensor network algorithms, which we name a matrix product renormalization group (MPRG) MPRG is a universal quantum many-body solver, which potentially works at both zero and finite temperatures, in two and higher dimensions, and is even applicable to open quantum systems.
arXiv Detail & Related papers (2022-12-26T19:00:01Z)
A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity [3.965473736150699]
We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. For small circuit depths, the technique is exact and equivalent to other matrix product state (MPS) based techniques.
arXiv Detail & Related papers (2022-07-12T15:28:55Z)
Self-supervised Symmetric Nonnegative Matrix Factorization [82.59905231819685]
Symmetric nonnegative factor matrix (SNMF) has demonstrated to be a powerful method for data clustering. Inspired by ensemble clustering that aims to seek better clustering results, we propose self-supervised SNMF (S$3$NMF) We take advantage of the sensitivity to code characteristic of SNMF, without relying on any additional information.
arXiv Detail & Related papers (2021-03-02T12:47:40Z)
Beating the House: Fast Simulation of Dissipative Quantum Systems with Ensemble Rank Truncation [0.0]
We introduce a new technique for the simulation of dissipative quantum systems. This method is composed of an approximate decomposition of the Lindblad equation into a Kraus map. We find that in the regime of weak coupling, this method is able to outperform existing wavefunction Monte-Carlo methods by an order of magnitude in both accuracy and speed.
arXiv Detail & Related papers (2020-10-12T02:01:27Z)
Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge Computing [113.52575069030192]
Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones and vehicles. Due to the limitations of communication costs and security requirements, it is of paramount importance to extract information in a decentralized manner instead of aggregating data to a fusion center. We consider the problem of learning model parameters in a multi-agent system with data locally processed via distributed edge nodes. A class of mini-batch alternating direction method of multipliers (ADMM) algorithms is explored to develop the distributed learning model.
arXiv Detail & Related papers (2020-10-02T10:41:59Z)
Kernel learning approaches for summarising and combining posterior similarity matrices [68.8204255655161]
We build upon the notion of the posterior similarity matrix (PSM) in order to suggest new approaches for summarising the output of MCMC algorithms for Bayesian clustering models. A key contribution of our work is the observation that PSMs are positive semi-definite, and hence can be used to define probabilistically-motivated kernel matrices.
arXiv Detail & Related papers (2020-09-27T14:16:14Z)
A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z)

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