Upper bound on the classical capacity of a quantum channel assisted by classical feedback

Author(s):  
Dawei Ding ◽  
Sumeet Khatri ◽  
Yihui Quek ◽  
Peter W. Shor ◽  
Xin Wang ◽  
...  
2002 ◽  
Vol 2 (5) ◽  
pp. 367-378
Author(s):  
V.N. Gorbachev ◽  
A.I. Zhiliba ◽  
A.I. Trubilko ◽  
A.A. Rodichkina

A set of protocols for teleportation and dense coding schemes based on a multiparticle quantum channel, represented by the $N$-particle entangled states of the GHZ class, is introduced. Using a found representation for the GHZ states, it was shown that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is $N/N-1$. Within the context of our schemes it becomes clear that there is no one-to one correspondence between teleportation and dense coding schemes in comparison when the EPR channel is exploited. A set of schemes, for which two additional operations as entanglement and disentanglement are permitted, is considered.


2011 ◽  
Vol 57 (12) ◽  
pp. 8114-8126 ◽  
Author(s):  
Toby S. Cubitt ◽  
Jianxin Chen ◽  
Aram W. Harrow

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 1028
Author(s):  
Dariusz Kurzyk ◽  
Łukasz Pawela ◽  
Zbigniew Puchała

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi–Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.


1997 ◽  
Vol 236 (1-2) ◽  
pp. 1-4 ◽  
Author(s):  
Masahide Sasaki ◽  
Kentaro Kato ◽  
Masayuki Izutsu ◽  
Osamu Hirota

2015 ◽  
Vol 13 (01) ◽  
pp. 1550005
Author(s):  
Alireza Nadem Ghazvini ◽  
Seyed Vahab AL-Din Makki ◽  
Shahpoor Alirezaee

The rate region for transmission of classical information over a quantum broadcast channel and an inner bound for the rate of transmission of private classical information over a single-user quantum channel have been achieved in the previous paper. In this work, we extended the proofs of them to obtain an achievable private classical capacity for a two receivers quantum broadcast channel.


2017 ◽  
Vol 17 (5&6) ◽  
pp. 380-398
Author(s):  
Ching-Yi Lai ◽  
Runyao Duan

Duan and Winter studied the one-shot zero-error classical capacity of a quantum channel assisted by quantum non-signalling correlations, and formulated this problem as a semidefinite program depending only on the Kraus operator space of the channel. For the class of classical-quantum channels, they showed that the asymptotic zero-error classical capacity assisted by quantum non-signalling correlations, minimized over all classicalquantum channels with a confusability graph G, is exactly log ϑ(G), where ϑ(G) is the celebrated Lov´asz theta function. In this paper, we show that the one-shot capacity for a classical-quantum channel, induced from a circulant graph G defined by equal-sized cyclotomic cosets, is logbϑ(G)c, which further implies that its asymptotic capacity is log ϑ(G). This type of graphs include the cycle graphs of odd length, the Paley graphs of prime vertices, and the cubit residue graphs of prime vertices. Examples of other graphs are also discussed. This gives Lov´asz ϑ function another operational meaning in zero-error classical-quantum communication.


2012 ◽  
Vol 12 (1&2) ◽  
pp. 138-148
Author(s):  
Cheng Lu ◽  
Jianxin Chen ◽  
Runyao Duan

We prove a lower bound on the $q$-maximal fidelities between two quantum channels $\E_0$ and $\E_1$ and an upper bound on the $q$-maximal fidelities between a quantum channel $\E$ and an identity $\I$. Then we apply these two bounds to provide a simple sufficient and necessary condition for sequential perfect distinguishability between $\E$ and $\I$ and provide both a lower bound and an upper bound on the minimum number of queries required to sequentially perfectly discriminating $\E$ and $\I$. Interestingly, in the $2$-dimensional case, both bounds coincide. Based on the optimal perfect discrimination protocol presented in \cite{DFY09}, we can further generalize the lower bound and upper bound to the minimum number of queries to perfectly discriminating $\E$ and $I$ over all possible discrimination schemes. Finally the two lower bounds are shown remain working for perfectly discriminating general two quantum channels $\E_0$ and $\E_1$ in sequential scheme and over all possible discrimination schemes respectively.


Sign in / Sign up

Export Citation Format

Share Document