We consider two-stage hybrid protocols that combine quantum resources and classical resources to generate classical correlations shared by two separated players. Our motivation is twofold. First, in the near future, the scale of quantum information processing is quite limited, and when quantum resource available is not sufficient for certain tasks, a possible way to strengthen the capability of quantum schemes is introducing extra classical resources. We analyze the mathematical structures of these hybrid protocols, and characterize the relation between the amount of quantum resources and classical resources needed. Second, a fundamental open problem in communication complexity theory is to describe the advantage of sharing prior quantum entanglement over sharing prior randomness, which is still widely open. It turns out that our quantum and classical hybrid protocols provide new insight into this important problem.
We study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on
n bits for which reducing the entanglement increases the classical communication complexity exponentially. Our separations are as follows. For every
k≥1:
Q∥∗ versus
R2∗: We show that quantum simultaneous protocols with
Θ~(k5log3n) qubits of entanglement can exponentially outperform two-way randomized protocols with
O(k) qubits of entanglement. This resolves an open problem from [Gav08] and improves the state-of-the-art separations between quantum simultaneous protocols with entanglement and two-way randomized protocols without entanglement [Gav19, GRT22].
R∥∗ versus
Q∥∗: We show that classical simultaneous protocols with
Θ~(klogn) qubits of entanglement can exponentially outperform quantum simultaneous protocols with
O(k) qubits of entanglement, resolving an open question from [GKRW06, Gav19]. The best result prior to our work was a relational separation against protocols without entanglement [GKRW06].
R∥∗ versus
R1∗: We show that classical simultaneous protocols with
Θ~(klogn) qubits of entanglement can exponentially outperform randomized one-way protocols with
O(k) qubits of entanglement. Prior to our work, only a relational separation was known [Gav08]. Our techniques can also be used to show advantages of quantum communication models over hybrid classical-quantum models, i.e., models that have a large amount of both classical communication and quantum simultaneous communication.
We investigate the correlations that can arise between Alice and Bob in prepare-and-measure communication scenarios where the source (Alice) and the measurement device (Bob) can share prior entanglement.The paradigmatic example of such a scenario is the quantum dense-coding protocol, where the communication capacity of a qudit can be doubled if a two-qudit entangled state is shared between Alice and Bob.We provide examples of correlations that actually require more general protocols based on higher-dimensional entangled states.This motivates us to investigate the set of correlations that can be obtained from communicating either a classical or a quantum d-dimensional system in the presence of an unlimited amount of entanglement.We show how such correlations can be characterized by a hierarchy of semidefinite programming relaxations by reducing the problem to a noncommutative polynomial optimization problem.We also introduce an alternative relaxation hierarchy based on the notion of informationally restricted quantum correlations, which, though it represents a strict (nonconverging) relaxation scheme, is less computationally demanding.As an application, we introduce device-independent tests of the dimension of classical and quantum systems that, in contrast to previous results, do not make the implicit assumption that Alice and Bob share no entanglement.We also establish several relations between communication with and without entanglement as resources for creating correlations.
Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a resource called shared randomness, quantum systems provide an advantage over their classical counterpart. Precisely, we show that appropriate albeit fixed measurements on a shared two-qubit state can generate correlations which cannot be obtained from any possible state on two classical bits. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game, which we call the `non-monopolize social subsidy' game. It turns out that the quantum states leading to the desired advantage must possess non-classicality in the form of quantum discord. On the other hand, while distributing such sources of shared randomness between two parties via noisy channels, quantum channels with zero capacity as well as with classical capacity strictly less than unity perform more efficiently than the perfect classical channel. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.
Abstract A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios. For classical communication, we derive a general correlation criterion for nonlocal resources and use it to show that entanglement can fail to be a resource in standard tasks. For quantum communication, we consider the basic primitive for energy-constrained communication, namely the probabilistic transmission of a bit, and show that the advantages of entanglement only can be unlocked by non-unitary encoding schemes that purposefully decohere the entangled state. We also find that these advantages can be increased by using entanglement of higher dimension than qubit. We leverage these insights to investigate the impact of entanglement for quantum random number generation, which is a standard application of these systems but whose security so far only has been established against classical side information. In the low-energy regime, our attacks on the protocol indicate that the security remains largely intact, thereby paving the way for strengthened security without more complex setups and with negligible performance reductions.
Randomness appears both in classical stochastic physics and in quantum mechanics. A number of communication models and other information protocols entail sharing randomness among distant parties. Here we report a computational scenario of shared randomness processing where quantum sources manifest clear-cut precedence over the corresponding classical counterparts. The advantage is established in a resource theoretic set-up which we formalize in this work. The classical mutual information turns out to be a faithful resource quantifier of shared randomness although it does not sufficiently characterize all possible transitions among the resources. Quantum theory exhibits advantage in shared randomness processing in the sense that the set of resourceful states obtained under free operation from a bipartite quantum system is strictly larger than the set obtained from an analogous classical system. Interestingly, the quantum advantage can be manifested in the optimal payoff of a two players co-operative game -- the `non-monopolize social subsidy' game. We also show that the quantum states resulting to the desired advantage necessitates nonclassicality in the form of quantum discord. We then address the task of distributing shared randomness between two parties. Quite interestingly, it turns out that noisy quantum channel can exhibit advantage even when it has zero quantum capacity and classical capacity much less than the corresponding classical channel. The imperfect channel examples facilitates and welcomes experiment to achieve the reported quantum advantage with presently available quantum devices.
Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed quantum computation, enhanced clock synchronization, and high-precision multiparameter metrology. For the optimal development of these technologies, however, it is essential to identify the necessary resources and sub-routines that will lead to the quantum advantage, but this is demanding even for the simplest protocols in quantum information processing. Here we show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage. Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states, despite the free availability of long-distance entanglement. At an abstract level, our work points towards a fundamental difference between bipartite and multipartite entanglement. From a practical perspective, our results highlight the need for classical communication combined with quantum memories to fully harness the power of quantum networks.