Related papers: Matrix product state algorithms for Gaussian fermi…
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…
Numerical simulations are a powerful tool to study quantum systems beyond exactly solvable systems lacking an analytic expression. For one-dimensional entangled quantum systems, tensor network methods, amongst them Matrix Product States…
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…
Gaussian fermionic matrix product states (GfMPS) form a class of ansatz quantum states for 1d systems of noninteracting fermions. We show, for a simple critical model of free hopping fermions, that: (i) any GfMPS approximation to its ground…
Modeling open quantum systems -- quantum systems coupled to a bath -- is of value in condensed matter theory, cavity quantum electrodynamics, nanosciences and biophysics. The real-time simulation of open quantum systems was advanced…
Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems,…
This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the…
In many approximate approaches to fermionic quantum many-body systems, such as Hartree-Fock and density functional theory, solving a system of non-interacting fermions coupled to some effective potential is the computational bottleneck. In…
Solving interacting fermionic quantum many-body problems as they are ubiquitous in quantum chemistry and materials science is a central task of theoretical and numerical physics, a task that can commonly only be addressed in the sense of…
Fermionic Gaussian states are eigenstates of quadratic Hamiltonians and are widely used in quantum many-body problems. We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be…
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor…
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be…
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…
The density-matrix renormalization group method has become a standard computational approach to the low-energy physics as well as dynamics of low-dimensional quantum systems. In this paper, we present a new set of applications, available as…
We investigate the relation between the scaling of block entropies and the efficient simulability by Matrix Product States (MPS), and clarify the connection both for von Neumann and Renyi entropies (see Table I). Most notably, even states…
We show the feasibility of tensor network solutions for lattice gauge theories in Hamiltonian formulation by applying matrix product states algorithms to the Schwinger model with zero and non-vanishing fermion mass. We introduce new…
We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their…