Communication Over Entanglement-Breaking Channels With Unreliable Entanglement Assistance

• URL: http://arxiv.org/abs/2305.17692v3
• Date: Tue, 3 Oct 2023 11:04:54 GMT
• Title: Communication Over Entanglement-Breaking Channels With Unreliable Entanglement Assistance
• Authors: Uzi Pereg
• Abstract summary: Entanglement assistance can improve communication rates significantly. Yet, its generation is susceptible to failure. We show that combining entanglement-assisted and unassisted coding is suboptimal.
• Score: 18.93141709546733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement assistance can improve communication rates significantly. Yet, its generation is susceptible to failure. The unreliable assistance model accounts for those challenges. Previous work provided an asymptotic formula that outlines the tradeoff between the unassisted and excess rates from entanglement assistance. We derive a full characterization for entanglement-breaking channels, and show that combining entanglement-assisted and unassisted coding is suboptimal. From a networking perspective, this finding is nontrivial and highlights a quantum behavior arising from superposition.

Related papers

• Quantum channel coding: Approximation algorithms and strong converse exponents [4.757470449749876]
  We study relaxations of entanglement-assisted quantum channel coding. Non-signaling assistance and the meta-converse are equivalent in terms of success probabilities.
  arXiv  Detail & Related papers  (2024-10-28T15:28:14Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Error exponent of activated non-signaling assisted classical-quantum channel coding [12.221087476416056]
  We find that the optimal exponent--also called reliability function--is equal to the well-known sphere packing bound. Remarkably, there is no critical rate and our characterization remains tight for arbitrarily low rates below the capacity.
  arXiv  Detail & Related papers  (2024-10-01T21:26:17Z)
• Secure Communication with Unreliable Entanglement Assistance [18.93141709546733]
  Unreliable entanglement assistance is considered with secure communication. The communication setting of unreliable assistance, without security aspects, was originally motivated by the extreme photon loss in practical communication systems. An achievable secrecy rate region is derived for general quantum wiretap channels, and a multi-letter secrecy capacity formula for the special class of degraded channels.
  arXiv  Detail & Related papers  (2024-01-23T15:52:35Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Communication with Unreliable Entanglement Assistance [78.7611537027573]
  Entanglement resources can increase transmission rates substantially. In order to generate entanglement for optical communication, the transmitter first prepares an entangled photon pair locally. Without feedback, the transmitter does not know whether the entangled photon has reached the receiver.
  arXiv  Detail & Related papers  (2021-12-16T22:24:56Z)
• Quantifying Quantumness of Channels Without Entanglement [0.0]
  We show that quantum channels breaking entanglement, incompatibility, or nonlocality are related to tests of macrorealism. A hierarchy of quantum non-breaking channels is derived, akin to the existing hierarchy relations for temporal and spatial quantum correlations.
  arXiv  Detail & Related papers  (2021-06-30T02:48:04Z)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  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.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.