Advantage of Hardy's Nonlocal Correlation in Reverse Zero-Error Channel
Coding
- URL: http://arxiv.org/abs/2303.06848v2
- Date: Fri, 3 Nov 2023 00:34:01 GMT
- Title: Advantage of Hardy's Nonlocal Correlation in Reverse Zero-Error Channel
Coding
- Authors: Mir Alimuddin, Ananya Chakraborty, Govind Lal Sidhardh, Ram Krishna
Patra, Samrat Sen, Snehasish Roy Chowdhury, Sahil Gopalkrishna Naik, Manik
Banik
- Abstract summary: Hardy's argument constitutes an elegant proof of quantum nonlocality.
We apply Hardy's nonlocal correlations in two-party communication setup.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Hardy's argument constitutes an elegant proof of quantum nonlocality. In this
work, we report an exotic application of Hardy's nonlocal correlations in
two-party communication setup. We come up with a task, wherein a positive
payoff can be through an $1$ bit of communication from the sender to the
receiver if and only if the communication channel is assisted with a
no-signaling correlation exhibiting Hardy's nonlocality. This further prompts
us to establish a counter-intuitive result in correlation assisted reverse
zero-error channel coding scenario, where the aim is to simulate a higher
input-output noisy classical channel by a lower input-output noiseless one in
assistance with pre-shared correlations. We show that there exist such reverse
zero-error channel simulation tasks where non-maximally entangled states are
preferable over the assistance with a maximally entangled state, even when the
former states carry an arbitrarily small amount of entanglement. Our work thus
establishes that within the operational paradigm of local operations and
limited classical communication the structure of entangled resources is even
more complex to characterize.
Related papers
- Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks [0.0]
We reveal key connections between non-locality and advantage in correlation-assisted classical communication.<n>We introduce wire-reading, which leverages the readability of classical messages to demonstrate advantageous assistance of non-local correlations.<n>We reveal quantum advantage in these tasks, including qutrit over qubit entanglement advantage.
arXiv Detail & Related papers (2025-07-14T21:58:07Z) - Nonlocality-Assisted Enhancement of Error-Free Communication in Noisy Classical Channels [0.0]
noisy classical channels with zero zero-error capacity can transmit one bit of information when assisted by 2-2-m nonlocal correlations.
We identify channels with zero zero-error capacity that can nonetheless perfectly transmit log m bits of information when assisted by corresponding extremal nonlocal correlations.
arXiv Detail & Related papers (2024-12-06T05:01:47Z) - 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) - Entanglement sharing across a damping-dephasing channel [2.249916681499244]
Entment distillation is a fundamental information processing task.
Noise experienced by quantum communication and computing platforms occurs not only in the form of Pauli noise but also non-Pauli noise.
We propose a distillation scheme that completely isolates away the damping noise.
arXiv Detail & Related papers (2024-05-10T03:51:40Z) - One-time Pad Encryption Model for Non-local Correlations [0.0]
We present a cryptographic-inspired framework for modeling Bell nonlocal correlations.
Drawing inspiration from the renowned De Broglie-Bohm theory, we conceptualize nonlocal boxes as realistic systems featuring instantaneous signaling.
arXiv Detail & Related papers (2023-07-07T05:35:04Z) - Non-Local and Quantum Advantages in Network Coding for Multiple Access Channels [12.798560005546259]
We consider two-sender, one-receiver communication over a memoryless multiple-access channel without feedback.<n>We present the capacity region when senders employ cooperative encoding with quantum and nonlocal resources.<n>We show that nonlocal and quantum resources for cooperative encoding enable higher sum capacities over local ones.
arXiv Detail & Related papers (2023-04-21T07:54:52Z) - Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
We study channel simulation under common randomness assistance in the finite-blocklength regime.
We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
arXiv Detail & Related papers (2022-12-22T13:08:55Z) - Deep Reinforcement Learning for IRS Phase Shift Design in
Spatiotemporally Correlated Environments [93.30657979626858]
We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion.
We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
arXiv Detail & Related papers (2022-11-02T22:07:36Z) - Semantic-Native Communication: A Simplicial Complex Perspective [50.099494681671224]
We study semantic communication from a topological space perspective.
A transmitter first maps its data into a $k$-order simplicial complex and then learns its high-order correlations.
The receiver decodes the structure and infers the missing or distorted data.
arXiv Detail & Related papers (2022-10-30T22:33:44Z) - Fundamental Limits of Communication Efficiency for Model Aggregation in
Distributed Learning: A Rate-Distortion Approach [54.311495894129585]
We study the limit of communication cost of model aggregation in distributed learning from a rate-distortion perspective.
It is found that the communication gain by exploiting the correlation between worker nodes is significant for SignSGD.
arXiv Detail & Related papers (2022-06-28T13:10:40Z) - HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised
Relation Extraction [60.80849503639896]
Unsupervised relation extraction aims to extract the relationship between entities from natural language sentences without prior information on relational scope or distribution.
We propose a novel contrastive learning framework named HiURE, which has the capability to derive hierarchical signals from relational feature space using cross hierarchy attention.
Experimental results on two public datasets demonstrate the advanced effectiveness and robustness of HiURE on unsupervised relation extraction when compared with state-of-the-art models.
arXiv Detail & Related papers (2022-05-04T17:56:48Z) - Significance of Fidelity Deviation in Continuous Variable Teleportation [0.0]
We show that CV states can be better characterized by considering both average fidelity and fidelity deviation.
We shed light on the performance of the teleportation protocol in two different input scenarios.
arXiv Detail & Related papers (2022-03-13T15:39:24Z) - Unsupervised Sound Localization via Iterative Contrastive Learning [106.56167882750792]
We propose an iterative contrastive learning framework that requires no data annotations.
We then use the pseudo-labels to learn the correlation between the visual and audio signals sampled from the same video.
Our iterative strategy gradually encourages the localization of the sounding objects and reduces the correlation between the non-sounding regions and the reference audio.
arXiv Detail & Related papers (2021-04-01T07:48:29Z) - Overhead for simulating a non-local channel with local channels by
quasiprobability sampling [0.8206877486958002]
We provide a framework for a resource reduction suitable for first-generation quantum devices.
This work develops a framework for a resource reduction suitable for first-generation quantum devices.
arXiv Detail & Related papers (2020-06-19T15:04:26Z)
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.