RTNI - A symbolic integrator for Haar-random tensor networks
arXiv:1902.08539 · doi:10.1088/1751-8121/ab434b
Abstract
We provide a computer algebra package called Random Tensor Network Integrator (RTNI). It allows to compute averages of tensor networks containing multiple Haar-distributed random unitary matrices and deterministic symbolic tensors. Such tensor networks are represented as multigraphs, with vertices corresponding to tensors or random unitaries and edges corresponding to tensor contractions. Input and output spaces of random unitaries may be subdivided into arbitrary tensor factors, with dimensions treated symbolically. The algorithm implements the graphical Weingarten calculus and produces a weighted sum of tensor networks representing the average over the unitary group. We illustrate the use of this algorithmic tool on some examples from quantum information theory, including entropy calculations for random tensor network states as considered in toy models for holographic duality. Mathematica and Python implementations are supplied.
arXiv commentCode available (for Mathematica and python) at https://github.com/MotohisaFukuda/RTNI
References in corpus (16)
- Random Matrix Theories in Quantum Physics: Common Concepts
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Superadditivity of communication capacity using entangled inputs
- Optimal Cloning of Pure States
- Holographic duality from random tensor networks
- Aspects of generic entanglement
- Randomizing quantum states: Constructions and applications
- Optimal Cloning of Pure States, Judging Single Clones
- Quantum Picturalism
- A decoupling approach to the quantum capacity
- Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
- Random matrix techniques in quantum information theory
- Random quantum channels I: graphical calculus and the Bell state phenomenon
- Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
- Matrix Product States, Random Matrix Theory and the Principle of Maximum Entropy
- Random quantum codes from Gaussian ensembles and an uncertainty relation
Cited by in corpus (17)
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- Trainability of Dissipative Perceptron-Based Quantum Neural Networks
- Generating random quantum channels
- Scrambling and decoding the charged quantum information
- Non-Hermitian Hamiltonians Violate the Eigenstate Thermalization Hypothesis
- Computing exact moments of local random quantum circuits via tensor networks
- Typical Correlation Length of Sequentially Generated Tensor Network States
- Typical entanglement for Gaussian states
- Page curves and typical entanglement in linear optics
- Constrained and Vanishing Expressivity of Quantum Fourier Models
- A graphical calculus for integration over random diagonal unitary matrices
- Laziness, Barren Plateau, and Noise in Machine Learning
- Quantum and classical dynamical semigroups of superchannels and semicausal channels
- Photon-number moments and cumulants of Gaussian states
- Concentration of quantum channels with random Kraus operators via matrix Bernstein inequality
- Pinpointing Triple Point of Noncommutative Matrix Model with Curvature