One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing

@misc{can2026oneshot,
  title = {{One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing}},
  author = {Matthew Can and Mark M. Wilde},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.31501},
  eprint = {2610.31501},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.31501},
}

TY  - UNPB
TI  - One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing
AU  - Matthew Can
AU  - Mark M. Wilde
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.31501
UR  - https://arxiv.org/abs/2610.31501
AB  - How much entanglement can two distant laboratories share when their connection is noisy? We relate this question to deciding which of two quantum hypotheses is present. Our one-shot bounds apply to entanglement generation over a quantum channel and to one-way entanglement distillation from a shared state. We use Cheng's trace inequality to bound the infidelity of a Petz decoder in terms of a binary hypothesis testing cost. Applying the inequality before averaging over codes reduces the error analysis to computing a second moment of random subspaces. The proof covers every integer target dimension and treats rank-deficient states explicitly. A corollary expresses the achievable entanglement through hypothesis-testing coherent information, with a single logarithmic error slack and exact integer rounding. We also prove an error-preserving conversion from entanglement generation codes to entanglement transmission codes: the target dimension decreases by only a constant factor at fixed error, and the decoder is the original decoder followed by local processing. Consequently, for both entanglement generation and entanglement transmission, arbitrary pure reference-input states yield the same coherent-information rate, second-order Gaussian correction at the original error tolerance, and explicit achievable logarithmic remainder. For commuting testing hypotheses, the logarithmic remainder improves to a constant. These results give a direct route from binary distinguishability to explicit recovery guarantees and finite-resource quantum communication rates.
ER  -