Conformal Properties of Hyperinvariant Tensor Networks

• URL: http://arxiv.org/abs/2012.09591v2
• Date: Thu, 6 Jan 2022 13:21:17 GMT
• Title: Conformal Properties of Hyperinvariant Tensor Networks
• Authors: Matthew Steinberg, Javier Prior
• Abstract summary: We analyze the challenges related to optimizing tensors in a hyMERA with respect to some quasiperiodic critical spin chain. We show two new sets of tensor decompositions which exhibit different properties from the original construction. We find that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra of several minimial model CFTs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyperinvariant tensor networks (hyMERA) were introduced as a way to combine the successes of perfect tensor networks (HaPPY) and the multiscale entanglement renormalization ansatz (MERA) in simulations of the AdS/CFT correspondence. Although this new class of tensor network shows much potential for simulating conformal field theories arising from hyperbolic bulk manifolds with quasiperiodic boundaries, many issues are unresolved. In this manuscript we analyze the challenges related to optimizing tensors in a hyMERA with respect to some quasiperiodic critical spin chain, and compare with standard approaches in MERA. Additionally, we show two new sets of tensor decompositions which exhibit different properties from the original construction, implying that the multitensor constraints are neither unique, nor difficult to find, and that a generalization of the analytical tensor forms used up until now may exist. Lastly, we perform randomized trials using a descending superoperator with several of the investigated tensor decompositions, and find that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra of several minimial model CFTs.

Related papers

• Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
  We show that PCA becomes computationally hard at a critical value of the signal's magnitude. We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree. It also lets us analyze a new problem of distinguishing between different ensembles.
  arXiv  Detail & Related papers  (2024-04-29T14:33:24Z)
• Hyper-Laplacian Regularized Concept Factorization in Low-rank Tensor Space for Multi-view Clustering [0.0]
  We propose a hyper-Laplacian regularized concept factorization (HLRCF) in low-rank tensor space for multi-view clustering. Specifically, we adopt the concept factorization to explore the latent cluster-wise representation of each view. Considering that different tensor singular values associate structural information with unequal importance, we develop a self-weighted tensor Schatten p-norm.
  arXiv  Detail & Related papers  (2023-04-22T15:46:58Z)
• Error Analysis of Tensor-Train Cross Approximation [88.83467216606778]
  We provide accuracy guarantees in terms of the entire tensor for both exact and noisy measurements. Results are verified by numerical experiments, and may have important implications for the usefulness of cross approximations for high-order tensors.
  arXiv  Detail & Related papers  (2022-07-09T19:33:59Z)
• Controlling the Complexity and Lipschitz Constant improves polynomial nets [55.121200972539114]
  We derive new complexity bounds for the set of Coupled CP-Decomposition (CCP) and Nested Coupled CP-decomposition (NCP) models of Polynomial Nets. We propose a principled regularization scheme that we evaluate experimentally in six datasets and show that it improves the accuracy as well as the robustness of the models to adversarial perturbations.
  arXiv  Detail & Related papers  (2022-02-10T14:54:29Z)
• Smooth tensor estimation with unknown permutations [14.391648046717073]
  We develop a family of smooth tensor models up to arbitrary index permutations. We show that a constrained least-squares estimator in the block-wise family achieves the minimax error bound. We also provide an efficient-time Borda count algorithm that achieves provably optimal rate.
  arXiv  Detail & Related papers  (2021-11-08T17:53:48Z)
• Boundary theories of critical matchgate tensor networks [59.433172590351234]
  Key aspects of the AdS/CFT correspondence can be captured in terms of tensor network models on hyperbolic lattices. For tensors fulfilling the matchgate constraint, these have previously been shown to produce disordered boundary states. We show that these Hamiltonians exhibit multi-scale quasiperiodic symmetries captured by an analytical toy model.
  arXiv  Detail & Related papers  (2021-10-06T18:00:03Z)
• Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
  This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. We design a novel structured tensor low-rank norm tailored to MVSC. We show that the proposed method outperforms state-of-the-art methods to a significant extent.
  arXiv  Detail & Related papers  (2020-04-30T11:52:12Z)
• Tensor network models of AdS/qCFT [69.6561021616688]
  We introduce the notion of a quasiperiodic conformal field theory (qCFT) We show that qCFT can be best understood as belonging to a paradigm of discrete holography.
  arXiv  Detail & Related papers  (2020-04-08T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.