One-Shot Distributed Source Simulation: As Quantum as it Can Get
arXiv:2301.04301 · doi:10.1109/TIT.2025.3624812
Abstract
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 information. 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 to vanishing error. In this work we characterize this task in a near-tight manner 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 the previous vanishing-error asymptotic results. In doing so, we consider technical points in one-shot network information theory and provide methods for cardinality bounds in the smooth entropy calculus. We also introduce entangled state versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling. This provides a strong characterization of this network task in the one-shot, quantum regime.
28+10 pages. Fixed various typos and dimension of cardinality bound; formatted to two-column
References in corpus (36)
- Quantum entanglement
- Quantum Resource Theories
- Distillation of secret key and entanglement from quantum states
- The Uncertainty Principle in the Presence of Quantum Memory
- On quantum Renyi entropies: a new generalization and some properties
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Distributed Channel Synthesis
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Entropy accumulation
- Distilling common randomness from bipartite quantum states
- Relative Entropy of Entanglement and Restricted Measurements
- Distilling entanglement from arbitrary resources
- Entanglement cost in practical scenarios
- Smooth Max-Information as One-Shot Generalization for Mutual Information
- Catalysis of entanglement and other quantum resources
- Generalised entropy accumulation
- One-shot entanglement distillation beyond local operations and classical communication
- Channel Simulation and Coded Source Compression
- Second-Order Region for Gray-Wyner Network
- Partially smoothed information measures
- Perfect Embezzlement of Entanglement
- A Stronger Soft-Covering Lemma and Applications
- Characteristics of Universal Embezzling Families
- Round Complexity in the Local Transformations of Quantum and Classical States
- Discrete Lossy Gray-Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations
- Approximate quantum Markov chains
- Resources of the Quantum World
- A solution of the generalised quantum Stein's lemma
- A Classical Analog to Entanglement Reversibility
- The Private and Public Correlation Cost of Three Random Variables with Collaboration
- Decomposition Rules for Quantum Rényi Mutual Information with an Application to Information Exclusion Relations
- Cone-Restricted Information Theory
- Revisiting Pure State Transformations with Zero Communication
- Single-shot entanglement manipulation of states and channels revisited