• DOI:10.48550/arXiv.2301.04301
• Corpus ID: 255595714

One-Shot Distributed Source Simulation: As Quantum as it Can Get

@article{George2023OneShotDS,
  title={One-Shot Distributed Source Simulation: As Quantum as it Can Get},
  author={Ian George and Min-Hsiu Hsieh and Eric Chitambar},
  journal={ArXiv},
  year={2023},
  volume={abs/2301.04301}
}

• Ian George, Min-Hsiu Hsieh, E. Chitambar
• Published 11 January 2023
• Computer Science
• ArXiv

—Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner’s seminal result showed that asymptotically the rate of uniform shared randomness needed for this task is given by a mutual information induced measure, now referred to as Wyner’s common in- formation. This asymptotic result was extended by Hayashi in the quantum setting to separable states, the largest class of states for which this task can be performed. In this work we characterize this task in the one-shot setting using the smooth entropy framework. We do this by introducing one-shot operational quantities and correlation measures that characterize them. We establish asymptotic equipartition properties for our correlation measures thereby recovering, and in fact strengthening, the aforementioned asymptotic results. In doing so, we consider technical points in one- shot network information theory and generalize the support lemma to the classical-quantum setting. We also introduce entanglement versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling.