Related papers: The computational difficulty of finding MPS ground…
We define a new family of matrix product states which are exact ground states of spin 1/2 Hamiltonians on one dimensional lattices. This class of Hamiltonians contain both Heisenberg and Dzyaloshinskii-Moriya interactions but at specified…
We extend the formalism of Matrix Product States (MPS) to describe one-dimensional gapped systems of fermions with both unitary and anti-unitary symmetries. Additionally, systems with orientation-reversing spatial symmetries are considered.…
This paper introduces matrix product state (MPS) decomposition as a new and systematic method to compress multidimensional data represented by higher-order tensors. It solves two major bottlenecks in tensor compression: computation and…
We derive an exact formula for a matrix product state (MPS) representation (or a PEPS in higher number of dimensions) of the ground state of translationally invariant bosonic lattice systems in terms of a single one-dimensional Euclidean…
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently…
Common wisdom says that the entanglement of fermionic systems can be low in the second quantization formalism but is extremely large in the first quantization. Hence Matrix Product State (MPS) methods based on moderate entanglement have…
Tensor networks, which are originally developed for characterizing complex quantum many-body systems, have recently emerged as a powerful framework for capturing high-dimensional probability distributions with strong physical…
We prove that generic quantum local Hamiltonians are gapless. In fact, we prove that there is a continuous density of states above the ground state. The Hamiltonian can be on a lattice in any spatial dimension or on a graph with a bounded…
The matrix product state (MPS) is utilized to study the ground state properties and quantum phase transitions (QPTs) of the one-dimensional quantum compass model (QCM). The MPS wavefunctions are argued to be very efficient descriptions of…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
We present a new generic approach to the condensed-matter ground-state problem which is complementary to variational techniques and works directly in the thermodynamic limit. Relaxing the ground-state problem, we obtain semidefinite…
Matrix Product Operators (MPOs) are at the heart of the second-generation Density Matrix Renormalisation Group (DMRG) algorithm formulated in Matrix Product State language. We first summarise the widely known facts on MPO arithmetic and…
We describe a simple method to find the ground state energy without calculating the expectation value of the Hamiltonian in the time-evolving block decimation algorithm with tensor network states. For example, we consider quantum…
In the era of noisy, intermediate-scale quantum (NISQ) devices, the efficient preparation of many-body resource states is a task of paramount importance. In this paper we focus on the deterministic preparation of matrix-product states (MPS)…
This article investigates the stability of the ground state subspace of a canonical parent Hamiltonian of a Matrix product state against local perturbations. We prove that the spectral gap of such a Hamiltonian remains stable under weak…
There has been a problem of gauge ambiguities with the Rabi Hamiltonian due to the fact that it can be derived from two formally different but physically equivalent fundamental Hamiltonians. This problem has recently been resolved for…
We show how to generalize the concepts of identifying and classifying symmetry protected topological phases in 1D to the case of an arbitrary mixed state. The pure state concepts are reviewed using a concrete spin-1 model. For the mixed…
We present an implementation of an efficient algorithm for the calculation of the spectrum of one-dimensional quantum systems with periodic boundary conditions. This algorithm is based on a matrix product representation for quantum states…
A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively.…
The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix…