اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComparison of Quantum Channels by Superchannels
136
0
0.0
(
0
)
تأليف
Gilad Gour
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of quantum majorization from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels, and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.
قيم البحث
اقرأ أيضاً
Optical channels, such as fibers or free-space links, are ubiquitous in todays telecommunication networks. They rely on the electromagnetic field associated with photons to carry information from one point to another in space. As a result, a complete
physical model of these channels must necessarily take quantum effects into account in order to determine their ultimate performances. Specifically, Gaussian photonic (or bosonic) quantum channels have been extensively studied over the past decades given their importance for practical purposes. In spite of this, a longstanding conjecture on the optimality of Gaussian encodings has yet prevented finding their communication capacity. Here, this conjecture is solved by proving that the vacuum state achieves the minimum output entropy of a generic Gaussian bosonic channel. This establishes the ultimate achievable bit rate under an energy constraint, as well as the long awaited proof that the single-letter classical capacity of these channels is additive. Beyond capacities, it also has broad consequences in quantum information sciences.
We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity, but replaci
ng the relative entropy with the Hoeffding distance. Similarly, our upper bound is in terms of a quantity obtained by replacing the relative entropy with the recently introduced max-relative entropy in the definition of the divergence radius of a channel.
We consider sequences of random quantum channels defined using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through te
nsor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to formulate some conjectures about the regularized minimum output entropy.
Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${cal E}$, we introduce the concept of its quasi-inverse as a map
${cal E}^{qi}$ which when composed with ${cal E}$ increases its average input-output fidelity in an optimal way. The channel ${cal E}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
Quantum Private Comparison (QPC) allows us to protect private information during its comparison. In the past various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here we tackle the problem of QPC un
der noise. We analyze the EPR-based protocol under depolarizing noise, bit flip and phase flip noise. We show how noise affects the robustness of the EPR-based protocol. We then present a straightforward protocol based on CSS codes to perform QPC which is robust against noise and secure under general attacks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
