Contextuality in entanglement-assisted one-shot classical communication

• URL: http://arxiv.org/abs/2006.00469v4
• Date: Wed, 12 Oct 2022 08:49:02 GMT
• Title: Contextuality in entanglement-assisted one-shot classical communication
• Authors: Shiv Akshar Yadavalli, Ravi Kunjwal
• Abstract summary: In the zero-error regime, entanglement can increase the oneshot zero-error capacity of a family of classical channels. We show that preparation contextuality powers the quantum advantage in this task increasing the one-shot success probability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of entanglement-assisted one-shot classical communication. In the zero-error regime, entanglement can increase the one-shot zero-error capacity of a family of classical channels following the strategy of Cubitt et al., Phys. Rev. Lett. 104, 230503 (2010). This strategy uses the Kochen-Specker theorem which is applicable only to projective measurements. As such, in the regime of noisy states and/or measurements, this strategy cannot increase the capacity. To accommodate generically noisy situations, we examine the one-shot success probability of sending a fixed number of classical messages. We show that preparation contextuality powers the quantum advantage in this task, increasing the one-shot success probability beyond its classical maximum. Our treatment extends beyond Cubitt et al. and includes, for example, the experimentally implemented protocol of Prevedel et al., Phys. Rev. Lett. 106, 110505 (2011). We then show a mapping between this communication task and a corresponding nonlocal game. This mapping generalizes the connection with pseudotelepathy games previously noted in the zero-error case. Finally, after motivating a constraint we term context-independent guessing, we show that contextuality witnessed by noise-robust noncontextuality inequalities obtained in R. Kunjwal, Quantum 4, 219 (2020), is sufficient for enhancing the one-shot success probability. This provides an operational meaning to these inequalities and the associated hypergraph invariant, the weighted max-predictability, introduced in R. Kunjwal, Quantum 3, 184 (2019). Our results show that the task of entanglement-assisted one-shot classical communication provides a fertile ground to study the interplay of the Kochen-Specker theorem, Spekkens contextuality, and Bell nonlocality.

Related papers

• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication [0.0]
  We show that quantum strategies without any shared entanglement can outperform the classical ones.<n>Explicit quantum protocols are studied that violate these inequalities.<n>We prove that when each sender has a binary input, the quantum advantage grows with the number of senders.
  arXiv  Detail & Related papers  (2025-06-09T12:38:58Z)
• Kochen-Specker for many qubits and the classical limit [55.2480439325792]
  It is shown that quantum and classical predictions converge as the number of qubits is increases to the macroscopic scale. This way to explain the classical limit concurs with, and improves, a result previously reported for GHZ states.
  arXiv  Detail & Related papers  (2024-11-26T22:30:58Z)
• Kolmogorovian Censorship, Predictive Incompleteness, and the locality loophole in Bell experiments [0.0]
  In previous articles we argued that if both influence at a distance and super-determinism are considered unacceptable to explain the results of loophole-free Bell tests, a third way is available. 'Predictive incompleteness' tells that the usual quantum state $psi$ is incomplete, as long as the measurement context has not been specified.
  arXiv  Detail & Related papers  (2024-05-06T06:20:54Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Cone-Restricted Information Theory [4.358456799125693]
  We show which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. We present parallel results for the extended conditional min-entropy. In doing so, we extend the notion of k-superpositive channels to superchannels.
  arXiv  Detail & Related papers  (2022-06-09T06:27:48Z)
• 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)
• A classical formulation of quantum theory? [0.0]
  We obtain quantum theory only by combining a collection of restricted classical pictures. Our main challenge in this paper is to find a simple way of characterizing the allowed sets of classical pictures. We present one promising approach to this problem and show how it works out for the case of a single qubit.
  arXiv  Detail & Related papers  (2022-01-10T20:06:12Z)
• Information Causality without concatenation [0.5043455303941253]
  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.
  arXiv  Detail & Related papers  (2021-01-29T18:05:40Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum advantages of communication complexity from Bell nonlocality [3.1113932875711305]
  We present a method to construct CC problems from Bell tests in a graph-theoretic way. By pre-sharing entangled states, the success probability will exceed that for arbitrary classical strategy. The non-signaling protocol based on Popescu-Rohrlich box is also discussed.
  arXiv  Detail & Related papers  (2020-04-10T16:32:14Z)
• 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.