ER = EPR is an operational theorem

• URL: http://arxiv.org/abs/2410.16496v1
• Date: Mon, 21 Oct 2024 20:38:32 GMT
• Title: ER = EPR is an operational theorem
• Authors: Chris Fields, James F. Glazebrook, Antonino Marciano, Emanuele Zappala,
• Abstract summary: We show that Alice and Bob cannot operationally distinguish monogamous entanglement from a topological identification of points in their respective local spacetimes. Our construction immediately implies that in this operational setting, the local topology of spacetime is observer-relative.
• Score: 0.48212500317840945
• License:
• Abstract: We show that in the operational setting of a two-agent, local operations, classical communication (LOCC) protocol, Alice and Bob cannot operationally distinguish monogamous entanglement from a topological identification of points in their respective local spacetimes, i.e. that ER = EPR can be recovered as an operational theorem. Our construction immediately implies that in this operational setting, the local topology of spacetime is observer-relative. It also provides a simple demonstration of the non-traversability of ER bridges. As our construction does not depend on an embedding geometry, it generalizes previous geometric approaches to ER = EPR.

Related papers

• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory [87.62730694973696]
  STEEL is the first provably sample-efficient algorithm for learning the controllable dynamics of an Exogenous Block Markov Decision Process from a single trajectory. We prove that STEEL is correct and sample-efficient, and demonstrate STEEL on two toy problems.
  arXiv  Detail & Related papers  (2024-10-03T21:57:21Z)
• The Realizability of Revision and Contraction Operators in Epistemic Spaces [8.010966370223985]
  AGM revision and AGM contraction operators are only realizable in precisely determined spaces. We define the class of linear change operators, a special kind of maxichoice operator. When AGM revision, respectively, AGM contraction, is realizable, linear change operators are a canonical realization.
  arXiv  Detail & Related papers  (2024-07-30T15:55:01Z)
• Operational Latent Spaces [0.0]
  We investigate the construction of latent spaces through self-supervised learning to support semantically meaningful operations. Some operational latent spaces are found to have arisen "unintentionally" in the progress toward some self-supervised learning objective. We focus on the intentional creation of operational latent spaces via self-supervised learning, including the introduction of rotation operators via a novel "FiLMR" layer.
  arXiv  Detail & Related papers  (2024-06-04T18:25:15Z)
• Entanglement Renormalization for Quantum Field Theories with Discrete Wavelet Transforms [0.0]
  We propose an adaptation of Entanglement Renormalization for quantum field theories using discrete wavelet transforms. We describe two concrete implementations of our wMERA algorithm for free scalar and fermionic theories in (1+1) spacetime dimensions.
  arXiv  Detail & Related papers  (2024-04-17T20:01:51Z)
• Unperturbation theory: reconstructing Lagrangians from instanton fluctuations [0.0]
  We propose an inverse problem, namely, the reconstruction of the nonlinear action of the theory admitting instantons from a fluctuation operator with a known Green's function. For the wider but less simple class of shape-invariant operators, we derive the set of parameters leading to the new infinite families of analytic potentials.
  arXiv  Detail & Related papers  (2024-02-11T11:22:22Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• When Is Generalizable Reinforcement Learning Tractable? [74.87383727210705]
  We study the query complexity required to train RL agents that can generalize to multiple environments. We introduce Strong Proximity, a structural condition which precisely characterizes the relative closeness of different environments. We show that under a natural weakening of this condition, RL can require query complexity that is exponential in the horizon to generalize.
  arXiv  Detail & Related papers  (2021-01-01T19:08:24Z)
• Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation [83.55414555337154]
  In this work, we study learning such utility from human demonstrations. We propose a new quest, Generalized Inverse Planning, for utility learning in this domain. We outline a computational framework, Maximum Entropy Inverse Planning (MEIP), that learns non-Markovian utility and associated concepts in a generative manner.
  arXiv  Detail & Related papers  (2020-11-12T21:06:26Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• One-Way LOCC Indistinguishable Lattice States via Operator Structures [0.0]
  We develop a technique for the construction of relatively small sets of lattice states not distinguishable by one-way LOCC schemes. We show examples, show the construction extends to generalized Pauli states, and compare the construction to other recent work.
  arXiv  Detail & Related papers  (2020-04-24T14:37:56Z)

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.