Adaptive advantage in entanglement-assisted communications

• URL: http://arxiv.org/abs/2203.05372v2
• Date: Tue, 14 Jun 2022 18:16:23 GMT
• Title: Adaptive advantage in entanglement-assisted communications
• Authors: Jef Pauwels, Stefano Pironio, Emmanuel Zambrini Cruzeiro, Armin Tavakoli
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we allow the receiver to wait for the arrival of the sender's message before measuring his share of the entangled state. We first show that such adaptive protocols improve the success probability in Random Access Codes. Second, we show that once adaptive measurements are used, an entanglement-assisted bit becomes a strictly stronger resource than a qubit in prepare-and-measure scenarios. We briefly discuss extension of these ideas to scenarios involving quantum communication and identify resource inequalities.

Related papers

• Batch Selection and Communication for Active Learning with Edge Labeling [54.64985724916654]
  Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD) This work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD)
  arXiv  Detail & Related papers  (2023-11-14T10:23:00Z)
• Codes for entanglement-assisted classical communication [1.7188280334580197]
  Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. We introduce a new EACC scheme capable of correcting a fixed number of erasures/errors. It can be adjusted to the available amount of entanglement and sends classical information over a quantum channel.
  arXiv  Detail & Related papers  (2023-10-30T17:44:33Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Classical Cost of Transmitting a Qubit [0.0]
  We show that the statistics obtained in any quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. In particular, two bits of communication are enough to simulate all quantum correlations associated to arbitrary local POVMs applied to any entangled two-qubit state.
  arXiv  Detail & Related papers  (2022-07-05T18:06:45Z)
• Interplays between classical and quantum entanglement-assisted communication scenarios [0.0]
  We show that, in scenarios where entanglement is a free resource, quantum messages are equivalent to classical ones with twice the capacity. We also prove that, in such scenarios, it is always advantageous for the parties to share entangled states of greater dimension than the transmitted message.
  arXiv  Detail & Related papers  (2022-05-10T21:09:16Z)
• Quantum secure direct communication with private dense coding using general preshared quantum state [59.99354397281036]
  We study secure direct communication by using a general preshared quantum state and a generalization of dense coding. For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
  arXiv  Detail & Related papers  (2021-12-30T16:12:07Z)
• Entanglement in prepare-and-measure scenarios: many questions, a few answers [0.0]
  Entanglement and quantum communication are paradigmatic resources in quantum information science. Correlations due to entanglement when communication is absent have been studied in Bell scenarios. We focus on entanglement-assisted prepare-and-measure scenarios.
  arXiv  Detail & Related papers  (2021-08-01T12:22:00Z)
• 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)
• 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.