2006/11/28 by José I. Latorre, Jose I. Latorre · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems #cond-mat.other #hep-th #quant-ph
paper · pdf · doi:10.1088/1751-8113/40/25/s13
published as J.Phys.A40:6689-6697,2007 · 9 pages. Contribution to the Proceedings of the IRGAC conference held at Barcelona, July 2006
arxiv created 2006/11/28 · openalex publication_date 2007/06/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
The relation between entanglement entropy and the computational difficulty of classically simulating quantum mechanics is briefly reviewed. Matrix product states are proven to provide an efficient representation of one-dimensional quantum systems. Further applications of the techniques based on matrix product states, some of their spin-off and their recent generalizations to scale invariant theories and higher dimension systems are also discussed.