Permutation Enhances Classical Communication Assisted by Entangled States

• URL: http://arxiv.org/abs/2001.01845v2
• Date: Thu, 9 Jan 2020 09:08:12 GMT
• Title: Permutation Enhances Classical Communication Assisted by Entangled States
• Authors: Kun Wang and Masahito Hayashi
• Abstract summary: We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
• Score: 67.12391801199688
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two endpoints of this formula are the Holevo capacity (without entanglement assistance) and the entanglement-assisted capacity (with unlimited entanglement assistance). What's more, we show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. We prove that the difference between the assisted capacity and the Holevo capacity is upper bounded by the discord of formation of the preshared state. As examples, we derive analytically the classical capacity of various quantum channels of interests. Our result witnesses the power of random permutation in classical communication, whenever entanglement assistance is available.

Related papers

• On Simultaneous Information and Energy Transmission through Quantum Channels [15.387256204743407]
  We introduce the quantum-classical analogue of the capacity-power function. We generalize results in classical information theory for transmitting classical information through noisy channels.
  arXiv  Detail & Related papers  (2023-09-24T16:46:47Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered. We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters. Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Classical analogue of quantum superdense coding and communication advantage of a single quantum system [0.0]
  We show that a qubit communication without any assistance of classical shared randomness can achieve the goal. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces.
  arXiv  Detail & Related papers  (2022-02-14T15:29:59Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• Capacities of Gaussian Quantum Channels with Passive Environment Assistance [0.0]
  Passive environment assisted communication takes place via a quantum channel modeled as a unitary interaction between the information carrying system and an environment. We consider both quantum communication and classical communication with helper, as well as classical communication with free classical coordination between sender and helper.
  arXiv  Detail & Related papers  (2021-01-03T10:33:43Z)
• Explicit construction of optimal witnesses for input-output correlations attainable by quantum channels [3.441021278275805]
  We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
  arXiv  Detail & Related papers  (2020-09-02T07:34:23Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• Quantum Advantage for Shared Randomness Generation [0.0]
  We show that quantum systems provide an advantage over their classical counterpart. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.
  arXiv  Detail & Related papers  (2020-01-07T05:02:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.