pith. sign in

arxiv: 1708.00006 · v1 · pith:7QSUXCFLnew · submitted 2017-07-31 · 🪐 quant-ph · cond-mat.dis-nn· gr-qc· hep-th· math-ph· math.MP

Tensor Networks in a Nutshell

classification 🪐 quant-ph cond-mat.dis-nngr-qchep-thmath-phmath.MP
keywords tensorquantumassociatedgraphicallanguagemethodsnetworknetworks
0
0 comments X
read the original 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 $3$-edge-colorings of $3$-regular planar graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Circuit Cutting: Complexity and Optimization

    quant-ph 2026-04 unverdicted novelty 7.0

    Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.

  2. Prime Factorization Equation from a Tensor Network Perspective

    math.OC 2025-07 unverdicted novelty 6.0

    Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.

  3. Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms

    cs.LG 2023-09 unverdicted novelty 5.0

    Introduces two algorithms for efficient finite initialization of tensor network layers via iterative partial norm computations, applied to MPS/TT and MPO/TT-M layers with scaling analysis and public code.

  4. Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective

    quant-ph 2023-11 unverdicted novelty 4.0

    Tensor network algorithms provide exact optimal task assignments on machines under directed constraints, with preprocessing and iterative improvements to reduce complexity.

  5. Tensor Cookbook: Mastering Tensors through Diagrams

    cs.LG 2026-05 unverdicted novelty 2.0

    A guide presenting tensor algebra operations, decompositions, and gradients through tensor network diagrams for broader accessibility beyond quantum physics.

  6. Quantum-inspired tensor networks in machine learning models

    cs.LG 2026-04 unverdicted novelty 2.0

    Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.

  7. Pushing Tensor Networks to the Limit

    physics.pop-ph 2019-06 unverdicted

    Perspective article on continuous matrix product states (cMPS) proposed to overcome limitations in generalizing tensor networks to higher-dimensional continuum systems.