arXiv subjects

Ravishankar Ramanathan

Publications and source records attributed to Ravishankar Ramanathan.

At least 55 records · Page 3Linked to original sources

arXiv2017

Measurement uncertainty from no-signaling and non-locality

One of the formulations of Heisenberg uncertainty principle, concerning so-called measurement uncertainty, states that the measurement of one observable modifies the statistics of the other. Here, we derive such a measurement uncertainty principle from two comprehensible assumptions: impossibility of instantaneous messaging at a distance (no-signaling), and violation of Bell inequalities (non-locality). The uncertainty is established for a pair of observables of one of two spatially separated systems that exhibit non-local correlations. To this end, we introduce a gentle form of measurement which acquires partial information about one of the observables. We then bound disturbance of the remaining observables by the amount of information gained from the gentle measurement, minus a correction depending on the degree of non-locality. The obtained quantitative expression resembles the quantum mechanical formulations, yet it is derived without the quantum formalism and complements the known qualitative effect of disturbance implied by non-locality and no-signaling.

quant-ph↗

arXiv2016

Randomness amplification against no-signaling adversaries using two devices

Recently, a physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however for reasons of practical relevance, the crucial question remained open whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components and in a situation where the violation of a Bell inequality only guarantees that some outcomes of the device for specific inputs exhibit randomness? Here, we solve this question and present a device-independent protocol for randomness amplification of Santha-Vazirani sources using a device consisting of two non-signaling components. We show that the protocol can amplify any such source that is not fully deterministic into a fully random source while tolerating a constant noise rate and prove the composable security of the protocol against general no-signaling adversaries. Our main innovation is the proof that even the partial randomness certified by the two-party Bell test (a single input-output pair ($\textbf{u}^*, \textbf{x}^*$) for which the conditional probability $P(\textbf{x}^* | \textbf{u}^*)$ is bounded away from $1$ for all no-signaling strategies that optimally violate the Bell inequality) can be used for amplification. We introduce the methodology of a partial tomographic procedure on the empirical statistics obtained in the Bell test that ensures that the outputs constitute a linear min-entropy source of randomness. As a technical novelty that may be of independent interest, we prove that the Santha-Vazirani source satisfies an exponential concentration property given by a recently discovered generalized Chernoff bound.

quant-ph↗

arXiv2016

Relativistic Causality vs. No-Signaling as the limiting paradigm for correlations in physical theories

The no-signaling constraints state that the probability distribution of the outputs of any subset of parties is independent of the inputs of the complementary set; here we re-examine these to see how they arise from relativistic causality. We show that while the usual no-signaling constraints are sufficient, in general they are not necessary to ensure that a theory does not violate causality. Depending on the exact space-time coordinates of the measurement events in a multi-party Bell experiment, causality only imposes a subset of the usual no-signaling conditions. After revisiting the derivation of the two-party no-signaling constraints, we consider the three-party Bell scenario and characterise a space-time region in which a subset of the no-signaling conditions is sufficient to preserve causality. Secondly, we examine the implications for device-independent cryptography against an eavesdropper constrained only by the laws of relativity. We show an explicit attack in certain measurement configurations on a family of protocols based on the n-party Mermin inequalities that were previously proven secure under the old no-signaling conditions. We then show that security of two-party protocols can also be compromised when the eavesdropper's measurement configuration is not constrained. The monogamy of non-local correlations that underpin their use in secrecy can also be broken in certain space-time configurations. Thirdly, we inspect the notion of free-choice and propose a definition of free-choice in the multi-party Bell experiment. We then re-examine the question whether quantum correlations may admit explanations by finite speed superluminal influences. Finally, we study genuine multiparty non-locality and present a new class of causal bilocal models. We propose a new Svetlichny-type inequality that is satisfied by the causal bilocal model and show its violation within quantum theory.

quant-ph↗

arXiv2016

No quantum realization of extremal no-signaling boxes

Pure states are very important in any theory since they represent states of maximal information about the system within the theory. Here, we show that no non-trivial (not local realistic) extremal states (boxes) of general no-signaling theories can be realized within quantum theory. We then explore three interesting consequences of this fact. Firstly, since the pure states are uncorrelated from the environment, the statement forms a no-go result against the most straightforward device-independent protocol for randomness or secure key generation against general no-signaling adversaries. It also leads to the interesting question whether all non-extremal boxes allow for non-local correlations with the adversary. Secondly, in addition to the fact that new information-theoretic principles (designed to pick out the set of quantum correlations from among all non signaling ones) can in consequence be tested on arbitrary non-local vertices to check their validity, it also allows the possibility of excluding from the quantum set any box of no-signaling correlations that can be distilled to a non-local vertex. Finally, it also forms a sufficient condition to identify non-local games with no quantum winning strategy, when one can show that the game has a single unique non-signaling winning strategy. We illustrate each of these consequences with the example of generalized Popescu-Rohrlich boxes.

