Searcharxiv⌕ Search

arXiv subjects

Somshubhro Bandyopadhyay

Publications and source records attributed to Somshubhro Bandyopadhyay.

At least 37 records · Page 2Linked to original sources

Strong Quantum Nonlocality without Entanglement

Quantum nonlocality is usually associated with entangled states by their violations of Bell-type inequalities. However, even unentangled systems, whose parts may have been prepared separately, can show nonlocal properties. In particular, a set of product states is said to exhibit "quantum nonlocality without entanglement" if the states are locally indistinguishable, i.e. it is not possible to optimally distinguish the states by any sequence of local operations and classical communication. Here, we present a stronger manifestation of this kind of nonlocality in multiparty systems through the notion of local irreducibility. A set of multiparty orthogonal quantum states is defined to be locally irreducible if it is not possible to locally eliminate one or more states from the set while preserving orthogonality of the postmeasurement states. Such a set, by definition, is locally indistinguishable, but we show that the converse doesn't always hold. We provide the first examples of orthogonal product bases on $\mathbb{C}^{d}\otimes\mathbb{C}^{d}\otimes\mathbb{C}^{d}$ for $d=3,4$ that are locally irreducible in all bipartitions, where the construction for $d=3$ achieves the minimum dimension necessary for such product states to exist. The existence of such product bases implies that local implementation of a multiparty separable measurement may require entangled resources across all bipartitions.

quant-ph↗

Entanglement sharing through noisy qubit channels: One-shot optimal singlet fraction

Maximally entangled states--a resource for quantum information processing--can only be shared through noiseless quantum channels, whereas in practice channels are noisy. Here we ask: Given a noisy quantum channel, what is the maximum attainable purity (measured by singlet fraction) of shared entanglement for single channel use and local trace preserving operations? We find an exact formula of the maximum singlet fraction attainable for a qubit channel and give an explicit protocol to achieve the optimal value. The protocol distinguishes between unital and nonunital channels and requires no local post-processing. In particular, the optimal singlet fraction is achieved by transmitting part of an appropriate pure entangled state, which is maximally entangled if and only if the channel is unital. A linear function of the optimal singlet fraction is also shown to be an upper bound on the distillable entanglement of the mixed state dual to the channel.

quant-ph↗

Entanglement gain in measurements with unknown results

We characterise non-selective global projective measurements capable of increasing quantum entanglement between two particles. We show that non-selective global projective measurements are capable of increasing entanglement between two particles, in particular, entanglement of any pure non-maximally entangled state can be improved in this way (but not of any mixed state) and we provide detailed analysis for two qubits. It is then shown that Markovian open system dynamics can only approximate such measurements, but this approximation converges exponentially fast as illustrated using Araki-Zurek model. We conclude with numerical evidence that macroscopic bodies in a random pure state do not gain entanglement in a random non-selective global measurement.

quant-ph↗

Entanglement sharing via qudit channels: Nonmaximally entangled states may be necessary for one-shot optimal singlet fraction and negativity

We consider the problem of establishing entangled states of optimal singlet fraction and negativity between two remote parties for every use of a noisy quantum channel and trace-preserving LOCC under the assumption that the parties do not share prior correlations. We show that for a family of quantum channels in every finite dimension $d\geq3$, one-shot optimal singlet fraction and entanglement negativity are attained only with appropriate nonmaximally entangled states. We further show that the generalization of the formula that exactly computes one-shot optimal singlet fraction for qubit channels does not hold in general in higher dimensions. A consequence of our results is that the ordering of entangled states in all finite dimensions may not be preserved under trace-preserving LOCC.

quant-ph↗

Optimal resource states for local state discrimination

We study the problem of locally distinguishing pure quantum states using shared entanglement as a resource. For a given set of locally indistinguishable states, we define a resource state to be useful if it can enhance local distinguishability and optimal if it can distinguish the states as well as global measurements and is also minimal with respect to a partial ordering defined by entanglement and dimension. We present examples of useful resources and show that an entangled state need not be useful for distinguishing a given set of states. We obtain optimal resources with explicit local protocols to distinguish multipartite GHZ and Graph states; and also show that a maximally entangled state is an optimal resource under one-way LOCC to distinguish any bipartite orthonormal basis which contains at least one entangled state of full Schmidt rank.

