Entropy scaling and simulability by matrix product states

Norbert Schuch, Michael M. Wolf, Frank Verstraete, J. Ignacio Cirac

Research output: Contribution to journalArticlepeer-review

269 Scopus citations

Abstract

We investigate the relation between the scaling of block entropies and the efficient simulability by matrix product states (MPSs) and clarify the connection both for von Neumann and Rényi entropies. Most notably, even states obeying a strict area law for the von Neumann entropy are not necessarily approximable by MPSs. We apply these results to illustrate that quantum computers might outperform classical computers in simulating the time evolution of quantum systems, even for completely translational invariant systems subject to a time-independent Hamiltonian.

Original languageEnglish
Article number030504
JournalPhysical Review Letters
Volume100
Issue number3
DOIs
StatePublished - 25 Jan 2008
Externally publishedYes

Fingerprint

Dive into the research topics of 'Entropy scaling and simulability by matrix product states'. Together they form a unique fingerprint.

Cite this