# 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} }

—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…

## One Citation

### Revisiting Pure State Transformations with Zero Communication

- Computer Science
- 2023

This work derives the optimal status of pure state conversions under local unitaries as well as local operations and shared randomness (LOSR) and uses these results to explore catalytic conversions between pure states using zero communication.

## References

SHOWING 1-10 OF 52 REFERENCES

### A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks

- Computer ScienceIEEE Transactions on Information Theory
- 2013

The derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: the one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems.

### One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys

- Computer ScienceIEEE Transactions on Information Theory
- 2012

In this hybrid classical-quantum version of the famous Slepian-Wolf problem, the smooth max entropy is found to govern the number of bits into which classical information can be compressed so that it can be reliably recovered from the compressed version and quantum side information.

### Communication cost of entanglement transformations

- Computer Science
- 2003

A matching lower bound of the same asymptotic order is proved, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks.

### Wyner’s Common Information Under Rényi Divergence Measures

- Computer ScienceIEEE Transactions on Information Theory
- 2018

The exponential strong converse for the common information problem under the total variation distance measure is established, implying that Wyner’s common information is rather robust to the choice of distance measure employed.

### Partially Smoothed Information Measures

- Computer ScienceIEEE Transactions on Information Theory
- 2020

This work proposes to smooth only over a ball of close states which also have some of the reduced states on the relevant sub-systems fixed, which allows to give more refined characterizations of various information-theoretic problems in the one-shot setting.

### Generalised entropy accumulation

- Computer Science, Mathematics2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
- 2022

The first security proof for blind randomness expansion against general adversaries is given and the generalised EAT, which deals with a more restrictive model of side information, is developed, which can be applied more easily and to a broader range of cryptographic protocols.

### Quantum Versus Classical Advantages in Secret Key Distillation (and Their Links to Quantum Entanglement)

- Physics
- 2015

We consider the extraction of shared secret key from correlations that are generated by either a classical or quantum source. In the classical setting, two honest parties (Alice and Bob) use public…

### Error Exponent and Strong Converse for Quantum Soft Covering

- Computer Science2022 IEEE International Symposium on Information Theory (ISIT)
- 2022

This work establishes exponential achievability and strong converse bounds on the expected trace distance between the codebook-induced state and the true state and proves that the trace distances decay exponentially with error exponents expressed by the sandwiched Rényi and Augustin information.

### The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

- Computer Science
- 2011

A new proof of the Quantum Reverse Shannon Theorem is provided, which has been proved by Bennett, Devetak, Harrow, Shor, and Winter and is based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.

### Secret, public and quantum correlation cost of triples of random variables

- Computer Science, MathematicsProceedings. International Symposium on Information Theory, 2005. ISIT 2005.
- 2005

The secret key required as a function of the probability distribution is investigated and compared to an analogous notion based on prior shared entanglement and recovered as the special case of Z being independent of XY.