quant-ph↗

Entanglement as a resource for local state discrimination in multipartite systems

We explore the question of using an entangled state as a universal resource for implementing quantum measurements by local operations and classical communication (LOCC). We show that for most systems consisting of three or more subsystems, there is no entangled state from the same space that can enable all measurements by LOCC. This is in direct contrast to the bipartite case, where a maximally entangled state is an universal resource. Our results are obtained showing an equivalence between the problem of local state transformation and that of entanglement-assisted local unambiguous state discrimination.

quant-ph↗

Reciprocal ontological models show indeterminism of the order of quantum theory

The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We show that within the class of ontological models due to Harrigan and Spekkens, those satisfying preparation-measurement reciprocity must allow indeterminism of the order of quantum theory. Our result implies that one can design quantum random number generator, for which it is impossible, even in principle, to construct a reciprocal deterministic model.

quant-ph↗

Excessive distribution of quantum entanglement

We classify protocols of entanglement distribution as excessive and non-excessive ones. In a non-excessive protocol, the gain of entanglement is bounded by the amount of entanglement being communicated between the remote parties, while excessive protocols violate such bound. We first present examples of excessive protocols that achieve a significant entanglement gain. Next we consider their use in noisy scenarios, showing that they improve entanglement achieved in other ways and for some situations excessive distribution is the only possibility of gaining entanglement.

quant-ph↗

Unambiguous discrimination of linearly independent pure quantum states: Optimal average probability of success

We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.

quant-ph↗

Conclusive Exclusion of Quantum States

In the task of quantum state exclusion we consider a quantum system, prepared in a state chosen from a known set. The aim is to perform a measurement on the system which can conclusively rule that a subset of the possible preparation procedures can not have taken place. We ask what conditions the set of states must obey in order for this to be possible and how well we can complete the task when it is not. The task of quantum state discrimination forms a subclass of this set of problems. Within this paper we formulate the general problem as a Semidefinite Program (SDP), enabling us to derive sufficient and necessary conditions for a measurement to be optimal. Furthermore, we obtain a necessary condition on the set of states for exclusion to be achievable with certainty and give a construction for a lower bound on the probability of error. This task of conclusively excluding states has gained importance in the context of the foundations of quantum mechanics due to a result of Pusey, Barrett and Rudolph (PBR). Motivated by this, we use our SDP to derive a bound on how well a class of hidden variable models can perform at a particular task, proving an analogue of Tsirelson's bound for the PBR experiment and the optimality of a measurement given by PBR in the process. We also introduce variations of conclusive exclusion, including unambiguous state exclusion, and state exclusion with worst case error.

quant-ph↗

Unextendible Mutually Unbiased Bases from Pauli Classes

We provide a construction of sets of (d/2+1) mutually unbiased bases (MUBs) in dimensions d=4,8 using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the Pauli group. However, specific examples of sets of MUBs obtained using our construction are shown to be strongly unextendible; that is, there does not exist another vector that is unbiased with respect to the elements in the set. We conjecture the existence of such unextendible sets in higher dimensions (d=2^{n}, n>3) as well. Furthermore, we note an interesting connection between these unextendible sets and state-independent proofs of the Kochen-Specker Theorem for two-qubit systems. Our construction also leads to a proof of the tightness of a H_{2} entropic uncertainty relation for any set of three MUBs constructed from Pauli classes in d=4.

quant-ph↗

Tight bounds on the distinguishability of quantum states under separable measurements

One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this work, we characterize the distinguishability of sets of multipartite quantum states when restricted to separable measurements -- those which contain the class of local measurements but nevertheless are free of entanglement between the component systems. We consider two quantities: The separable fidelity -- a truly quantum quantity -- which measures how well we can "clone" the input state, and the classical probability of success, which simply gives the optimal probability of identifying the state correctly. We obtain lower and upper bounds on the separable fidelity and give several examples in the bipartite and multipartite settings where these bounds are optimal. Moreover the optimal values in these cases can be attained by local measurements. We further show that for distinguishing orthogonal states under separable measurements, a strategy that maximizes the probability of success is also optimal for separable fidelity. We point out that the equality of fidelity and success probability does not depend on an using optimal strategy, only on the orthogonality of the states. To illustrate this, we present an example where two sets (one consisting of orthogonal states, and the other non-orthogonal states) are shown to have the same separable fidelity even though the success probabilities are different.

