Although ‘quantum contextuality’ is one of the most fundamental non-classical feature, its generic role in information processing and computation is an open quest. In this article, we present a family of distributed computing tasks pertaining to every logical proof of Kochen–Specker (KS) contextuality in two different one-way communication scenarios: (I) communication of bounded dimensional system, (II) communication of unbounded dimensional system while keeping certain information oblivious, namely, oblivious communication (OC). As the later remains largely unexplored, we introduce a general framework for OC tasks and provide a methodology for obtaining an upper bound on the success of OC tasks in classical communication. We show that quantum communication comprised of every KS set of vectors outperforms classical communication and perfectly accomplish the task in both the aforementioned scenarios. We explicitly discuss the communication tasks pertaining to the simplest state independent contextuality sets of dimension three and four. Our results establish an operational significance to single system contextuality and open up the possibility of semi-device independent quantum information processing based on that. Alongside, we identify any advantage in OC tasks as a witness of preparation contextuality.
The study of ontology (hidden variables) provides for a vital ground on which significant nonclassical features of quantum theory are revealed. One such nonclassical ontic feature is preparation contextuality (PC) and advantage in oblivious communication tasks is one of its operational signatures. This article primarily pursues the ontic feature underlying quantum advantage in communication complexity (CC). We construct oblivious communication tasks tailored to given CC problems. We upper bound the classical success probability of these oblivious communication tasks, obtaining preparation noncontextual inequalities. We use the very states and measurements responsible for advantage in CC problems along with the orthogonal mixtures of these states to orchestrate an advantageous protocol for the associated oblivious communication tasks and the violation of the associated inequalities, thereby unveiling PC. To showcase the vitality of our results, we find a criterion for unbounded violation of these inequalities and demonstrate the same for two widely studied CC problems.
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited number of applications requiring contextuality but not entanglement. Here, we show that for any quantum state and observables of sufficiently small dimensions producing contextuality, there exists a communication task with quantum advantage. Conversely, any quantum advantage in this task admits a proof of contextuality whenever an additional condition holds. We further show that given any set of observables allowing for quantum state-independent contextuality, there exists a class of communication tasks wherein the difference between classical and quantum communication complexities increases as the number of inputs grows. Finally, we show how to convert each of these communication tasks into a semi-device-independent protocol for quantum key distribution.
Wigner's form of the local realist inequality is used to derive its temporal version for an oscillating two-level system involving two-time joint probabilities. Such an inequality may be regarded as a form of the Leggett-Garg inequality (LGI) constituting a necessary condition for macrorealism. The robustness of its quantum mechanical (QM) violation against unsharpness of measurement is investigated by using a suitable model of unsharp measurements. It is found that there exists a range of values of the sharpness parameter (characterizing precision of the relevant measurements) for which the usual LGI is satisfied by QM, but Wigner's form of the LGI (WLGI) is violated. This implies that for such unsharp measurements, the QM violation of macrorealism cannot be tested using the usual LGI, but can be tested using WLGI. In showing this, we take into account the general form of the usual LGI involving an arbitrary number of pairs of two-time correlation functions. Another recently proposed necessary condition for macrorealism, called “no-signaling in time,” is also probed, showing that its QM violation persists for arbitrarily unsharp measurements.
Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of distributed RACs [J. Bowles, N. Brunner, and M. Pawłowski, Phys. Rev. A 92, 022351 (2015)] and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa. Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.