Codes for entanglement-assisted classical communication

• URL: http://arxiv.org/abs/2310.19774v1
• Date: Mon, 30 Oct 2023 17:44:33 GMT
• Title: Codes for entanglement-assisted classical communication
• Authors: Tushita Prasad, Markus Grassl
• Abstract summary: Scheme transmits classical information over a quantum channel assisted by maximally entangled pairs. We use direct coding or super-dense coding based on the amount of entanglement available.
• Score: 2.0305676256390934
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a new entanglement assisted classical communication scheme which can correct a fixed number of erasures or errors. The scheme transmits classical information over a quantum channel assisted by maximally entangled pairs. We establish a general framework to accomplish such a task by reducing it to a classical problem. We use direct coding or super-dense coding based on the amount of entanglement available. This results in a combination of two classical channels. For this scenario we present an explicit encoding scheme. We compare our scheme with specific bounds and find certain ranges of parameters where the scheme is optimal. The presented scheme can easily be realized. It requires only the implementation of super-dense coding which has been demonstrated successfully in experiments.

Related papers

• Quantum-Amplified Simultaneous Quantum-Classical Communications [0.2982610402087727]
  We investigate how to minimally alter classical FSO systems to provide some element of quantum communication coexisting with classical communications. We show how this is indeed the case, but only at the cost of some additional receiver complexity, relative to standalone quantum communications.
  arXiv  Detail & Related papers  (2024-05-15T06:44:01Z)
• Simple Information Processing Tasks with Unbounded Quantum Advantage [0.0]
  We show that it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. No finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems.
  arXiv  Detail & Related papers  (2023-08-15T12:07:31Z)
• 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)
• Adaptive advantage in entanglement-assisted communications [0.0]
  Entanglement-assisted classical communication protocols usually consist of two successive rounds. We show that adaptive protocols improve the success probability in Random Access Codes. We briefly discuss extension of these ideas to scenarios involving quantum communication.
  arXiv  Detail & Related papers  (2022-03-10T13:54:02Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• Quasi-Equivalence Discovery for Zero-Shot Emergent Communication [63.175848843466845]
  We present a novel problem setting and the Quasi-Equivalence Discovery algorithm that allows for zero-shot coordination (ZSC) We show that these two factors lead to unique optimal ZSC policies in referential games. QED can iteratively discover the symmetries in this setting and converges to the optimal ZSC policy.
  arXiv  Detail & Related papers  (2021-03-14T23:42:37Z)
• Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity [2.8453697351728438]
  Entanglement-assisted communication (EACOMM) leverages entanglement pre-shared by communication parties to boost the rate of classical information transmission. We show that EACOMM beats the Holevo-Schumacher-Westmoreland capacity of classical communication by up to 14.6%. Our work opens a route to provable quantum advantages in a wide range of quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-01-19T06:41:09Z)
• 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)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.