arXiv:2610.31501
One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing
Matthew Can, Mark M. Wilde
Abstract
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.
AI Summary
The paper asks how binary hypothesis testing can certify one-shot entanglement generation over a channel and one-way entanglement distillation from a shared state, using explicit Petz decoders. For $d=\dim A$ and every integer $2\le m\le d$, it proves achievable infidelity at most $e_{d,m}(1-e_{d,m}/(dm))$, where $e_{d,m}=\min_{0\le T\le I}\{\operatorname{Tr}[(I-T)\rho]+\operatorname{Tr}[TB_{d,m}]\}$ and $B_{d,m}=\frac{dm-1}{d^2-1}(dI_A\otimes\rho_B-\rho)$. A simpler consequence certifies any integer target satisfying $\log_2m\le D_H^{\epsilon-\nu}(\rho_{AB}\Vert I_A\otimes\rho_B)-\log_2(1/\nu)$, with exact rounding specified. The proof applies Cheng’s trace inequality to the fixed-code Petz fidelity before averaging random subspaces, replacing code-dependent inverse operators by an affine testing expression whose Haar average requires only a second moment. Overlapping cyclic subspaces remove divisibility restrictions; support inverses and completed recovery channels handle rank-deficient states. A separate conversion maps an $(M,\epsilon)$ entanglement-generation code to entanglement transmission at the same error with dimension $\max\{1,\lfloor M\sqrt{1-\epsilon}\rfloor\}$ and additional local decoder processing. Thus arbitrary pure auxiliary reference–input states yield achievable rates $nI_c+\sqrt{nV_c}\Phi^{-1}(\epsilon)-\tfrac12\log_2n-O(1)$ for transmission as well as generation. Commuting testing hypotheses permit a constant remainder; zero variance is treated separately. These are fixed-state or fixed-input achievability bounds, not matching converses or optimized capacity characterizations. The logarithmic coefficient is not claimed optimal, the erasure example exhibits looseness relative to actual Petz performance, and the construction supplies no efficient decoding circuit.
ChatGPT assisted with proof formulation and exploration, exposition, literature checks, figure preparation, and numerical tests during the development of this manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages, 6 figures