quant-ph↗

Operational measure of incompatibility of noncommuting observables

Uncertainty relations are often considered to be a measure of incompatibility of noncommuting observables. However, such a consideration is not valid in general, motivating the need for an alternate measure that applies to any set of noncommuting observables. We present an operational approach to quantifying incompatibility without invoking uncertainty relations. Our measure aims to capture the incompatibility of noncommuting observables as manifest in the non-orthogonality of their eigenstates. We prove that this measure has all the desired properties: it is zero when the observables commute, strictly greater than zero when they do not, and is maximum when they are mutually unbiased. We also obtain tight upper bounds on this measure for any N noncommuting observables and compute it exactly when the observables are mutually unbiased.

quant-ph↗

Optimal fidelity for a quantum channel may be attained by non-maximally entangled states

To establish an entangled state of optimal fidelity between two distant observers when the available quantum channel is noisy, is a central problem in quantum information theory. We consider an instance of this problem for two-qubit systems when only a single use of the channel and local post-processing by trace preserving operations are allowed. We show that the optimal fidelity is obtained only when part of an appropriate non-maximally entangled state is transmitted through the channel. The entanglement of this state can be vanishingly small when the channel becomes very noisy. Moreover, in the optimal case no further local processing is required to enhance the fidelity. We further show that local post-processing can enhance fidelity if and only if the amount of noise is larger than a critical value and entanglement of the transmitted state is bounded from below. A notable consequence of these results is that the ordering of states under an entanglement monotone can be reversed even when the states undergo the same local interaction via a trace-preserving completely positive map.

quant-ph↗

Entanglement, mixedness and perfect local discrimination of orthogonal quantum states

It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper bounds on the number of perfect LOCC distinguishable orthogonal mixed states. The first one depends only on pure-state entanglement within the supports of the states, and therefore may be easy to compute in many instances. The second bound is optimal in the sense that it optimizes the bounding quantities, not necessarily function of entanglement alone, over all orthogonal mixed state ensembles (satisfying certain conditions) admissible within the supports of the density matrices.

quant-ph↗

LOCC distinguishability of unilaterally transformable quantum states

We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that if the states can be exactly discriminated by one-way LOCC where Alice goes first, then the unitary operators can also be perfectly distinguished by an orthogonal measurement on Bob's Hilbert space. We give examples of sets of N<=d maximally entangled states in $d \otimes d $ for d=4,5,6 that are not perfectly distinguishable by one-way LOCC. Interestingly for d=5,6 our examples consist of four and five states respectively. We conjecture that these states cannot be perfectly discriminated by two-way LOCC.

quant-ph↗

More nonlocality with less purity

Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy limit this kind of nonlocality is fundamentally different for pure and mixed quantum states. In particular, orthogonal mixed states may not be distinguishable by local operations and classical communication (LOCC), no matter how many copies are supplied, whereas any set of N orthogonal pure states can be perfectly discriminated with m copies, where, m<N. Thus mixed quantum states can exhibit a new kind of nonlocality absent in pure states. We also argue that a set of orthogonal quantum states may be said to be maximally indistinguishable iff the set is not conclusively locally distinguishable with multiple copies.

quant-ph↗

Entanglement cost of two-qubit orthogonal measurements

The "entanglement cost" of a bipartite measurement is the amount of shared entanglement two participants need to use up in order to carry out the given measurement by means of local operations and classical communication. Here we numerically investigate the entanglement cost of generic orthogonal measurements on two qubits. Our results strongly suggest that for almost all measurements of this kind, the entanglement cost is strictly greater than the average entanglement of the eigenstates associated with the measurements, implying that the nonseparability of a two-qubit orthogonal measurement is generically distinct from the nonseparability of its eigenstates.

quant-ph↗