%0 Journal Article
%J Journal of Mathematical Physics
%D 2019
%T Every entangled state provides an advantage in classical communication
%A Bäuml, S.
%A Winter, A.
%A Yang, D.
%B Journal of Mathematical Physics
%V 60
%P 072201
%8 Jan-07-2019
%U http://aip.scitation.org/doi/10.1063/1.5091856http://aip.scitation.org/doi/pdf/10.1063/1.5091856
%! Journal of Mathematical Physics
%R 10.1063/1.5091856
%0 Journal Article
%J Problems of Information Transmission
%D 2016
%T Classical capacities of quantum channels with environment assistance
%A Karumanchi, S.
%A Mancini, S.
%A Winter, A.
%A Yang, D.
%X A quantum channel physically is a unitary interaction between an information carrying system and an environment, which is initialized in a pure state before the interaction. Conventionally, this state, as also the parameters of the interaction, is assumed to be fixed and known to the sender and receiver. Here, following the model introduced by us earlier [1], we consider a benevolent third party, i.e., a helper, controlling the environment state, and show how the helper’s presence changes the communication game. In particular, we define and study the classical capacity of a unitary interaction with helper, in two variants: one where the helper can only prepare separable states across many channel uses, and one without this restriction. Furthermore, two even more powerful scenarios of pre-shared entanglement between helper and receiver, and of classical communication between sender and helper (making them conferencing encoders) are considered.
%B Problems of Information Transmission
%V 52
%P 214–238
%8 jul
%U https://link.springer.com/article/10.1134/S0032946016030029
%R 10.1134/S0032946016030029
%0 Journal Article
%J Physical Review Letters
%D 2016
%T Entanglement and Coherence in Quantum State Merging
%A Streltsov, A.
%A Chitambar, E.
%A Rana, S.
%A Bera, N.
%A Winter, A.
%A Lewenstein, M.
%B Physical Review Letters
%V 116
%8 Jan-06-2016
%U http://link.aps.org/doi/10.1103/PhysRevLett.116.240405http://harvest.aps.org/v2/journals/articles/10.1103/PhysRevLett.116.240405/fulltexthttp://link.aps.org/accepted/10.1103/PhysRevLett.116.240405http://link.aps.org/article/10.1103/PhysRevLett.116.240405
%! Phys. Rev. Lett.
%R 10.1103/PhysRevLett.116.240405
%0 Journal Article
%J IEEE Transactions on Information Theory
%D 2016
%T On {Zero}-{Error} {Communication} via {Quantum} {Channels} in the {Presence} of {Noiseless} {Feedback}
%A Duan, R.
%A Severini, S.
%A Winter, A.
%K bipartite equivocation graph
%K Bipartite graph
%K Capacity planning
%K Choi-Kraus operators
%K coding theorem
%K commutative bipartite graph
%K Electronic mail
%K encoding
%K entanglement-assisted capacity
%K feedback
%K feedback-assisted capacity
%K feedback-assisted zero-error capacity
%K information theory
%K noiseless feedback channel
%K quantum channels
%K quantum communication
%K quantum entanglement
%K Quantum information
%K Receivers
%K Shannon's zero-error communication
%K telecommunication channels
%K unlimited quantum capacity
%K zero-error capacity
%X We initiate the study of zero-error communication via quantum channels when the receiver and the sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory with instantaneous feedback. We first show that this capacity is only a function of the linear span of Choi-Kraus operators of the channel, which generalizes the bipartite equivocation graph of a classical channel, and which we dub non-commutative bipartite graph. Then, we go on to show that the feedback-assisted capacity is non-zero (allowing for a constant amount of activating noiseless communication) if and only if the non-commutative bipartite graph is non-trivial, and give a number of equivalent characterizations. This result involves a far-reaching extension of the conclusive exclusion of quantum states. We then present an upper bound on the feedback-assisted zero-error capacity, motivated by a conjecture originally made by Shannon and proved later by Ahlswede. We demonstrate that this bound to have many good properties, including being additive and given by a minimax formula. We also prove a coding theorem showing that this quantity is the entanglement-assisted capacity against an adversarially chosen channel from the set of all channels with the same Choi-Kraus span, which can also be interpreted as the feedback-assisted unambiguous capacity. The proof relies on a generalization of the Postselection Lemma (de Finetti reduction) that allows to reflect additional constraints, and which we believe to be of independent interest. This capacity is a relaxation of the feedback-assisted zero-error capacity; however, we have to leave open the question of whether they coincide in general. We illustrate our ideas with a number of examples, including classical-quantum channels and Weyl diagonal channels, and close with an extensive discussion of open questions.
%B IEEE Transactions on Information Theory
%V 62
%P 5260–5277
%8 sep
%R 10.1109/TIT.2016.2562580
%0 Journal Article
%J Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
%D 2013
%T The structure of Renyi entropic inequalities
%A Linden, N.
%A Mosonyi, M.
%A Winter, A.
%B Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
%V 469
%P 20120737
%8 10/2013
%N 2158472222
%! Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
%R 10.1098/rspa.2012.0737