37,632 research outputs found
When only two thirds of the entanglement can be distilled
We provide an example of distillable bipartite mixed state such that, even in
the asymptotic limit, more pure-state entanglement is required to create it
than can be distilled from it. Thus, we show that the irreversibility in the
processes of formation and distillation of bipartite states, recently proved in
[G. Vidal, J.I. Cirac, Phys. Rev. Lett. 86, (2001) 5803-5806], is not limited
to bound-entangled states.Comment: 4 pages, revtex, 1 figur
Classical communication and non-classical fidelity of quantum teleportation
In quantum teleportation, the role of entanglement has been much discussed.
It is known that entanglement is necessary for achieving non-classical
teleportation fidelity. Here we focus on the amount of classical communication
that is necessary to obtain non-classical fidelity in teleportation. We
quantify the amount of classical communication that is sufficient for achieving
non-classical fidelity for two independent 1-bit and single 2-bits noisy
classical channels. It is shown that on average 0.208 bits of classical
communication is sufficient to get non-classical fidelity. We also find the
necessary amount of classical communication in case of isotropic
transformation. Finally we study how the amount of sufficient classical
communication increases with weakening of entanglement used in the
teleportation process.Comment: Accepted in Quantum Info. Proces
On the geometric distance between quantum states with positive partial transposition and private states
We prove an analytic positive lower bound for the geometric distance between
entangled positive partial transpose (PPT) states of a broad class and any
private state that delivers one secure key bit. Our proof holds for any Hilbert
space of finite dimension. Although our result is proven for a specific class
of PPT states, we show that our bound nonetheless holds for all known entangled
PPT states with non-zero distillable key rates whether or not they are in our
special class.Comment: 16 page
Quantum computers can search rapidly by using almost any transformation
A quantum computer has a clear advantage over a classical computer for
exhaustive search. The quantum mechanical algorithm for exhaustive search was
originally derived by using subtle properties of a particular quantum
mechanical operation called the Walsh-Hadamard (W-H) transform. This paper
shows that this algorithm can be implemented by replacing the W-H transform by
almost any quantum mechanical operation. This leads to several new applications
where it improves the number of steps by a square-root. It also broadens the
scope for implementation since it demonstrates quantum mechanical algorithms
that can readily adapt to available technology.Comment: This paper is an adapted version of quant-ph/9711043. It has been
modified to make it more readable for physicists. 9 pages, postscrip
Quantum cobwebs: Universal entangling of quantum states
Entangling an unknown qubit with one type of reference state is generally
impossible. However, entangling an unknown qubit with two types of reference
states is possible. To achieve this, we introduce a new class of states called
zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and
study their salient features. Using shared-ZSA state, local operation and
classical communication we give a protocol for creating multipartite entangled
states of an unknown quantum state with two types of reference states at remote
places. This provides a way of encoding an unknown pure qubit state into a
multiqubit entangled state. We quantify the amount of classical and quantum
resources required to create universal entangled states. This is possibly a
strongest form of quantum bit hiding with multiparties.Comment: Invited talk in II Winter Institute on FQTQO: Quantum Information
Processing, held at S. N. Bose Center for Basic Science, Kolkata, during Jan
2-11, 2002. (To appear in Pramana-J. of Physics, 2002.
Mixedness and teleportation
We show that on exceeding a certain degree of mixedness (as quantified by the
von Neumann entropy), entangled states become useless for teleporatation. By
increasing the dimension of the entangled systems, this entropy threshold can
be made arbitrarily close to maximal. This entropy is found to exceed the
entropy threshold sufficient to ensure the failure of dense coding.Comment: 6 pages, no figure
Irreversibility in asymptotic manipulations of entanglement
We show that the process of entanglement distillation is irreversible by
showing that the entanglement cost of a bound entangled state is finite. Such
irreversibility remains even if extra pure entanglement is loaned to assist the
distillation process.Comment: RevTex, 3 pages, no figures Result on indistillability of PPT states
under pure entanglement catalytic LOCC adde
- …