Distributing bipartite quantum systems under timing constraints
arXiv:2011.00936 · doi:10.1088/1751-8121/abe5ce
Abstract
In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. We explore various tasks that plausibly arise in this context, and characterize the achievability of several of these in settings where only one-way communication is allowed. We provide partial results in the case where two-way communication is allowed. This builds on earlier work on summoning single and bipartite systems.
35 pages
References in corpus (6)
- Spectrum conditions for symmetric extendible states
- Quantum tasks in holography
- One-out-of- spacetime-constrained oblivious transfer
- Efficient Code for Relativistic Quantum Summoning
- Localizing and excluding quantum information; or, how to share a quantum secret in spacetime
- Constraining the doability of relativistic quantum tasks