Machine Learning Statistical Gravity from Multi-Region Entanglement
Entropy
- URL: http://arxiv.org/abs/2110.01115v1
- Date: Sun, 3 Oct 2021 22:46:41 GMT
- Title: Machine Learning Statistical Gravity from Multi-Region Entanglement
Entropy
- Authors: Jonathan Lam, Yi-Zhuang You
- Abstract summary: Ryu-Takayanagi formula connects quantum entanglement and geometry.
We propose a microscopic model by superimposing entanglement features of an ensemble of random tensor networks of different bond dimensions.
We show mutual information can be mediated effectively by geometric fluctuation.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The Ryu-Takayanagi formula directly connects quantum entanglement and
geometry. Yet the assumption of static geometry lead to an exponentially small
mutual information between far-separated disjoint regions, which does not hold
in many systems such as free fermion conformal field theories. In this work, we
proposed a microscopic model by superimposing entanglement features of an
ensemble of random tensor networks of different bond dimensions, which can be
mapped to a statistical gravity model consisting of a massive scalar field on a
fluctuating background geometry. We propose a machine-learning algorithm that
recovers the underlying geometry fluctuation from multi-region entanglement
entropy data by modeling the bulk geometry distribution via a generative neural
network. To demonstrate its effectiveness, we tested the model on a free
fermion system and showed mutual information can be mediated effectively by
geometric fluctuation. Remarkably, locality emerged from the learned
distribution of bulk geometries, pointing to a local statistical gravity theory
in the holographic bulk.
Related papers
- Geometric Trajectory Diffusion Models [58.853975433383326]
Generative models have shown great promise in generating 3D geometric systems.
Existing approaches only operate on static structures, neglecting the fact that physical systems are always dynamic in nature.
We propose geometric trajectory diffusion models (GeoTDM), the first diffusion model for modeling the temporal distribution of 3D geometric trajectories.
arXiv Detail & Related papers (2024-10-16T20:36:41Z) - Quantum Scattering of Spinless Particles in Riemannian Manifolds [0.0]
Quantum mechanics is sensitive to the geometry of the underlying space.
We present a framework for quantum scattering of a non-relativistic particle confined to a two-dimensional space.
arXiv Detail & Related papers (2024-02-16T10:50:50Z) - Gaussian Entanglement Measure: Applications to Multipartite Entanglement
of Graph States and Bosonic Field Theory [50.24983453990065]
An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers.
We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states.
By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
arXiv Detail & Related papers (2024-01-31T15:50:50Z) - Geometric Neural Diffusion Processes [55.891428654434634]
We extend the framework of diffusion models to incorporate a series of geometric priors in infinite-dimension modelling.
We show that with these conditions, the generative functional model admits the same symmetry.
arXiv Detail & Related papers (2023-07-11T16:51:38Z) - Theory on variational high-dimensional tensor networks [2.0307382542339485]
We investigate the emergent statistical properties of random high-dimensional-network states and the trainability of tensoral networks.
We prove that variational high-dimensional networks suffer from barren plateaus for global loss functions.
Our results pave a way for their future theoretical studies and practical applications.
arXiv Detail & Related papers (2023-03-30T15:26:30Z) - Geometric Scattering on Measure Spaces [12.0756034112778]
We introduce a general, unified model for geometric scattering on measure spaces.
We consider finite measure spaces that are obtained from randomly sampling an unknown manifold.
We propose two methods for constructing a data-driven graph on which the associated graph scattering transform approximates the scattering transform on the underlying manifold.
arXiv Detail & Related papers (2022-08-17T22:40:09Z) - Data-driven modelling of nonlinear dynamics by polytope projections and
memory [0.0]
We present a numerical method to model dynamical systems from data.
We project points from a Euclidean space to convex polytopes and represent these projected states of a system in new, lower-dimensional coordinates.
We then introduce a specific nonlinear transformation to construct a model of the dynamics in the polytope and to transform back into the original state space.
arXiv Detail & Related papers (2021-12-13T15:49:36Z) - GeoMol: Torsional Geometric Generation of Molecular 3D Conformer
Ensembles [60.12186997181117]
Prediction of a molecule's 3D conformer ensemble from the molecular graph holds a key role in areas of cheminformatics and drug discovery.
Existing generative models have several drawbacks including lack of modeling important molecular geometry elements.
We propose GeoMol, an end-to-end, non-autoregressive and SE(3)-invariant machine learning approach to generate 3D conformers.
arXiv Detail & Related papers (2021-06-08T14:17:59Z) - A Unifying and Canonical Description of Measure-Preserving Diffusions [60.59592461429012]
A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework.
We develop a geometric theory that improves and generalises this construction to any manifold.
arXiv Detail & Related papers (2021-05-06T17:36:55Z) - Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals.
We propose a general graph estimator based on a novel structured fusion regularization.
We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
arXiv Detail & Related papers (2021-03-05T04:42:32Z)
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.