arXiv subjects

Anubhav Chaturvedi

Publications and source records attributed to Anubhav Chaturvedi.

29 records · Page 2Linked to original sources

arXiv2023

Extending loophole-free nonlocal correlations to arbitrarily large distances

One of the most striking features of quantum theory is that it allows distant observers to share correlations that resist local hidden variable (classical) explanations, a phenomenon referred to as Bell nonlocality. Besides their foundational relevance, the nonlocal correlations enable distant observers to accomplish classically inconceivable information processing and cryptographic feats such as unconditionally secure device-independent key distribution schemes. However, the distances over which nonlocal correlations can be realized in state-of-the-art Bell experiments remain severely limited owing to the high threshold efficiencies of the detectors and the fragility of the nonlocal correlations to experimental noise. Instead of looking for quantum strategies with marginally lower threshold requirements, we exploit the properties of loophole-free nonlocal correlations, which are experimentally attainable today, albeit at short distances, to extend them over arbitrarily large distances. Specifically, we consider Bell experiments wherein the spatially separated parties randomly choose the location of their measurement devices in addition to their measurement settings. We demonstrate that when devices close to the source are perfect and witness extremal loophole-free nonlocal correlations, such correlations can be extended to devices placed arbitrarily far from the source, with almost-zero detection efficiency and visibility. To accommodate imperfections close to the source, we demonstrate a specific analytical tradeoff: the higher the loophole-free nonlocality close to the source, the lower the threshold requirements away from the source. We utilize this analytical tradeoff paired with optimal quantum strategies to estimate the critical requirements of a measurement device placed away from the source and formulate a versatile numerical method applicable to generic network scenarios.

quant-ph↗

arXiv2021

Characterising and bounding the set of quantum behaviours in contextuality scenarios

The predictions of quantum theory resist generalised noncontextual explanations. In addition to the foundational relevance of this fact, the particular extent to which quantum theory violates noncontextuality limits available quantum advantage in communication and information processing. In the first part of this work, we formally define contextuality scenarios via prepare-and-measure experiments, along with the polytope of general contextual behaviours containing the set of quantum contextual behaviours. This framework allows us to recover several properties of set of quantum behaviours in these scenarios, including contextuality scenarios and associated noncontextuality inequalities that require for their violation the individual quantum preparation and measurement procedures to be mixed states and unsharp measurements. With the framework in place, we formulate novel semidefinite programming relaxations for bounding these sets of quantum contextual behaviours. Most significantly, to circumvent the inadequacy of pure states and projective measurements in contextuality scenarios, we present a novel unitary operator based semidefinite relaxation technique. We demonstrate the efficacy of these relaxations by obtaining tight upper bounds on the quantum violation of several noncontextuality inequalities and identifying novel maximally contextual quantum strategies. To further illustrate the versatility of these relaxations, we demonstrate monogamy of preparation contextuality in a tripartite setting, and present a secure semi-device independent quantum key distribution scheme powered by quantum advantage in parity oblivious random access codes.

quant-ph↗

arXiv2021

Mutually Unbiased Balanced Functions & Generalized Random Access Codes

Quantum resources and protocols are known to outperform their classical counterparts in variety of communication and information processing tasks. Random Access Codes (RACs) are one such cryptographically significant family of bipartite communication tasks, wherein, the sender encodes a data set (typically a string of input bits) onto a physical system of bounded dimension and transmits it to the receiver, who then attempts to guess a randomly chosen part of the sender's data set (typically one of the sender's input bits). In this work, we introduce a generalization of this task wherein the receiver, in addition to the individual input bits, aims to retrieve randomly chosen functions of sender's input string. Specifically, we employ sets of mutually unbiased balanced functions (MUBS), such that perfect knowledge of any one of the constituent functions yields no knowledge about the others. We investigate and bound the performance of (i.) classical, (ii.) quantum prepare and measure, and (iii.) entanglement assisted classical communication (EACC) protocols for the resultant generalized RACs (GRACs). Finally, we detail the case of GRACs with three input bits, find maximal success probabilities for classical, quantum and EACC protocols, along with the effect of noisy quantum channels on the performance of quantum protocols. Moreover, with the help of this case study, we reveal several characteristic properties of the GRACs which deviate from the standard RACs.

