Searcharxiv⌕ Search

arXiv subjects

Anirban Roy

Publications and source records attributed to Anirban Roy.

At least 73 records · Page 4Linked to original sources
arXiv2007

Local cloning of genuine entangled states of three qubit

We discuss (im)possibility of the exact cloning of orthogonal but genuinely entangled three qubit states aided with entangled ancila under local operation and classical communication. Whereas any two orthogonal GHZ states taken from the canonical GHZ basis, can be cloned with the help of a known GHZ state, surprisingly we find that no two W states can be cloned by using any known three qubit (possibly entangled) state as blank copy.

quant-ph↗
arXiv2007

Local Cloning of Entangled Qubits

We discuss the exact cloning of orthogonal but entangled qubits under local operations and classical communication. The amount of entanglement necessary in blank copy is obtained for various cases. Surprisingly this amount is more than 1 ebit for certain set of two nonmaximal but equally entangled states of two qubits system. To clone any three two qubits Bell states at least log2 3 ebit is necessary.

quant-ph↗
arXiv2006

Winning strategies for pseudo-telepathy games using single non-local box

Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension. A sufficient condition to have a winning strategy for the impossible colouring pseudo-telepathy game for general $d$-dimension, with single use of NL-box, is then described. It is also shown that the magic square pseudo-telepathy game of any size can be won by using just two ebits of entanglement -- for quantum strategy, and by a single NL-box -- for non-local strategy.

quant-ph↗
arXiv2004

Local cloning of Bell states and distillable entanglement

The necessary and sufficient amount of entanglement required for cloning of orthogonal Bell states by local operation and classical communication is derived, and using this result, we provide here some additional examples of reversible, as well as irreversible states.

quant-ph↗
arXiv2004

Locally Accessible Information and Distillation of Entanglement

A new type of complementary relation is found between locally accessible information and final average entanglement for given ensemble. It is also shown that in some well known distillation protocol, this complementary relation is optimally satisfied. We discuss the interesting trade-off between locally accessible information and distillable entanglement for some states.

quant-ph↗
arXiv2003

Probabilistic cloning and signalling

We give a proof of impossibility of probabilistic exact $1\to 2$ cloning of any three different states of a qubit. The simplicity of the proof is due to the use of a surprising result of remote state preparation [M.-Yong Ye, Y.-Sheng Zhang and G.-Can Guo, quant-ph/0307027 (2003)]. The result is extented to higher dimentional cases for special ensemble of states.

quant-ph↗
arXiv2003

Distinguishability of maximally entangled states

In $2 \otimes 2$, more than 2 orthogonal Bell states with single copy can never be discriminated with certainty if only local operations and classical communication (LOCC) are allowed. More than $d$ orthogonal maximally entangled states in $d \otimed d$, which are in cannonical form, used by Bennett et. al. [Phys. Rev. Lett. 70 (1993) 1895] can never be discriminated with certainty when a single copy of the states is provided. Interestingly we show that all orthogonal maximally entangled states, which are in cannonical form, can be discriminated with certainty if and only if two copies of each of the states are provided. The highly nontrivial problem of local discrimination of $d$ or less no. of pairwise orthogonal maximally entangled states in $d \otimes d$ (in single copy case), which are in cannonical form, is also discussed.

quant-ph↗
arXiv2001

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↗
arXiv2001

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↗
arXiv2001

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↗
arXiv2001

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↗
arXiv2001

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↗
arXiv2000

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↗
arXiv2000

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↗
arXiv2000

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↗