Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.31501

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

Matthew Can, Mark M. Wilde

quant-phcs.ITSubmitted Oct 22, 2026• Announced Oct 23, 2026• 1 citation
arXivHTMLPDF

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.

Likely largely AI-generatedAI use disclosed
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

Related papers

Quantum communication: a discrimination approach

Hao-Chung Cheng

We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.

quant-pharXiv:2610.40358•Oct 30, 2026•0 citations

Tight any-shot quantum decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.

quant-pharXiv:2602.17430•Feb 20, 2026•13 citations

Decoding quantum information via the Petz recovery map

Salman Beigi, Nilanjana Datta, Felix Leditzky

We obtain a lower bound on the maximum number of qubits, Qn, ε(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold ε. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the Petz recovery map (also known as the transpose channel). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which Qn, ε(N) scales as n.

arXiv:1504.04449•Journal of Mathematical Physics•Aug 1, 2016•41 citations

Non-Asymptotic Entanglement Distillation

Kun Fang, Xin Wang, Marco Tomamichel +1 more

Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.

arXiv:1706.06221•IEEE Transactions on Information Theory•May 7, 2019•79 citations

Finite-Blocklength and Exponential Analyses for Universal Entanglement and Coherence Distillation under Various Free Operations

Zhiwen Lin, Ke Li, Kun Fang

Historically, entanglement and coherence distillation focused on the distillable rate under full knowledge of the initial state. In this paper, we develop a unified finite-blocklength and asymptotic theory for universal distillation from convex compact sequences of possible states stable under tensor products. We first resolve an open question by showing that two regularized variants of the generalized quantum Hoeffding divergence need not coincide, and establish fundamental properties of the Hoeffding divergence and anti-divergence. For universal entanglement distillation, we connect finite-blocklength performance under non-entangling, PPT-preserving, and dually free operations to composite correlated hypothesis testing, yielding reliability functions for non-entangling and PPT-preserving operations characterized by regularized quantum Hoeffding divergences and strong converse bounds via the anti-divergence. We recover the entanglement concentration error exponent, zero-rate exponents under a continuity condition, and distillable entanglements, and characterize the dually free cases by regularized relative entropies under restricted measurements. Additionally, five concrete noise models justify the black-box assumptions for both resources. For coherence distillation under maximally incoherent and dephasing-covariant incoherent operations, we extend the one-shot semidefinite program characterization to universal inputs; relating a relaxed optimization to hypothesis testing yields the high-rate reliability function. A coherent-seed approach extends the single-state formula to the entire direct regime when the zero-error rate is positive. Finally, we completely characterize the states with positive zero-error coherence distillation rate, show that the rate equals the order-zero Petz Rényi relative entropy of coherence, and derive dimension-independent one-shot bounds ......

quant-pharXiv:2601.10190•IEEE International Symposium on Information Theory (ISIT)•Jan 16, 2026•6 citations

Entanglement fidelity of the Petz decoder for one-shot entanglement transmission

Laura Burri

One-shot entanglement transmission is a quantum information processing task where a quantum state is sent to a second party over a noisy channel. The goal of the task is to approximately recover the original state by applying a decoder to the output of the noisy channel. In this work, we note that the Petz map induces a universal decoder for one-shot entanglement transmission, and we quantify its entanglement fidelity. This fidelity is found to be determined by the singly minimized Petz Rényi mutual information of order 1/2 associated with a complementary channel, thus providing a novel operational interpretation of this information measure. Furthermore, we compare the performance of this decoder to that of the decoder induced by the twirled Petz map and the Schumacher–Westmoreland decoder.

arXiv:2502.17411•Journal of Mathematical Physics•Oct 1, 2026•2 citations
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.
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⁡Ad=\dim Ad=dimA and every integer 2≤m≤d2\le m\le d2≤m≤d, it proves achievable infidelity at most ed,m(1−ed,m/(dm))e_{d,m}(1-e_{d,m}/(dm))ed,m​(1−ed,m​/(dm)), where ed,m=min⁡0≤T≤I{Tr⁡[(I−T)ρ]+Tr⁡[TBd,m]}e_{d,m}=\min_{0\le T\le I}\{\operatorname{Tr}[(I-T)\rho]+\operatorname{Tr}[TB_{d,m}]\}ed,m​=min0≤T≤I​{Tr[(I−T)ρ]+Tr[TBd,m​]} and Bd,m=dm−1d2−1(dIA⊗ρB−ρ)B_{d,m}=\frac{dm-1}{d^2-1}(dI_A\otimes\rho_B-\rho)Bd,m​=d2−1dm−1​(dIA​⊗ρB​−ρ). A simpler consequence certifies any integer target satisfying log⁡2m≤DHϵ−ν(ρAB∥IA⊗ρB)−log⁡2(1/ν)\log_2m\le D_H^{\epsilon-\nu}(\rho_{AB}\Vert I_A\otimes\rho_B)-\log_2(1/\nu)log2​m≤DHϵ−ν​(ρAB​∥IA​⊗ρB​)−log2​(1/ν), 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,ϵ)(M,\epsilon)(M,ϵ) entanglement-generation code to entanglement transmission at the same error with dimension max⁡{1,⌊M1−ϵ⌋}\max\{1,\lfloor M\sqrt{1-\epsilon}\rfloor\}max{1,⌊M1−ϵ​⌋} and additional local decoder processing. Thus arbitrary pure auxiliary reference–input states yield achievable rates nIc+nVcΦ−1(ϵ)−12log⁡2n−O(1)nI_c+\sqrt{nV_c}\Phi^{-1}(\epsilon)-\tfrac12\log_2n-O(1)nIc​+nVc​​Φ−1(ϵ)−21​log2​n−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.
We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
We obtain a lower bound on the maximum number of qubits, Qn, ε(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold ε. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the Petz recovery map (also known as the transpose channel). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which Qn, ε(N) scales as n.
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.
Historically, entanglement and coherence distillation focused on the distillable rate under full knowledge of the initial state. In this paper, we develop a unified finite-blocklength and asymptotic theory for universal distillation from convex compact sequences of possible states stable under tensor products. We first resolve an open question by showing that two regularized variants of the generalized quantum Hoeffding divergence need not coincide, and establish fundamental properties of the Hoeffding divergence and anti-divergence. For universal entanglement distillation, we connect finite-blocklength performance under non-entangling, PPT-preserving, and dually free operations to composite correlated hypothesis testing, yielding reliability functions for non-entangling and PPT-preserving operations characterized by regularized quantum Hoeffding divergences and strong converse bounds via the anti-divergence. We recover the entanglement concentration error exponent, zero-rate exponents under a continuity condition, and distillable entanglements, and characterize the dually free cases by regularized relative entropies under restricted measurements. Additionally, five concrete noise models justify the black-box assumptions for both resources. For coherence distillation under maximally incoherent and dephasing-covariant incoherent operations, we extend the one-shot semidefinite program characterization to universal inputs; relating a relaxed optimization to hypothesis testing yields the high-rate reliability function. A coherent-seed approach extends the single-state formula to the entire direct regime when the zero-error rate is positive. Finally, we completely characterize the states with positive zero-error coherence distillation rate, show that the rate equals the order-zero Petz Rényi relative entropy of coherence, and derive dimension-independent one-shot bounds ......
One-shot entanglement transmission is a quantum information processing task where a quantum state is sent to a second party over a noisy channel. The goal of the task is to approximately recover the original state by applying a decoder to the output of the noisy channel. In this work, we note that the Petz map induces a universal decoder for one-shot entanglement transmission, and we quantify its entanglement fidelity. This fidelity is found to be determined by the singly minimized Petz Rényi mutual information of order 1/2 associated with a complementary channel, thus providing a novel operational interpretation of this information measure. Furthermore, we compare the performance of this decoder to that of the decoder induced by the twirled Petz map and the Schumacher–Westmoreland decoder.