Advantage of Hardy's Nonlocal Correlation in Reverse Zero-Error Channel Coding

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.