Papers
Topics
Authors
Recent
2000 character limit reached

ER = EPR is an operational theorem (2410.16496v1)

Published 21 Oct 2024 in quant-ph, gr-qc, and hep-th

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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.