Superposed Random Spin Tensor Networks and their Holographic Properties
Simon Langenscheidt

TL;DR
This paper explores boundary-to-boundary holography in superpositions of spin network states, using random tensor techniques to relate entropy and geometry, revealing conditions for isometric mappings and boundary area bounds.
Contribution
It introduces a novel approach to quantum superpositions of geometries in spin networks, connecting tensor network states with random Ising models to analyze holographic properties.
Findings
Superpositions of geometries can preserve boundary isometry under specific weight conditions.
Average boundary area is bounded by the individual areas, providing geometric constraints.
Random tensor averaging links entropy calculations to a classical statistical model.
Abstract
We study criteria for and properties of boundary-to-boundary holography in a class of spin network states defined by analogy to projected entangled pair states (PEPS). In particular, we consider superpositions of states corresponding to well-defined, discrete geometries on a graph. By applying random tensor averaging techniques, we map entropy calculations to a random Ising model on the same graph, with distribution of couplings determined by the relative sizes of the involved geometries. The superposition of tensor network states with variable bond dimension used here presents a picture of a genuine quantum sum over geometric backgrounds. We find that, whenever each individual geometry produces an isometric mapping of a fixed boundary region C to its complement, then their superposition does so iff the relative weight going into each geometry is inversely proportional to its size.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum many-body systems · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
