Decoding quantum information via the Petz recovery map

Abstract

We obtain a lower bound on the maximum number of qubits, $Q^{n,\epsilon }(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\epsilon$. 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 \emph{Petz recovery map} (also known as the \emph{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 $Q^{n,\epsilon }(\mathcal{N})$ scales as $\sqrt{n}$.

31 pages, removed section 4 of the previous version which included an incorrect lemma

References in corpus (28)

• On quantum Renyi entropies: a new generalization and some properties
• A simple formula for the average gate fidelity of a quantum dynamical operation
• The operational meaning of min- and max-entropy
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• A Fully Quantum Asymptotic Equipartition Property
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Quantum conditional mutual information and approximate Markov chains
• Duality Between Smooth Min- and Max-Entropies
• The quantum capacity of channels with arbitrarily correlated noise
• A decoupling approach to the quantum capacity
• Second-order asymptotics for quantum hypothesis testing
• One-shot decoupling
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• Tema Con Variazioni: Quantum Channel Capacity
• A simple approach to approximate quantum error correction based on the transpose channel
• Quantum Coding with Finite Resources
• Distilling entanglement from arbitrary resources
• The apex of the family tree of protocols: Optimal rates and resource inequalities
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
• Quantum Achievability Proof via Collision Relative Entropy
• "Pretty strong" converse for the quantum capacity of degradable channels
• Random quantum codes from Gaussian ensembles and an uncertainty relation

Cited by in corpus (23)

• Converse bounds for private communication over quantum channels
• Gaussian hypothesis testing and quantum illumination
• Principles of Quantum Communication Theory: A Modern Approach
• Quantum Coding with Finite Resources
• Entropy accumulation with improved second-order term
• Quantum algorithm for Petz recovery channels and pretty good measurements
• Semidefinite programming strong converse bounds for classical capacity
• Non-asymptotic entanglement distillation
• Fundamental work cost of quantum processes
• Position-based coding and convex splitting for private communication over quantum channels
• Semidefinite programming converse bounds for quantum communication
• Reversing Lindblad Dynamics via Continuous Petz Recovery Map
• Entanglement-assisted private communication over quantum broadcast channels
• Dynamical maps, quantum detailed balance and Petz recovery map
• Symmetries of quantum evolutions
• Approximating Invertible Maps by Recovery Channels: Optimality and an Application to Non-Markovian Dynamics
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
• Multivariate Trace Inequalities, p-Fidelity, and Universal Recovery Beyond Tracial Settings
• Decoding general error correcting codes and the role of complementarity
• Optimal one-shot entanglement sharing
• Universal adjointation of isometry operations using conversion of quantum supermaps
• An upper bound on quantum capacity of unital channels
• Explicit decoders using fixed-point amplitude amplification based on QSVT