quant-ph↗

arXiv2016

On the tightness of correlation inequalities with no quantum violation

We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question whether every proper (tight) Bell inequality for two parties, other than the trivial ones from positivity, normalization and no-signaling can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games, illustrating it for the case of three outcomes. We then show as a main result that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the non-local computation games do not constitute tight Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest CHSH Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the non-contextual polytope of single-party correlation inequalities with the cut polytope $CUT(\nabla G)$, where $G$ denotes the compatibility graph of observables in the contextuality scenario and $\nabla G$ denotes the suspension graph of $G$. We observe that there exist tight non-contextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the Consistent Exclusivity principle.

quant-ph↗

arXiv2016

Generalized XOR games with $d$ outcomes and the task of non-local computation

A natural generalization of the binary XOR games to the class of XOR-d games with $d > 2$ outcomes is studied. We propose an algebraic bound to the quantum value of these games and use it to derive several interesting properties of these games. As an example, we re-derive in a simple manner a recently discovered bound on the quantum value of the CHSH-d game for prime $d$. It is shown that no total function XOR-d game with uniform inputs can be a pseudo-telepathy game, there exists a quantum strategy to win the game only when there is a classical strategy also. We then study the principle of lack of quantum advantage in the distributed non-local computation of binary functions which is a well-known information-theoretic principle designed to pick out quantum correlations from amongst general no-signaling ones. We prove a large-alphabet generalization of this principle, showing that quantum theory provides no advantage in the task of non-local distributed computation of a restricted class of functions with $d$ outcomes for prime $d$, while general no-signaling boxes do. Finally, we consider the question whether there exist two-party tight Bell inequalities with no quantum advantage, and show that the binary non-local computation game inequalities for the restricted class of functions are not facet defining for any number of inputs.

quant-ph↗

arXiv2015

Linear game non-contextuality and Bell inequalities - a graph-theoretic approach

We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. Linear games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite linear game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

quant-ph↗

arXiv2015

Quantum bounds on multiplayer linear games and device-independent witness of genuine tripartite entanglement

Here we study multiplayer linear games, a natural generalization of XOR games to multiple outcomes. We generalize a recently proposed efficiently computable bound, in terms of the norm of a game matrix, on the quantum value of 2-player games to linear games with $n$ players. As an example, we bound the quantum value of a generalization of the well-known CHSH game to $n$ players and $d$ outcomes. We also apply the bound to show in a simple manner that any nontrivial functional box, that could lead to trivialization of communication complexity in a multiparty scenario, cannot be realized in quantum mechanics. We then present a systematic method to derive device-independent witnesses of genuine tripartite entanglement.

quant-ph↗

arXiv2015

Robust Device-Independent Randomness Amplification with Few Devices

Randomness amplification is the task of transforming a source of somewhat random bits into a source of fully random bits. Although it is impossible to amplify randomness from a single source by classical means, the situation is different considering non-local correlations allowed by quantum mechanics. Here we give the first device-independent protocol for randomness amplification using a constant number of devices. The protocol involves four devices, can amplify any non-deterministic source into a fully random source, tolerates a constant rate of error, and has its correctness based solely on the assumption of no-signaling between the devices. In contrast all previous protocols either required an unbounded number of devices, or could only amplify sources sufficiently close to fully random.

quant-ph↗

arXiv2014

Characterising the Performance of XOR Games and the Shannon Capacity of Graphs

In this paper we give a set of necessary and sufficient conditions such that quantum players of a two-party {\sc xor} game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrisation of new families of games which have no quantum advantage, for arbitrary input probability distributions up to certain symmetries. In the future, these might be used in information-theoretic studies on reproducing the set of quantum non-local correlations.

quant-ph↗

arXiv2014

Strong monogamies of no-signaling violations for bipartite correlation Bell inequalities

The phenomenon of monogamy of Bell inequality violations is interesting both from the fundamental perspective as well as in cryptographic applications such as the extraction of randomness and secret bits. In this article, we derive new and stronger monogamy relations for violations of Bell inequalities in general no-signaling theories. These relations are applicable to the class of binary output correlation inequalities known as XOR games, and to a restricted set of unique games. In many instances of interest, we show that the derived relation provides a significant strengthening over previously known results. The result involves a shift in paradigm towards the importance in monogamies of the number of inputs of one party which lead to a contradiction from local realistic predictions.

