Related papers: Matrix Product Operators, Matrix Product States, a…

In this paper, we propose a modified Density Matrix Renormalization Group (DMRG) algorithm to preferentially select minimum entropy states (minimally entangled states) in finite systems with asymptotic ground state degeneracy. The algorithm…

We introduce a hybrid approach to applying the density matrix renormalization group (DMRG) to continuous systems, combining a grid approximation along one direction with a finite Gaussian basis set along the remaining two directions. This…

The deep neural network (DNN) based speech enhancement approaches have achieved promising performance. However, the number of parameters involved in these methods is usually enormous for the real applications of speech enhancement on the…

We reformulate the density matrix renormalization group method (DMRG) in terms of a single block, instead of the standard left and right blocks used in the construction of the superblock. This version of the DMRG, which we call the puncture…

A new density matrix renormalisation group (DMRG) approach is presented for quantum systems of two spatial dimensions. In particular, it is shown that it is possible to create a multi-chain-type 2D DMRG approach which utilises previously…

Materialisation precomputes all consequences of a set of facts and a datalog program so that queries can be evaluated directly (i.e., independently from the program). Rewriting optimises materialisation for datalog programs with equality by…

The generic matrix multiply (GEMM) function is the core element of high-performance linear algebra libraries used in many computationally-demanding digital signal processing (DSP) systems. We propose an acceleration technique for GEMM based…

Matrix reordering is a task to permute the rows and columns of a given observed matrix such that the resulting reordered matrix shows meaningful or interpretable structural patterns. Most existing matrix reordering techniques share the…

In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…

The accurate assembly of the system matrix is an important step in any code that solves partial differential equations on a mesh. We either explicitly set up a matrix, or we work in a matrix-free environment where we have to be able to…

Automatic Differentiation (AD) has become a dominant technique in ML. AD frameworks have first been implemented for imperative languages using tapes. Meanwhile, functional implementations of AD have been developed, often based on dual…

The infinite Density Matrix Renormalisation Group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems, and is also frequently used to initialise the more popular finite DMRG…

We quantify how well matrix product states approximate exact ground states of 1-D quantum spin systems as a function of the number of spins and the entropy of blocks of spins. We also investigate the convex set of local reduced density…

Physical systems differring in their microscopic details often display strikingly similar behaviour when probed at macroscopic scales. Those universal properties, largely determining their physical characteristics, are revealed by the…

Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup for low precision arithmetic. In light of this, we propose…

We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the…

We present a matrix-product state (MPS)-based quadratically convergent density-matrix renormalization group self-consistent-field (DMRG-SCF) approach. Following a proposal by Werner and Knowles (JCP 82, 5053, (1985)), our DMRG-SCF algorithm…

In these lecture notes, we present a pedagogical review of a number of related {\it numerically exact} approaches to quantum many-body problems. In particular, we focus on methods based on the exact diagonalization of the Hamiltonian matrix…

The DMRG method is very effective at finding ground states of 1D quantum systems in practice, but it is a heuristic method, and there is no known proof for when it works. In this paper we describe an efficient classical algorithm which…

We present the Copupled Cluster (CC) method and the Density matrix Renormalization Grooup (DMRG) method in a unified way, from the perspective of recent developments in tensor product approximation. We present an introduction into recently…