arXiv subjects
Publications and source records attributed to Ujjwal Sen.
We show that the no-deleting and no-cloning principles are implications of information conservation principle. This is unlike in classical physics, where cloning and deleting are possible, independently of information conservation. Connections with the second law of thermodynamics are also discusssed.
The technique of quantum repeaters is a promising candidate for sending quantum states over long distances through a lossy channel. The usual discussions of this technique deals with only a finite dimensional Hilbert space. However the qubits with which one implements this procedure will "ride" on continuous degrees of freedom of the carrier particles. Here we analyze the action of quantum repeaters using a model based on pulsed parametric down conversion entanglement swapping. Our model contains some basic traits of a real experiment. We show that the state created, after the use of any number of parametric down converters in a series of entanglement swappings, is always an entangled (actually distillable) state, although of a different form than the one that is usually assumed. Furthermore, the output state always violates a Bell inequality.
We use a recently proposed measure of quantum correlations (work deficit), to measure the strength of the nonlocality of an equal mixture of two bipartite, orthogonal, but locally indistinguishable separable states. This gives supporting evidence of nonzero value for a separable state, for this measure of nonlocality. We also show that this measure of quantum correlations places a different order on the set of states, than the good asymptotic measures of entanglement. And that such a different order imposed on two states by the work deficit and any entanglement measure, cannot be explained by mixedness alone.
A new paradigm for distributed quantum systems where information is a valuable resource is developed. After finding a unique measure for information, we construct a scheme for it's manipulation in analogy with entanglement theory. In this scheme instead of maximally entangled states, two parties distill local states. We show that, surprisingly, the main tools of entanglement theory are general enough to work in this opposite scheme. Up to plausible assumptions, we show that the amount of information that must be lost during the protocol of concentration of local information can be expressed as the relative entropy distance from some special set of states.
We consider a Bell inequality for a continuous range of settings of the apparatus at each site. This "functional" Bell inequality gives a better range of violation for generalized GHZ states. Also a family of N-qubit bound entangled states violate this inequality for N>5.
We provide a method for checking indistinguishability of a set of multipartite orthogonal states by local operations and classical communication (LOCC). It bases on the principle of nonincreasing of entanglement under LOCC. This method originates from the one introduced by Ghosh \emph{et al.} (Phys. Rev. Lett. \textbf{87}, 5807 (2001) (quant-ph/0106148)), though we deal with {\emph pure} states. In the bipartite case, our method is operational, although we do not know whether it can always detect local indistinguishability. We apply our method to show that an arbitrary complete multipartite orthogonal basis is indistinguishable if it contains at least one entangled state. We also show that probabilistic distinguishing is possible for full basis if and only if all vectors are product. We employ our method to prove local indistinguishability in a very interesting example akin to "nonlocality without entanglement".
We show that in a cloning process, whether deterministic inexact or probabilistic exact, one can take an arbitrary blank state while still using a fixed cloning machine.
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.
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.
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.
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.
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.
Let (\{| ψ> ,| ϕ>}) be an incomparable pair of states ((| ψ\nleftrightarrow | ϕ>)), \emph, i.e., (| ψ>) and (| ϕ>) cannot be transformed to each other with probability one by local transformations and classical communication (LOCC). We show that incomparable states can be multiple-copy transformable, \emph, i.e., there can exist a \emph{k}, such that (| ψ> ^{\otimes k+1}\to | ϕ> ^{\otimes k+1}), i.e., (k+1) copies of (| ψ>) can be transformed to (k+1) copies of (| ϕ>) with probability one by LOCC but (| ψ> ^{\otimes n}\nleftrightarrow | ϕ> ^{\otimes n} \forall n\leq k). We call such states \emph{k}-copy LOCC incomparable. We provide a necessary condition for a given pair of states to be \emph{k}-copy LOCC incomparable for some \emph{k}. We also show that there exist states that are neither \emph{k}-copy LOCC incomparable for any \emph{k} nor catalyzable even with multiple copies. We call such states strongly incomparable. We give a sufficient condition for strong incomparability. We demonstrate that the optimal probability of a conclusive transformation involving many copies, (p_{max}(| ψ> ^{\otimes m}\to | ϕ> ^{\otimes m})) can decrease exponentially with the number of source states (m), even if the source state has \emph{more} entropy of entanglement.
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$.
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.
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.
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)).
This paper has been withdrawn as the result is not correct.