Decoding quantum information via the Petz recovery map
Reads0
Chats0
TLDR
A lower bound on the maximum number of qubits, Qn, e(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold e is obtained.Abstract:
We obtain a lower bound on the maximum number of qubits, $Q^{n, \varepsilon}({\mathcal{N}})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, 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}({\mathcal{N}})$ scales as $\sqrt{n}$.read more
Citations
More filters
Journal ArticleDOI
Converse bounds for private communication over quantum channels
TL;DR: In this article, a meta-converse bound on the relative entropy of entanglement of a quantum channel has been established, which is a strong converse bound for private communication.
Journal ArticleDOI
Gaussian Hypothesis Testing and Quantum Illumination.
TL;DR: A formula is established that characterizes the decay rate of the minimal type-II error probability in a quantum hypothesis test of two Gaussian states given a fixed constraint on the type-I error probability.
Posted Content
Principles of Quantum Communication Theory: A Modern Approach.
Sumeet Khatri,Mark M. Wilde +1 more
TL;DR: This work adopts an information-theoretic perspective throughout and gives a comprehensive account of fundamental results in quantum communication theory from the past decade, with an emphasis on the modern one-shot-to-asymptotic approach that underlies much of today's state-of-the-art research in this field.
Journal ArticleDOI
Semidefinite Programming Converse Bounds for Quantum Communication
Xin Wang,Kun Fang,Runyao Duan +2 more
TL;DR: The authors' SDP strong converse bound is weaker than the Rains information, but it is efficiently computable for general quantum channels, which means the fidelity of any sequence of codes with a rate exceeding this bound will vanish exponentially fast as the number of channel uses increases.
Journal ArticleDOI
Entropy Accumulation With Improved Second-Order Term
Frédéric Dupuis,Omar Fawzi +1 more
TL;DR: In this article, the authors improved the second-order sublinear term of the von Neumann entropy accumulation theorem and proved various bounds on the divergence variance, which might be of independent interest.
References
More filters
Journal ArticleDOI
A mathematical theory of communication
TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Charles H. Bennett,Gilles Brassard,Claude Crépeau,Richard Jozsa,Asher Peres,William K. Wootters +5 more
TL;DR: An unknown quantum state \ensuremath{\Vert}\ensure Math{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen (EPR) correlations.
Journal ArticleDOI
Channel Coding Rate in the Finite Blocklength Regime
TL;DR: It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.
Journal ArticleDOI
Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
Hoi-Kwong Lo,H. F. Chau +1 more
TL;DR: The problem is solved by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure.
Journal ArticleDOI
The “transition probability” in the state space of a ∗-algebra
TL;DR: In this paper, the authors derived properties of this straightforward generalization of the quantum mechanical transition probability and gave, in some important cases, an explicit expression for the transition probability P(ω,ϱ) in terms of the spectrum of all the numbers |(x,y)|2 taken over all such realizations.