Time-evolving a matrix product state with long-ranged interactions
Michael P. Zaletel,Michael P. Zaletel,Roger S. K. Mong,Christoph Karrasch,Christoph Karrasch,Joel E. Moore,Joel E. Moore,Frank Pollmann +7 more
TL;DR: In this paper, the authors introduce a numerical algorithm to simulate the time evolution of a matrix product state under a long-ranged Hamiltonian in moderately entangled systems. But their method overcomes the restriction to short-ranged interactions of most existing methods, and it proves particularly useful for studying the dynamics of both power-law interacting, one-dimensional systems, such as Coulombic and dipolar systems, and quasi-two-dimensional, three dimensional systems such as strips or cylinders.
read more
Abstract: We introduce a numerical algorithm to simulate the time evolution of a matrix product state under a long-ranged Hamiltonian in moderately entangled systems. In the effectively one-dimensional representation of a system by matrix product states, long-ranged interactions are necessary to simulate not just many physical interactions but also higher-dimensional problems with short-ranged interactions. Since our method overcomes the restriction to short-ranged Hamiltonians of most existing methods, it proves particularly useful for studying the dynamics of both power-law interacting, one-dimensional systems, such as Coulombic and dipolar systems, and quasi-two-dimensional systems, such as strips or cylinders. First, we benchmark the method by verifying a long-standing theoretical prediction for the dynamical correlation functions of the Haldane-Shastry model. Second, we simulate the time evolution of an expanding cloud of particles in the two-dimensional Bose-Hubbard model, a subject of several recent experiments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Unifying time evolution and optimization with matrix product states
Jutho Haegeman,Christian Lubich,Ivan V. Oseledets,Ivan V. Oseledets,Bart Vandereycken,Frank Verstraete,Frank Verstraete +6 more
TL;DR: The time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states and a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions.
Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
Johannes Hauschild,Frank Pollmann +1 more
- 08 Oct 2018
TL;DR: TeNPy as discussed by the authors is a tensor library for Python that provides a compact review of basic tensor state (TPS) concepts and a practical guide to implement abelian symmetries to accelerate tensor operations.
Probing entanglement entropy via randomized measurements
Tiff Brydges,Andreas Elben,Petar Jurcevic,Benoît Vermersch,Christine Maier,B. P. Lanyon,Peter Zoller,Rainer Blatt,Christian F. Roos +8 more
TL;DR: In this article, a new protocol for measuring entropy, based on statistical correlations between randomized measurements, is presented and experimentally demonstrated for probing and characterizing engineered quantum systems in the laboratory, applicable to arbitrary quantum states of up to several tens of qubits.
423
Variational optimization algorithms for uniform matrix product states
Valentin Zauner-Stauber,Laurens Vanderstraeten,Matthew Fishman,Frank Verstraete,Frank Verstraete,Jutho Haegeman +5 more
TL;DR: This work combines the density matrix renormalization group with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit that works very efficiently for Hamiltonians with long-range interactions and for the simulation of two-dimensional models on infinite cylinders.
273
References
Density matrix formulation for quantum renormalization groups
TL;DR: A generalization of the numerical renormalization-group procedure used first by Wilson for the Kondo problem is presented and it is shown that this formulation is optimal in a certain sense.
8.3K
The density-matrix renormalization group in the age of matrix product states
TL;DR: The density matrix renormalization group method (DMRG) has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems as mentioned in this paper.
4.4K
Efficient classical simulation of slightly entangled quantum computations.
TL;DR: The results imply that a necessary condition for an exponential computational speedup is that the amount of entanglement increases with the size n of the computation, and provide an explicit lower bound on the required growth.
Journal of Statistical Mechanics: theory and experiment
Marc Mezard,Francisco Castilho Alcaraz +1 more
- 01 Jan 2019
2.1K