Tensor chain and constraints in tensor networks
From MaRDI portal
Publication:2314899
AdS-CFT correspondencegauge-gravity correspondenceholography and condensed matter physics (AdS/CMT)models of quantum gravity
Quantum coherence, entanglement, quantum correlations (81P40) Two-dimensional field theories, conformal field theories, etc. in quantum mechanics (81T40) Quantization of the gravitational field (83C45) Geometrodynamics and the holographic principle (83E05) String and superstring theories in gravitational theory (83E30)
Abstract: This paper accompanies with our recent work on quantum error correction (QEC) and entanglement spectrum (ES) in tensor networks (arXiv:1806.05007). We propose a general framework for planar tensor network state with tensor constraints as a model for correspondence, which could be viewed as a generalization of hyperinvariant tensor networks recently proposed by Evenbly. We elaborate our proposal on tensor chains in a tensor network by tiling space and provide a diagrammatical description for general multi-tensor constraints in terms of tensor chains, which forms a generalized greedy algorithm. The behavior of tensor chains under the action of greedy algorithm is investigated in detail. In particular, for a given set of tensor constraints, a critically protected (CP) tensor chain can be figured out and evaluated by its average reduced interior angle. We classify tensor networks according to their ability of QEC and the flatness of ES. The corresponding geometric description of critical protection over the hyperbolic space is also given.
Recommendations
- Parameterization of tensor network contraction
- A note on tensor chain approximation
- Tensor networks from kinematic space
- Optimization problems in contracted tensor networks
- Tensor network methods for invariant theory
- Tensor network contractions for \#SAT
- Tensor networks in machine learning
- The tensor network theory library
- Tensor network states and geometry
- scientific article; zbMATH DE number 4105759
Cites work
- Bidirectional holographic codes and sub-AdS locality
- Bulk locality and quantum error correction in AdS/CFT
- Discrete gravity on random tensor network and holographic Rényi entropy
- Entanglement and perfect quantum error correction
- Entanglement entropy and conformal field theory
- Entanglement entropy and quantum field theory
- Entanglement renormalization, quantum error correction, and bulk causality
- Entanglement renormalization: an introduction
- Exploring the tensor networks/AdS correspondence
- Group field theory and tensor networks: towards a Ryu-Takayanagi formula in full quantum gravity
- Holographic derivation of entanglement entropy from the anti-de Sitter space/conformal field theory correspondence
- Holographic duality from random tensor networks
- Holographic geometry of entanglement renormalization in quantum field theories
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- Living on the edge: a toy model for holographic reconstruction of algebras with centers
- Precursors, gauge invariance, and quantum error correction in AdS/CFT
- Renormalization group flows from holography; supersymmetry and a c-theorem
- The Ryu-Takayanagi formula from quantum error correction
Cited in
(8)- Boundary theories of critical matchgate tensor networks
- Surface growth scheme for bulk reconstruction and tensor network
- Fundamental limitations in the purifications of tensor networks
- The tensor network theory library
- Tensor Network Skeletonization
- A note on tensor chain approximation
- No invariant perfect qubit codes
- Thread/state correspondence: from bit threads to qubit threads
This page was built for publication: Tensor chain and constraints in tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314899)
