Related papers: Local Matrix Product Operators: Canonical Form, Co…
Transformer-based language models achieve strong performance across NLP tasks, but their quadratic parameter scaling with hidden dimension makes deployment on resource-constrained hardware expensive. We study Matrix Product Operator (MPO)…
Resolving unsteady transport phenomena in geometrically complex domains is traditionally constrained by polynomial scaling of computational cost with spatial resolution. While methods based on tensor-network data representations or…
The large dimensionality of environments is the limiting factor in applying optimal control to open quantum systems beyond Markovian approximations. Multiple methods exist to simulate non-Markovian open systems which effectively reduce the…
We present a method to apply the well-known matrix product state (MPS) formalism to partially separable states in solid state systems. The computational effort of our method is equal to the effort of the standard density matrix…
Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. We give the first randomized polynomial-time algorithm for finding ground states of gapped one-dimensional Hamiltonians: it outputs an…
Just as matrix product states represent ground states of one-dimensional quantum spin systems faithfully, continuous matrix product states (cMPS) provide faithful representations of the vacuum of interacting field theories in one spatial…
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the…
A large, or even infinite, local Hilbert space dimension poses a significant computational challenge for simulating quantum systems. In this work, we present a matrix product state (MPS)-based method for simulating one-dimensional quantum…
We provide theory, algorithms, and simulations of non-equilibrium quantum systems using a one-dimensional (1D) completely-positive (CP), matrix-product (MP) density-operator ($\rho$) representation. By generalizing the matrix product…
We have implemented the sweep algorithm for the variational optimization of SU(2) x U(1) (spin and particle number) invariant matrix product states (MPS) for general spin and particle number invariant fermionic Hamiltonians. This class…
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently,…
We present and test a protocol to learn the matrix-product operator (MPO) representation of an experimentally prepared quantum state. The protocol takes as an input classical shadows corresponding to local randomized measurements, and…
The inverse problem of 'eigenstates-to-Hamiltonian' is considered for an open chain of $N$ quantum spins in the context of Many-Body-Localization. We first construct the simplest basis of the Hilbert space made of $2^N$ orthonormal…
The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, a Gaussian convergence can be…
In stochastic modeling, there has been a significant effort towards finding predictive models that predict a stochastic process' future using minimal information from its past. Meanwhile, in condensed matter physics, matrix product states…
We present a new variational method, based on the matrix product operator (MPO) ansatz, for finding the steady state of dissipative quantum chains governed by master equations of the Lindblad form. Instead of requiring an accurate…
Recent work by Wu {\em et al.} [arXiv:1910.11011] proposed a numerical method, so-called matrix product operator-matrix product state (MPO-MPS) method, by which several types of quantum many-body wave functions, in particular, the projected…
We investigate quantum-inspired tensor networks (QTNs) for approximating flow maps of hydrodynamic partial differential equations (PDEs). Motivated by the effective low-rank structure that emerges after tensorization of discretized…
The density-matrix renormalization group (DMRG) algorithm can be adapted to the calculation of dynamical correlation functions in various ways which all represent compromises between computational efficiency and physical accuracy. In this…
Tensor product state (TPS) based methods are powerful tools to efficiently simulate quantum many-body systems in and out of equilibrium. In particular, the one-dimensional matrix-product (MPS) formalism is by now an established tool in…