Searcharxiv⌕ Search

arXiv subjects

Sibasish Ghosh

Publications and source records attributed to Sibasish Ghosh.

102 records · Page 6Linked to original sources

On local indistinguishability of orthogonal pure states by using a bound on distillable entanglement

We show that the four states a|00>+b|11>, b^*|00>-a^*|11>, c|01>+d|10> and d^*|01>-c^*|10> cannot be discriminated with certainty if only local operations and classical communication (LOCC) are allowed and if only a single copy is provided, except in the case when they are simply |00>, |11>, |01> and |10> (in which case they are trivially distinguishable with LOCC). We go on to show that there exists a continuous range of values of a, b, c and d such that even three states among the above four are not locally distinguishable, if only a single copy is provided. The proof follows from the fact that logarithmic negativity is an upper bound of distillable entanglement.

quant-ph↗

Entanglement vs. Noncommutativity in Teleportation

We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting qubits. We further show that to teleport any set of commuting qubits, it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any set of bipartite entangled states can be exactly disentangled if the single particle density matrices of any one party commute.

quant-ph↗

Entanglement teleportation via Bell Mixture

We investigate the teleportation of the bipartite entangled states through two equally noisy quantum channels, namely mixture of Bell states. There is a particular mixed state channel for which all pure entanglement in a known Schmidt basis remain entangled after teleportation and it happens till the channel state remains entangled. Werner state channel lacks both these features. The relation of these noisy channels with violation of Bell's inequality and 2-E inequality is studied.

quant-ph↗

Distinguishability of the Bell states

More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of (4\otimes 4) mixed states.

quant-ph↗

Mixedness in Bell-violation vs. Entanglement of Formation

Recently Munro, Nemoto and White (The Bell Inequality: A measure of Entanglement?, quant-ph/0102119) tried to indicate that the reason behind a state rho having higher amount of entanglement (as quantified by the entanglement of formation) than a state eta, but producing the same amount of Bell-violation, is due to the fact that the amount of mixedness (as quantified by the linearised entropy) in rho is higher than that in eta. We counter their argument with examples. We extend these considerations to the von Neumann entropy. Our results suggest that the reason as to why equal amount of Bell-violation requires different amounts of entanglement cannot, at least, be explained by mixedness alone.

quant-ph↗

Realization of Optimal Disentanglement by Teleportation via Separable Channel

We discuss here the best disentanglement processes of states of two two-level systems which belong to (i) the universal set, (ii) the set in which the states of one party lie on a single great circle of the Bloch sphere, and (iii) the set in which the states of one party commute with each other, by teleporting the states of one party (on which the disentangling machine is acting) through three particular type of separable channels, each of which is a mixture of Bell states. In the general scenario, by teleporting one party's state of an arbitrary entangled state of two two-level parties through some mixture of Bell states, we have shown that this entangled state can be made separable by using a physically realizable map $\tilde{V}$, acting on one party's states, if $\tilde{V} (I) = I, \tilde{V} (σ_j) = λ_j σ_j$, where $λ_j \ge 0$ (for $j = 1, 2, 3$), and $λ_1 + λ_2 + λ_3 \le 1$.

quant-ph↗

Teleporting Noncommuting Qubits Require Maximal Entanglement

Very recently, it was shown by Ghosh, Kar, Roy and Sen (\emph{Entanglement vs. Noncommutativity in Teleportation}, quant-ph/0010012) that if it is \emph{a priori} known that the state to be teleported is from a commuting set of qubits, a separable channel is sufficient. We show that 1 ebit of entanglement is a necessary resource to teleport a qubit even when it is known to be one of two noncommuting states.

quant-ph↗

Entanglement Teleportation Through Cat-like States

We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ-class state and where {\it all} the four parties are at distant locations. We then generalize this situation to the case of teleportation of entangled states shared between Claire1, Claire2, ....., Claire(N-1) and Alice to Bob1, Bob2, ....., BobN when Alice and the N Bobs share a single copy of a Cat-like state and where again {\it all} the 2N parties are at distant locations.

quant-ph↗

Does Anti-Parallel Spin Always Contain more Information ?

We show that the Bloch vectors lying on any great circle is the largest set S(L) for which the parallel states |n,n> can always be transformed into the anti-parallel states |n,-n>. Thus more information about the Bloch vector is not extractable from |n,-n> than from |n,n> by any measuring strategy, for the Bloch vector belonging to S(L). Surprisingly, the largest set of Bloch vectors for which the corresponding qubits can be flipped is again S(L). We then show that probabilistic exact parallel to anti-parallel transformation is not possible if the corresponding anti-parallel spins span the whole Hilbert space of the two qubits. These considerations allow us to generalise a conjecture of Gisin and Popescu (Phys. Rev. Lett. 83 432 (1999)).

quant-ph↗

Optimal Cloning and No Signaling

It is shown that no signaling constraint generates the whole class of 1 $\rightarrow$ 2 optimal quantum cloning machines of single qubits.

quant-ph↗