Related papers: Density Matrix Recursion Method: Genuine Multisite…
We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…
We present an iterative method to reconstruct the linear-theory initial conditions from the late-time cosmological matter density field, with the intent of improving the recovery of the cosmic distance scale from the baryon acoustic…
We investigate quantum phase transitions in ladders of spin 1/2 particles by engineering suitable matrix product states for these ladders. We take into account both discrete and continuous symmetries and provide general classes of such…
Random sequential adsorption (RSA) models have been studied due to their relevance to deposition processes on surfaces. The depositing particles are represented by hard-core extended objects; they are not allowed to overlap. Numerical Monte…
We study the genuine multipartite entanglement of arbitrary $n$-partite quantum states by representing the density matrices in terms of the generalized Pauli operators. We introduce a general framework for detecting genuine multipartite…
Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…
We propose a convex variational approach to compute localized density matrices for both zero temperature and finite temperature cases, by adding an entry-wise $\ell_1$ regularization to the free energy of the quantum system. Based on the…
In this work, we explore a numerical approach for performing the inverse Laplace transformation, with an emphasis on achieving stability and robustness under noisy conditions. Our quadrature-based method integrates reparameterization, data…
Quantum embedding methods enable the study of large, strongly correlated quantum systems by (usually self-consistent) decomposition into computationally manageable subproblems, in the spirit of divide-and-conquer methods. Among these,…
We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each…
An exact result for the reduced density matrix on a finite interval for a $1+1$ dimensional free real scalar field in the ground state is presented. In the massless case, the Williamson decomposition of the appearing kernels is explicitly…
Strongly correlated electron systems are challenging to calculate, and entanglement in such systems is not widely analyzed. We present an approach that can be used as a post-processing step for calculating the two-site reduced density…
We review the variational principle in the density matrix renormalization group (DMRG) method, which maximizes an approximate partition function within a restricted degrees of freedom; at zero temperature, DMRG mini- mizes the ground state…
Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in lattice-based models. Here, we develop a formalism based on interacting binary tensors that allows for tackling…
The accurate detection of small deviations in given density matrices is important for quantum information processing. Here we propose a new method based on the concept of data mining. We demonstrate that the proposed method can more…
We use a recently developed lattice model to study the percolation of particles of different sizes and shapes in the presence of a polymer matrix. The polymer is modeled as an infinitely long semiflexible chain. We study the effects of the…
A general elliptic $N\times N$ matrix Lax scheme is presented, leading to two classes of elliptic lattice systems, one which we interpret as the higher-rank analogue of the Landau-Lifschitz equations, while the other class we characterize…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
We study the robust matrix completion problem for the low-rank Hankel matrix, which detects the sparse corruptions caused by extreme outliers while we try to recover the original Hankel matrix from the partial observation. In this paper, we…