Information Causality without concatenation

• URL: http://arxiv.org/abs/2101.12710v1
• Date: Fri, 29 Jan 2021 18:05:40 GMT
• Title: Information Causality without concatenation
• Authors: Nikolai Miklin and Marcin Paw{\l}owski
• Abstract summary: Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity. We show that concatenation can be successfully replaced by limits on the communication channel capacity.
• Score: 0.5043455303941253
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity, even if the sender and the receiver have access to a source of nonlocal correlations. This principle can be used to bound the nonlocality of quantum mechanics without resorting to its full formalism, with a notable example of reproducing the Tsirelson's bound of the Clauser-Horne-Shimony-Holt inequality. Despite being promising, the latter result found little generalization to other Bell inequalities because of the limitations imposed by the process of concatenation, in which several nonsignaling resources are put together to produce tighter bounds. In this work, we show that concatenation can be successfully replaced by limits on the communication channel capacity. It allows us to re-derive and, in some cases, significantly improve all the previously known results in a simpler manner and apply the Information Causality principle to previously unapproachable Bell scenarios.

Related papers

• Orthogonality Broadcasting and Quantum Position Verification [3.549868541921029]
  We introduce the study of "orthogonality broadcasting" We provide a new method for establishing error bounds in the no pre-shared entanglement model. Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.
  arXiv  Detail & Related papers  (2023-11-01T17:37:20Z)
• Information causality as a tool for bounding the set of quantum correlations [0.0]
  Information causality was initially proposed as a physical principle aimed at deriving predictions of quantum mechanics on the type of correlations observed in the Bell experiment. We present a technique for obtaining inequalities from information causality, bounding the set of physical correlations in any Bell scenario.
  arXiv  Detail & Related papers  (2023-08-04T17:40:53Z)
• 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)
• Information causality in multipartite scenarios [1.0312968200748118]
  We report a new formulation of the information causality principle in multipartite scenarios. We prove that such inequalities hold for all quantum resources, and forbid some stronger-than-quantum ones.
  arXiv  Detail & Related papers  (2022-12-11T20:32:21Z)
• 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)
• 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)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• 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)
• Quantum-enabled communication without a phase reference [1.14219428942199]
  A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. We show that quantum communication and entanglement-assisted communication without a phase reference are possible, when a short-time memory effect is present.
  arXiv  Detail & Related papers  (2020-10-22T18:19:00Z)
• 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)
• 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.