Tensor Networks in a Nutshell
arXiv:1708.00006
Abstract
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and pictorially reason about quantum circuits, channels, protocols, open systems and more. Our goal is to explain tensor networks and some associated methods as quickly and as painlessly as possible. Beginning with the key definitions, the graphical tensor network language is presented through examples. We then provide an introduction to matrix product states. We conclude the tutorial with tensor contractions evaluating combinatorial counting problems. The first one counts the number of solutions for Boolean formulae, whereas the second is Penrose's tensor contraction algorithm, returning the number of -edge-colorings of -regular planar graphs.
to appear in Contemporary Physics, 34 pages
References in corpus (12)
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- A class of quantum many-body states that can be efficiently simulated
- Criticality, the area law, and the computational power of PEPS
- Advances on Tensor Network Theory: Symmetries, Fermions, Entanglement, and Holography
- Quantum MERA Channels
- Consistency Conditions for an AdS/MERA Correspondence
- Density Matrix Renormalization Group in the Heisenberg Picture
- Simulation of time evolution with the MERA
- Categorical Quantum Circuits
- Solving search problems by strongly simulating quantum circuits
- Charged String Tensor Networks