quant-ph↗

arXiv2014

Necessary and sufficient conditions for state-independent measurement contextual scenarios

The problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension $d$ and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes of contextual behavior, and that (ii) state-independent contextuality is equivalent to the contextuality of the maximally mixed state up to a global unitary transformation. We then derive a necessary and sufficient condition for a measurement scenario represented by an orthogonality graph to reveal state-independent contextuality. This condition is given in terms of the fractional chromatic number of the graph $χ_f(G)$ and is shown to identify all state-independent contextual measurement scenarios including those that go beyond the original Kochen-Specker paradigm \cite{Yu-Oh}.

quant-ph↗

arXiv2013

Robust Device Independent Randomness Amplification

In randomness amplification a slightly random source is used to produce an improved random source. Perhaps surprisingly, a single source of randomness cannot be amplified at all classically. However, the situation is different if one considers correlations allowed by quantum mechanics as an extra resource. Here we present a protocol that amplifies Santha-Vazirani sources arbitrarily close to deterministic into fully random sources. The protocol is device independent, depending only on the observed statistics of the devices and on the validity of the no-signaling principle between different devices. It improves previously-known protocols in two respects. First the protocol is tolerant to noise so that even noisy quantum-mechanical systems give rise to good devices for the protocol. Second it is simpler, being based on the violation of a four-party Bell inequality and on the XOR as a hash function. As a technical tool we prove a new de Finetti theorem where the subsystems are selected from a Santha-Vazirani source.

quant-ph↗

arXiv2013

Free randomness amplification using bipartite chain correlations

A direct analysis of the protocol of randomness amplification using Bell inequality violation is performed in terms of the convex combination of no-signaling boxes required to simulate quantum violation of the inequality. The probability distributions of bits generated by a Santha-Vazirani source are shown to be mixtures of permutations of Bernoulli distributions with parameter defined by the source. An intuitive proof is provided for the range of partial randomness from which perfect randomness can be extracted using quantum correlations violating the chain inequalities. Exact values are derived in the asymptotic limit of a large number of measurement settings.

quant-ph↗

arXiv2013

The relation between nonlocality and contextuality for a biphoton

We investigate the set of qutrit states in terms of symmetric states of two qubits that violate the minimal contextual inequality, namely the Klyachko-Can-Binicoglu-Shumovsky (KCBS) inequality. The physical system that provides a natural framework for this problem is a biphoton which consists of two photons in the same spatio-temporal mode and whose effective polarization behaves as a three-level quantum system. The relationship between the KCBS contextual inequality and the Clauser-Horne-Shimony-Holt (CHSH) inequality is investigated. We find that every biphotonic state that is contextual with respect to KCBS is nonlocal as per the CHSH test when the two photons are apart, but the converse is not true.

quant-ph↗

arXiv2012

Generalized monogamy of contextual inequalities from the no-disturbance principle

In this paper we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no-disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs admit a joint probability distribution, we formulate a precise graph-theoretic condition that gives rise to the monogamy of contextuality. We also show how such monogamies arise within quantum theory for a single four-dimensional system and interpret violation of these relations in terms of a violation of causality. These monogamies can be tested with current experimental techniques.

quant-ph↗

arXiv2012

Optimal Asymmetric Quantum Cloning

While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of M to N asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the 1 to N universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every N and d is derived. Analogous results are proven for qubits when M=N-1. We also consider state-dependent 1 to N qubit cloning, providing a general parametrization in terms of a Heisenberg star Hamiltonian. In all instances, we determine the feasibility of implementing the cloning economically, i.e., without an ancilla, and determine the dimension of the ancilla when an economic implementation is not possible.

quant-ph↗

arXiv2012

Entropic Test of Quantum Contextuality

We study the contextuality of a three-level quantum system using classical conditional entropy of measurement outcomes. First, we analytically construct the minimal configuration of measurements required to reveal contextuality. Next, an entropic contextual inequality is formulated, analogous to the entropic Bell inequalities derived by Braunstein and Caves in [Phys. Rev. Lett. {\bf 61}, 662 (1988)], that must be satisfied by all non-contextual theories. We find optimal measurements for violation of this inequality. The approach is easily extendable to higher dimensional quantum systems and more measurements. Our theoretical findings can be verified in the laboratory with current technology.

quant-ph↗