A graphical calculus for integration over random diagonal unitary matrices

Abstract

We provide a graphical calculus for computing averages of tensor network diagrams with respect to the distribution of random vectors containing independent uniform complex phases. Our method exploits the order structure of the partially ordered set of uniform block permutations. A similar calculus is developed for random vectors consisting of independent uniform signs, based on the combinatorics of the partially ordered set of even partitions. We employ our method to extend some of the results by Johnston and MacLean on the family of local diagonal unitary invariant matrices. Furthermore, our graphical approach applies just as well to the real (orthogonal) case, where we introduce the notion of triplewise complete positivity to study the condition for separability of the relevant bipartite matrices. Finally, we analyze the twirling of linear maps between matrix algebras by independent diagonal unitary matrices, showcasing another application of our method.

arXiv commentMinor modifications with updated references

References in corpus (25)

• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Symmetric Informationally Complete Quantum Measurements
• A class of quantum many-body states that can be efficiently simulated
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Holographic duality from random tensor networks
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Geometry of entangled states
• Random matrix techniques in quantum information theory
• Random quantum channels I: graphical calculus and the Bell state phenomenon
• A separability criterion for density operators
• On the geometry of entangled states
• A new class of states with positive partial transposition
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Gaussianization and eigenvalue statistics for random quantum channels (III)
• Diagonal quantum circuits: their computational power and applications
• Categorical Quantum Circuits
• Matrix Product States, Random Matrix Theory and the Principle of Maximum Entropy
• Diagonal unitary and orthogonal symmetries in quantum theory
• RTNI - A symbolic integrator for Haar-random tensor networks
• The PPT${}^2$ conjecture holds for all Choi-type maps
• Diagonal-unitary 2-designs and their implementations by quantum circuits
• Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States
• Can entanglement hide behind triangle-free graphs?
• Schur multipliers and mixed unitary maps

Cited by in corpus (9)

• A Maximum Entropy Principle in Deep Thermalization and in Hilbert-Space Ergodicity
• Diagonal unitary and orthogonal symmetries in quantum theory
• The PPT${}^2$ conjecture holds for all Choi-type maps
• Diagonal unitary and orthogonal symmetries in quantum theory II: Evolution operators
• Can entanglement hide behind triangle-free graphs?
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Ergodic theory of diagonal orthogonal covariant quantum channels
• Random covariant quantum channels
• Simultaneous superadditivity of the direct and complementary channel capacities