aiqbench analysis
This is theoretical quantum information work on how much entanglement two parties can share over a noisy channel, with one-shot, finite-resource bounds rather than experiments. The main contribution is a tighter route from binary hypothesis-testing quantities to explicit recovery guarantees, plus a conversion from entanglement generation codes to transmission codes. Readers interested in quantum network design will find the finite-size error terms more practically useful than the asymptotic rates.
One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing
arXiv:2610.31501v1 Announce Type: new 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.
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.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2610.31501 [quant-ph]
(or arXiv:2610.31501v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.31501 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
check_conversion.py
check_haar_revision.py
check_identities.py
data/erasure_bounds.csv
erasure_bounds.py
requirements.txt
(4 additional files not shown) You must enabled JavaScript to view entire file list.
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 331 words
Related coverage
Universal distillation of quantum entanglement
arXiv · Oct 1, 2026
Asymptotic Entanglement Hiding under Stabilizer Restrictions
arXiv · Aug 20, 2026
Equivalence of Correlated Catalytic and Marginal Asymptotic Transformations in Quantum Resource Theories
arXiv · Nov 5, 2026
On PPT entanglement distillation
arXiv · Oct 9, 2026