The prevailing wisdom asserts that in the Holevo Frenkel Weiner (HFW) framework of communication tasks, a qubit offers no advantage over a c bit unless additional quantum resources are supplied or the classical shared randomness (SR) is restricted. In contrast, we establish the supremacy of qubit communication in the HFW framework when additional quantum resources, such as entanglement or measurement incompatibility are not injected and SR is a free resource. We consider a prepare-measure scenario where the sender, Alice, prepares six states subject to a specific cryptographic constraint, and the receiver, Bob, performs a three-outcome measurement. Such a constraint on preparation impacts the power of qubit communication quite differently than that of c-bit communication, ultimately giving rise to the quantum advantage. We introduce a witness capable of distinguishing quantum strategies that lie beyond the set of possible classical strategies and demonstrate the optimal quantum advantage. {As an application, we demonstrate the generation of certified randomness without requiring any seed randomness, since Bob has no input.} We further analyse the robustness of the witness and show that the advantage persists in noisy situations, making it suitable for experimental realisation. Finally, we demonstrate that Bob's three outcome qubit positive operator valued-measure (POVMs) has a distinct capability of detecting coherence, which can be regarded as the non-classical feature responsible for showcasing the quantum advantage.
The prevailing wisdom asserts that in the Holevo Frenkel Weiner (HFW) framework of communication tasks, a qubit offers no advantage over a c bit unless additional quantum resources are supplied or the classical shared randomness (SR) is restricted. In contrast, we establish the supremacy of qubit communication in the HFW framework when additional quantum resources, such as entanglement or measurement incompatibility are not injected and SR is a free resource. We consider a prepare-measure scenario where the sender, Alice, prepares six states subject to a specific cryptographic constraint, and the receiver, Bob, performs a three-outcome measurement. Such a constraint on preparation impacts the power of qubit communication quite differently than that of c-bit communication, ultimately giving rise to the quantum advantage. We introduce a witness capable of distinguishing quantum strategies that lie beyond the set of possible classical strategies and demonstrate the optimal quantum advantage. {As an application, we demonstrate the generation of certified randomness without requiring any seed randomness, since Bob has no input.} We further analyse the robustness of the witness and show that the advantage persists in noisy situations, making it suitable for experimental realisation. Finally, we demonstrate that Bob's three outcome qubit positive operator valued-measure (POVMs) has a distinct capability of detecting coherence, which can be regarded as the non-classical feature responsible for showcasing the quantum advantage.
Conventional wisdom asserts that measurement incompatibility is necessary for revealing the non-locality and contextuality. In contrast, a recent work [Phys. Rev. Lett. 130, 230201 (2023)] demonstrates the generalized contextuality without measurement incompatibility by using a five-outcome qubit measurement. In this paper, we introduce a two-party prepare-measure communication game involving specific constraints on preparations, and we demonstrate contextuality sans incompatibility in the simplest measurement scenario, requiring only a three-outcome extremal qubit measurement. This contrasts with the aforementioned five-outcome qubit measurement, which can be simulated by an appropriate convex mixture of five three-outcome incompatible qubit measurements. Furthermore, we illustrate that our result has a prominent implication in information theory. Our communication game can be perceived as a constrained Holevo-Frankle-Weiner (HFW) scenario, as operational restrictions are imposed on preparations. We show that the maximum success probability of the game by using a qubit surpasses that attainable by a c-bit, even when shared randomness is a free resource. Consequently, this finding exemplifies the supremacy of a qubit over a c-bit within a constrained HFW framework. Thus, alongside offering fresh insights into quantum foundations, our results pave a novel pathway for exploring the efficacy of a qubit in information processing tasks.
Quantum resources may provide an advantage over their classical counterparts in communication tasks. We refer to this as quantum advantage. Here, we consider a single communication task to study different approaches of observing quantum advantage. We call this setting a unified scenario. Our task is described as the following. There are three parties---the Manager, Alice, and Bob. The Manager sends a value of a random variable to Alice, and at the same time Bob receives some partial information regarding that value. Initially, neither Alice nor Bob knows the input of the other, which is received from the Manager. The goal of the task is achieved if and only if the value of the random variable, sent to Alice by the Manager, is identified by Bob with a success probability greater than half all the time. Here, nonzero error probability is allowed. However, to help Bob, Alice sends a limited amount of classical or quantum information to him (cbit or qubit). We show that the goal of the task can be achieved when Alice sends a qubit. On the other hand, a cbit communication is not sufficient for achieving the goal. Thus, it establishes quantum advantage. We further show that the optimal success probability in the overall process for a qubit communication can be higher than the optimal success probability for a cbit communication. In fact, this success probability is higher for qubit communication even if along with cbit communication Alice and Bob share randomness which allows mixing of classical strategies. Clearly, it not only establishes quantum advantage, it also demonstrates a more prominent nonclassical feature. Actually, we obtain higher success probability compared to other tasks. This also suggests the experiment-friendly nature of our task. For applications, we connect our task with semi-device-independence and show how our task can be useful to detect quantumness of a communication in a secure way. Moreover, within the same setting, we provide a way to detect universal coherence present in an ensemble. For a high-dimensional random variable, to achieve the goal, it may require a high-dimensional classical communication, while it can be achieved with only a qubit communication. This establishes a large separation between the quantum and the classical communication.
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.
We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with the communication resource qubit and classical bit (c bit), respectively. Conventional wisdom, supported by the no-go theorems of Holevo and Frenkel-Weiner, suggests that such a quantum advantage is unattainable when the sender and receiver share randomness or classical correlations. However, our results reveal a quantum advantage in a scenario devoid of any shared randomness. Our experiment involves the development of a variational triangular polarimeter, enabling the realization of positive operator value measurements crucial for establishing the targeted quantum advantage. Beyond showcasing a robust communication advantage with a single qubit, our work paves the way for immediate applications in near-term quantum technologies. It provides a semi-device-independent certification scheme for quantum encoding-decoding systems and offers an efficient method for information loading and transmission in quantum networks.
Quantum mechanics enables information-processing advantages even at the level of a single qubit. A paradigmatic example is the 2$\to$1 random access code (RAC), where a qubit outperforms a classical bit in retrieving encoded information. In the standard form, however, this quantum advantage is restricted to a single receiver, since decoding measurements inevitably destroy the encoded information. Contrary to this, we address how long the information encoded in a single qubit remains accessible even after multiple decoding, each with a quantum advantage. Introducing preparation distinguishability as an operational resource associated with the sender, we show that its interplay with measurement incompatibility on the receiver's side can mitigate measurement-induced disturbance, thereby enabling an arbitrarily long sequence of receivers to each retain a quantum advantage. Our results show that, even under repeated measurements, the information encoded in a qubit need not be entirely exhausted, revealing a stronger communication feature than previously recognised.
Measurement incompatibility stipulates the existence of quantum measurements that cannot be carried out simultaneously on single systems. We show that the set of input-output probabilities obtained from d-dimensional classical systems assisted with shared randomness is the same as the set obtained from d-dimensional quantum strategies restricted to compatible measurements with shared randomness in any communication scenario. Thus, measurement incompatibility is necessary for quantum advantage in communication, and any quantum advantage (with or without shared randomness) in communication acts as a witness to the incompatibility of the measurements at the receiver's end in a semi-device-independent way. We introduce a class of communication tasks---a general version of random access codes---to witness incompatibility of an arbitrary number of quantum measurements with arbitrary outcomes acting on d-dimensional systems and provide generic upper bounds on the success metric of these tasks for compatible measurements. We identify all sets of three incompatible rank-one projective qubit measurements that random access codes can witness. Finally, we present the generic relationship between different sets of probability distributions---classical, quantum with or without shared randomness, and quantum restricted to compatible measurements with or without shared randomness---produced in communication scenarios.