670 research outputs found
Entanglement molecules
We investigate the entanglement properties of multiparticle systems,
concentrating on the case where the entanglement is robust against disposal of
particles. Two qubits -belonging to a multipartite system- are entangled in
this sense iff their reduced density matrix is entangled. We introduce a family
of multiqubit states, for which one can choose for any pair of qubits
independently whether they should be entangled or not as well as the relative
strength of the entanglement, thus providing the possibility to construct all
kinds of ''Entanglement molecules''. For some particular configurations, we
also give the maximal amount of entanglement achievable.Comment: 4 pages, 1 figur
Characterization of two-qubit perfect entanglers
Here we consider perfect entanglers from another perspective. It is shown
that there are some {\em special} perfect entanglers which can maximally
entangle a {\em full} product basis. We have explicitly constructed a
one-parameter family of such entanglers together with the proper product basis
that they maximally entangle. This special family of perfect entanglers
contains some well-known operators such as {\textsc{cnot}} and
{\textsc{dcnot}}, but {\em not} {\small{\sqrt{\rm{\textsc{swap}}}}}. In
addition, it is shown that all perfect entanglers with entangling power equal
to the maximal value, 2/9, are also special perfect entanglers. It is proved
that the one-parameter family is the only possible set of special perfect
entanglers. Also we provide an analytic way to implement any arbitrary
two-qubit gate, given a proper special perfect entangler supplemented with
single-qubit gates. Such these gates are shown to provide a minimum universal
gate construction in that just two of them are necessary and sufficient in
implementation of a generic two-qubit gate.Comment: 6 pages, 1 eps figur
Multiparticle entanglement and its experimental detection
We discuss several aspects of multiparticle mixed state entanglement and its
experimental detection. First we consider entanglement between two particles
which is robust against disposals of other particles. To completely detect
these kinds of entanglement, full knowledge of the multiparticle density matrix
(or of all reduced density matrixes) is required. Then we review the relation
of the separability properties of l-partite splittings of a state to its
multipartite entanglement properties. We show that it suffices to determine the
diagonal matrix elements of in a certain basis in order to detect
multiparticle entanglement properties of . We apply these observations to
analyze two recent experiments, where multiparticle entangled states of 3 (4)
particles were produced. Finally, we focus on bound entangled states
(non-separable, non-distillable states) and show that they can be activated by
joint actions of the parties. We also provide several examples which show the
activation of bound entanglement with bound entanglement.Comment: 9 pages, no figures; submitted to The Journal of Physics A:
Mathematical and General, special issue in Quantum Information and
Computatio
Multipartite bound entangled states that violate Bell's inequality
We study the relation between distillability of multipartite states and
violation of Bell's inequality. We prove that there exist multipartite bound
entangled states (i.e. non-separable, non-distillable states) that violate a
multipartite Bell inequality. This implies that (i) violation of Bell's
inequality is not a sufficient condition for distillability and (ii) some bound
entangled states cannot be described by a local hidden variable model.Comment: 4 pages, no figure
Simple proof of confidentiality for private quantum channels in noisy environments
Complete security proofs for quantum communication protocols can be
notoriously involved, which convolutes their verification, and obfuscates the
key physical insights the security finally relies on. In such cases, for the
majority of the community, the utility of such proofs may be restricted. Here
we provide a simple proof of confidentiality for parallel quantum channels
established via entanglement distillation based on hashing, in the presence of
noise, and a malicious eavesdropper who is restricted only by the laws of
quantum mechanics. The direct contribution lies in improving the linear
confidentiality levels of recurrence-type entanglement distillation protocols
to exponential levels for hashing protocols. The proof directly exploits the
security relevant physical properties: measurement-based quantum computation
with resource states and the separation of Bell-pairs from an eavesdropper. The
proof also holds for situations where Eve has full control over the input
states, and obtains all information about the operations and noise applied by
the parties. The resulting state after hashing is private, i.e., disentangled
from the eavesdropper. Moreover, the noise regimes for entanglement
distillation and confidentiality do not coincide: Confidentiality can be
guaranteed even in situation where entanglement distillation fails. We extend
our results to multiparty situations which are of special interest for secure
quantum networks.Comment: 5 + 11 pages, 0 + 4 figures, A. Pirker and M. Zwerger contributed
equally to this work, replaced with accepted versio
The Power of LOCCq State Transformations
Reversible state transformations under entanglement non-increasing operations
give rise to entanglement measures. It is well known that asymptotic local
operations and classical communication (LOCC) are required to get a simple
operational measure of bipartite pure state entanglement. For bipartite mixed
states and multipartite pure states it is likely that a more powerful class of
operations will be needed. To this end \cite{BPRST01} have defined more
powerful versions of state transformations (or reducibilities), namely LOCCq
(asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC
(asymptotic LOCC with catalysis). In this paper we show that {\em LOCCq state
transformations are only as powerful as asymptotic LOCC state transformations}
for multipartite pure states. We first generalize the concept of entanglement
gambling from two parties to multiple parties: any pure multipartite entangled
state can be transformed to an EPR pair shared by some pair of parties and that
any irreducible party pure state can be used to create any other
state (pure or mixed), using only local operations and classical communication
(LOCC). We then use this tool to prove the result. We mention some applications
of multipartite entanglement gambling to multipartite distillability and to
characterizations of multipartite minimal entanglement generating sets. Finally
we discuss generalizations of this result to mixed states by defining the class
of {\em cat distillable states}
Long-range big quantum-data transmission
We introduce an alternative type of quantum repeater for long-range quantum
communication with improved scaling with the distance. We show that by
employing hashing, a deterministic entanglement distillation protocol with
one-way communication, one obtains a scalable scheme that allows one to reach
arbitrary distances, with constant overhead in resources per repeater station,
and ultrahigh rates. In practical terms, we show that also with moderate
resources of a few hundred qubits at each repeater station, one can reach
intercontinental distances. At the same time, a measurement-based
implementation allows one to tolerate high loss, but also operational and
memory errors of the order of several percent per qubit. This opens the way for
long-distance communication of big quantum data.Comment: revised manuscript including new result
- …