quant-ph↗

arXiv2020

Quantum prescriptions are more ontologically distinct than they are operationally distinguishable

Based on an intuitive generalization of the Leibniz principle of `the identity of indiscernibles', we introduce a novel ontological notion of classicality, called bounded ontological distinctness. Formulated as a principle, bounded ontological distinctness equates the distinguishability of a set of operational physical entities to the distinctness of their ontological counterparts. Employing three instances of two-dimensional quantum preparations, we demonstrate the violation of bounded ontological distinctness or excess ontological distinctness of quantum preparations, without invoking any additional assumptions. Moreover, our methodology enables the inference of tight lower bounds on the extent of excess ontological distinctness of quantum preparations. Similarly, we demonstrate excess ontological distinctness of quantum transformations, using three two-dimensional unitary transformations. However, to demonstrate excess ontological distinctness of quantum measurements, an additional assumption such as outcome determinism or bounded ontological distinctness of preparations is required. Moreover, we show that quantum violations of other well-known ontological principles implicate quantum excess ontological distinctness. Finally, to showcase the operational vitality of excess ontological distinctness, we introduce two distinct classes of communication tasks powered by excess ontological distinctness.

quant-ph↗

arXiv2019

Preparation contextuality as an essential feature underlying quantum communication advantage

The study of ontology (hidden variables) provides for a vital ground on which significant non-classical features of quantum theory are revealed. One such non-classical 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 non-contextual 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.

quant-ph↗

arXiv2018

On the Security of Semi Device Independent QKD protocols

While fully device-independent security in (BB84-like) prepare and measure Quantum Key Distribution (QKD) is impossible, it can be guaranteed against individual attacks in a semi device-independent (SDI) scenario, wherein no assumptions are made on the characteristics of the hardware used are made except for an upper bound on the the dimension of the communicated system. Studying security under such minimal assumptions is especially relevant in the context of the recent {\it quantum hacking} attacks wherein the eavesdroppers can not only construct the devices used by the communicating parties but are also able to remotely alter their behavior. In this work we study the security of a SDIQKD protocol based on the prepare and measure quantum implementation of a well-known cryptographic primitive, the Random Access Code (RAC). We consider imperfect detectors and establish the critical values of the security parameters (the observed success probability of the RAC and the detection efficiency) required for guaranteeing security against eavesdroppers with and without quantum memory. Furthermore we suggest a minimal characterization of the preparation device in order to lower the requirements for establishing a secure key.

quant-ph↗

arXiv2017

Complementarity of genuine multipartite non-locality

We introduce a new feature of no-signaling (Bell) non-local theories, namely, when a system of multiple parties manifests genuine non-local correlation, then there cannot be arbitrarily high non-local correlation among any subset of the parties. We call this feature, \textit{complementarity of genuine multipartite non-locality}. We use Svetlichny's criterion for genuine multipartite non-locality and non-local games to derive the complementarity relations under no-signaling constraints. We find that the complementarity relations are tightened for the much stricter quantum constraints. We compare this notion with the well-known notion of \textit{monogamy of non-locality}. As a consequence, we obtain tighter non-trivial monogamy relations that take into account genuine multipartite non-locality. Furthermore, we provide numerical evidence showcasing this feature using a bipartite measure and several other well-known tripartite measures of non-locality.

quant-ph↗

arXiv2016

Random access codes and non-local resources

It is known that a PR-BOX (PR), a non-local resource and $(2\rightarrow 1)$ random access code (RAC), a functionality (wherein Alice encodes 2 bits into 1 bit message and Bob learns one of randomly chosen Alice's inputs) are equivalent under the no-signaling condition. In this work we introduce generalizations to PR and $(2\rightarrow 1)$ RAC and study their inter-convertibility. We introduce generalizations based on the number of inputs provided to Alice, $B_n$-BOX and $(n\rightarrow 1)$ RAC. We show that a $B_n$-BOX is equivalent to a no-signaling $(n\rightarrow 1)$ RACBOX (RB). Further we introduce a signaling $(n\rightarrow 1)$ RB which cannot simulate a $B_n$-BOX. Finally to quantify the same we provide a resource inequality between $(n\rightarrow 1)$ RB and $B_n$-BOX, and show that it is saturated. As an application we prove that one requires atleast $(n-1)$ PRs supplemented with a bit of communication to win a $(n\rightarrow 1)$ RAC. We further introduce generalizations based on the dimension of inputs provided to Alice and the message she sends, $B_n^d(+)$-BOX, $B_n^d(-)$-BOX and $(n\rightarrow 1,d)$ RAC ($d>2$). We show that no-signaling condition is not enough to enforce strict equivalence in the case of $d>2$. We introduce classes of no-signaling $(n\rightarrow 1,d)$ RB, one which can simulate $B_n^d(+)$-BOX, second which can simulate $B_n^d(-)$-BOX and third which cannot simulate either. Finally to quantify the same we provide a resource inequality between $(n\rightarrow 1,d)$ RB and $B_n^d(+)$-BOX, and show that it is saturated.

quant-ph↗

arXiv2016

Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities

One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such tasks in any preparation noncontextual theory. These bounds constitute noncontextuality inequalities for any value of d. For d=3, using a set of mutually asymmetric biased bases we show that the corresponding noncontextual bound is violated by quantum theory. We also show quantum violation of the inequalities for some other higher values of d. This reveals operational usefulness of preparation contextuality of higher level quantum systems.

quant-ph↗

arXiv2015

Measurement-device-independent randomness from local entangled states

Nonlocal correlations are useful for device independent (DI) randomness certification [Nature (London) {\bf 464}, 1021 (2010)]. The advantage of this DI protocol over the conventional quantum protocol is that randomness can be certified even when experimental apparatuses are not trusted. Quantum entanglement is the necessary physical source for the nonlocal correlation required for such DI task. However, nonlocality and entanglement are distinct concepts. There exist entangled states which produce no nonlocal correlation and hence are not useful for the DI randomness certification task. Here we introduce the measurement-device-independent randomness certification task where one has trusted quantum state preparation device but the measurement devices are completely unspecified. Interestingly we show that there exist entangled states, with local description, that are useful resource in such task which otherwise are useless in corresponding DI scenario.

quant-ph↗

arXiv2015

Is Post Selection Physical: A Device Independent Outlook

The basic motivation behind this work is to raise the question that whether post selection can be considered a valid physical transformation (on probability space) or not. We study the consequences of both answers set in a device (theory) independent framework, based only on observed statistics. We start with taking up post-selection as an assumption and model the same using independent devices governed by Boolean functions. We establish analogy between the post selection functions and the general probabilistic games in a two party binary input-output scenario. As an observation, we categorize all possible post-selection functions based on the effect on a uniform input probability distribution. We find that post-selection can transform simple no signaling probability distributions to signaling. Similarly, solving NP complete problems is easy independent of classical or quantum computation (in particular we prove that Post RP = NP). Finally, we demonstrate an instance of the violation of the pigeon hole principle independent of underlying theory. As result of our theory independent modeling we conclude that post-selection as an assumption adds power to the underlying theory. In particular, quantum mechanics benefits more with the post-selection assumption, only because it admits a more general set of allowed probabilities as compared to the local hidden variable model. Without the assumption we associate a device independent efficiency factor to quantify the cost of post selection. Our study shows that in the real world post-selection is not efficient enough to be of any advantage. But from an adversarial perspective it is still of significance. As an application, we obtain robust bounds on faking the bell violation in terms of minimum efficiency required using post selection.

quant-ph↗