Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Quantum flags, and new bounds on the quantum capacity of the depolarizing channel (1911.01977v3)

Published 5 Nov 2019 in quant-ph

Abstract: A new bound for the quantum capacity of the $d$-dimensional depolarizing channels is presented. Our derivation makes use of a flagged extension of the map where the receiver obtains a copy of a state $\sigma_0$ whenever the messages are transmitted without errors, and a copy of a state $\sigma_1$ when instead the original state gets fully depolarized. By varying the overlap between the flags states, the resulting transformation nicely interpolates between the depolarizing map (when $\sigma_0=\sigma_1$), and the $d$-dimensional erasure channel (when $\sigma_0$ and $\sigma_1$ have orthogonal support). In our analysis we compute the product-state classical capacity, the entanglement assisted capacity and, under degradability conditions, the quantum capacity of the flagged channel. From this last result we get the upper bound for the depolarizing channel, which by a direct comparison appears to be tighter than previous available results for $d>2$, and for $d=2$ it is tighter in an intermediate regime of noise. In particular, in the limit of large $d$ values, our findings presents a previously unnoticed $\mathcal O(1)$ correction.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.