Decoding quantum information via the Petz recovery map

DOI10.1063/1.4961515MaRDI QIDQ2820905zbMATH OpenOpenAlexFDO

Authors Salman Beigi, Nilanjana Datta, Felix Leditzky

Publication date 12 September 2016

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.04449

zbMATH Keywords

quantum communication

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60) Bounds on codes (94B65)

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

Review text

It is known that if we use a quantum memory-less channel, \(N\) with probability of error \(\varepsilon\) \(n\) times, then the amount of qubits that can be sent is \(Q^{n,\varepsilon}(N)=n\cdot I_c(N)+o(n)\). The authors show that \(Q^{n,\varepsilon}(N)\geq n\cdot I_c(N)+\sqrt{n\cdot V_\varepsilon(N)}\cdot \Phi^{-1}(\varepsilon)+O(\log(n))\) for some characteristic \(V_\varepsilon(N)\), where \(\Phi^{-1}\) is an inverse function to the cumulative distribution function of the standard Gaussian distribution. Interestingly, the corresponding lower bound has the same form as for the classical communication channels.NEWLINENEWLINEIn contrast to the previous purely existential proofs of similar asymptotic properties, the new result uses an explicitly defined decoder -- namely, Petz recovery map. For this decoder, it was proven that the average error in sending an ensemble of commuting states is at most twice the corresponding minimal possible error.

Recommendations

• Recoverability in quantum information theory
• Quantum information set decoding algorithms
• Universal recovery maps and approximate sufficiency of quantum relative entropy
• Entanglement wedge reconstruction using the Petz map
• Recovery map for fermionic Gaussian channels
• scientific article; zbMATH DE number 5582982
• Information and the Reconstruction of Quantum Physics
• Approximate Petz recovery from the geometry of density operators
• Improved quantum information set decoding
• Hybrid decoding -- classical-quantum trade-offs for information set decoding

Cites work

• A Decoupling Approach to the Quantum Capacity
• A Fully Quantum Asymptotic Equipartition Property
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• A Mathematical Theory of Communication
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Capacities of Quantum Erasure Channels
• Channel Coding Rate in the Finite Blocklength Regime
• Distilling entanglement from arbitrary resources
• Duality Between Smooth Min- and Max-Entropies
• General teleportation channel, singlet fraction, and quasidistillation
• scientific article; zbMATH DE number 1120256 (Why is no real title available?)
• scientific article; zbMATH DE number 3213251 (Why is no real title available?)
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• On quantum fidelities and channel capacities
• On quantum Rényi entropies: a new generalization and some properties
• One-shot decoupling
• Quantum Achievability Proof via Collision Relative Entropy
• Quantum conditional mutual information and approximate Markov chains
• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• Second-order asymptotics for quantum hypothesis testing
• Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
• Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS
• Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The apex of the family tree of protocols: optimal rates and resource inequalities
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• The Operational Meaning of Min- and Max-Entropy
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• The Quantum Capacity of Channels With Arbitrarily Correlated Noise
• “Pretty Strong” Converse for the Quantum Capacity of Degradable Channels

Cited in

(9)

• Improved quantum information set decoding
• Position-based coding and convex splitting for private communication over quantum channels
• Approximate Petz recovery from the geometry of density operators
• Achieving the Holevo bound via a bisection decoding protocol
• Entanglement-assisted private communication over quantum broadcast channels
• Sequential decoding of a general classical-quantum channel
• Multivariate trace inequalities, p-fidelity, and universal recovery beyond tracial settings
• Petz recovery maps for qudit quantum channels
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

This page was built for publication: Decoding quantum information via the Petz recovery map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820905)