Abstract Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However, a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra‐quantum correlations in “space‐like” and/or “time‐like” paradigms. In this letter, a communication task involving three spatially separated parties is proposed where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. This task is called authentication with limited communication, the restrictions on communication being: i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several nonclassical theories although they might possess stronger “space‐like” and/or “time‐like” correlations. Surprisingly, quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other nonclassical strategies.
Abstract Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However, a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra‐quantum correlations in “space‐like” and/or “time‐like” paradigms. In this letter, a communication task involving three spatially separated parties is proposed where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. This task is called authentication with limited communication, the restrictions on communication being: i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several nonclassical theories although they might possess stronger “space‐like” and/or “time‐like” correlations. Surprisingly, quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other nonclassical strategies.
Quantum correlations can offer dramatic gain over the corresponding classical re- resources in numerous conversation obligations. But a extensive magnificence of probabilistic theories exists that at- tributes extra success than quantum concept in a lot of these tasks. Right here we recommend a verbal exchange undertaking involving 3 spatially separated parties wherein one birthday celebration (verifier) targets to confirm whether or not the bit strings possessed by the alternative parties (terminals) are same or no longer. We call this project authentication with restrained communication (ALC), because of the regulations imposed on the communication. Manifestly, classical assets aren't enough to perform this venture. It's also not possible to carry out this challenge with reality in numerous supra-quantum theories. Incredibly quantum sources can acquire the correct triumphing approach. The proposed challenge accordingly stands apart from all previously recognized communication tasks because it well-knownshows quantum supremacy over supra-quantum techniques.Keywords: General Probabilistic Theory, Entanglement, Communication Task
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.
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.
Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games cannot be won given a noiseless 1 -bit classical channel from the sender to the receiver. Interestingly, the goal can be perfectly achieved if the channel is assisted with classical shared randomness. This resembles an advantage similar to the quantum superdense coding phenomenon where pre-shared entanglement can enhance the communication utility of a perfect quantum communication line. Quite surprisingly, we show that a qubit communication without any assistance of classical shared randomness can achieve the goal, and hence establishes a novel quantum advantage in the simplest communication scenario. In pursuit of a deeper origin of this advantage, we show that an advantageous quantum strategy must invoke quantum interference both at the encoding step by the sender and at the decoding step by the receiver. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces. We come up with communication tasks that can be achieved neither with 1 -bit of classical communication nor by communicating a polygon system, whereas 1 -qubit communication yields a perfect strategy, establishing quantum advantage over them. To this end, we show that the quantum advantages are robust against imperfect encodings-decodings, making the protocols implementable with presently available quantum technologies.
In this Letter we show that communication when restricted to a single information carrier (i.e., single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass this limitation. We show that communication bounded to the exchange of a single quantum particle (in superposition of different spatial locations) can result in "two-way signaling," which is impossible in classical physics. We quantify the discrepancy between classical and quantum scenarios by the probability of winning a game played by distant players. We generalize our result to an arbitrary number of parties and we show that the probability of success is asymptotically decreasing to zero as the number of parties grows, for all classical strategies. In contrast, quantum strategy allows players to win the game with certainty.