Related papers: Dicke states as matrix product states
We report on a systematic implementation of su(2) invariance for matrix product states (MPS) with concrete computations cast in a diagrammatic language. As an application we present a variational MPS study of $su(2)$ invariant quantum spin…
This work presents a comparative study of new and existing optimization and diagonalization methods for solving time-independent partial differential equations (PDEs) using matrix product states (MPS) in the quantized tensor-train formalism…
Quantum turbulence spans length scales from the system size $L$ to the healing length $\xi$, making direct numerical simulations (DNS) of the Gross-Pitaevskii (GP) equation computationally expensive when $L \gg \xi$. We present a matrix…
We propose a way to construct a thermal pure quantum matrix product state (TPQ-MPS) that can simulate finite temperature quantum many-body systems with a minimal numerical cost comparable to the matrix product algorithm for the ground…
We show that the formalism of tensor-network states, such as the matrix product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of…
We introduce a novel breakthrough approach to evaluate the nonstabilizerness of an $N$-qubits Matrix Product State (MPS) with bond dimension $\chi$. In particular, we consider the recently introduced Stabilizer R\'enyi Entropies (SREs). We…
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…
A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length $N$ of the chain, while…
Many fractional quantum Hall states can be expressed as a correlator of a given conformal field theory used to describe their edge physics. As a consequence, these states admit an economical representation as an exact Matrix Product States…
The amplitude encoding of an arbitrary $n$-qubit state vector requires $\Omega(2^n)$ gate operations, owing to the exponential dimension of the Hilbert space. We can, however, form dimensionality-reduced representations of quantum states…
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…
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…
We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that…
It is known that exact traveling wave solutions exist for families of (n+1)-states stochastic one-dimensional non-equilibrium lattice models with open boundaries provided that some constraints on the reaction rates are fulfilled. These…
Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following…
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…
Matrix Product States (MPS), also known as Tensor Train (TT) decomposition in mathematics, has been proposed originally for describing an (especially one-dimensional) quantum system, and recently has found applications in various…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
Motivated by a compelling need for time-efficient and robust schemes for quantum-state engineering in systems of neutral atoms in optical tweezers, we consider a ring-shaped array of qubits with nearest-neighbor Ising-type ($zz$) coupling…
We introduce a simple representation for irreducible spherical tensor operators of the rotation group of arbitrary integer or half integer rank and use these tensor operators to construct matrix product states corresponding to all the…