Related papers: Local Matrix Product Operators: Canonical Form, Co…
Continuous Matrix Product States (cMPS) are powerful variational ansatz states for ground states of continuous quantum field theories in (1+1) dimension. In this paper we introduce a novel parametrization of the cMPS wave function based on…
To compute approximate solutions for combinatorial optimization problems, we describe variational methods based on the product state (PS) and matrix product state (MPS) ansatzes. We perform variational energy minimization with respect to a…
We improve the convergence of the Lanczos algorithm using the matrix product state representation. As an alternative to the density matrix renormalization group (DMRG), the Lanczos algorithm avoids local minima and can directly find…
Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function…
We show how to construct relevant families of matrix product operators in one and higher dimensions. Those form the building blocks for the numerical simulation methods based on matrix product states and projected entangled pair states. In…
In this paper, we propose a general algorithmic framework to solve a class of optimization problems on the product of complex Stiefel manifolds based on the matrix polar decomposition. We establish the weak convergence, global convergence…
Systems of correlated quantum matter can be a steep challenge to any would-be method of solution. Matrix-product state (MPS)-based methods can describe 1D systems quasiexactly, but often struggle to retain sufficient bipartite entanglement…
Current descriptions of the ab initio DMRG algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix…
Matrix product state (MPS) offers a framework for encoding classical data into quantum states, enabling the efficient utilization of quantum resources for data representation and processing. This research paper investigates techniques to…
We present a tensorization algorithm for constructing tensor train/matrix product state (MPS) representations of functions, drawing on sketching and cross interpolation ideas. The method only requires black-box access to the target function…
We present a matrix product operator construction that allows us to represent the lattice Hamiltonians of (abelian or non-abelian) gauge theories in a local and manifestly translation-invariant form. In particular, we use symmetric matrix…
Approaching the long-time dynamics of non-Markovian open quantum systems presents a challenging task if the bath is strongly coupled. Recent proposals address this problem through a representation of the so-called process tensor in terms of…
The ground state energy and the free energy of Quantum Local Hamiltonians are fundamental quantities in quantum many-body physics, however, it is QMA-Hard to estimate them in general. In this paper, we develop new techniques to find…
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…
Incorporating conservation laws explicitly into matrix product states (MPS) has proven to make numerical simulations of quantum many-body systems much less resources consuming. We will discuss here, to what extent this concept can be used…
Tensor networks such as matrix product states (MPS) and projected entangled pair states (PEPS) are commonly used to approximate quantum systems. These networks are optimized in methods such as DMRG or evolved by local operators. We provide…
We reconstruct a matrix product state (MPS) in reduced spaces using density matrix. This scheme applies to a MPS built on a blocked quantum lattice. Each block contains $N$ physical sites that have a local space of rank $R$. The simulation…
Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group $S_n$ is a challenging problem known to be $\#P$-hard in the worst case. Here we describe a…
We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of…
We investigate the application of matrix product states to the Hubbard model in one spatial dimension with both of open and periodic boundary conditions. We develop the variatinal method that the optimization of the variational parameters…