65 research outputs found
Local Distinguishability of Multipartite Orthogonal Quantum States
We consider one copy of a quantum system prepared in one of two orthogonal
pure states, entangled or otherwise, and distributed between any number of
parties. We demonstrate that it is possible to identify which of these two
states the system is in by means of local operations and classical
communication alone. The protocol we outline is both completely reliable and
completely general - it will correctly distinguish any two orthogonal states
100% of the time.Comment: 5 pages, revte
Distinguishing two-qubit states using local measurements and restricted classical communication
The problem of unambiguous state discrimination consists of determining which
of a set of known quantum states a particular system is in. One is allowed to
fail, but not to make a mistake. The optimal procedure is the one with the
lowest failure probability. This procedure has been extended to bipartite
states where the two parties, Alice and Bob, are allowed to manipulate their
particles locally and communicate classically in order to determine which of
two possible two-particle states they have been given. The failure probability
of this local procedure has been shown to be the same as if the particles were
together in the same location. Here we examine the effect of restricting the
classical communication between the parties, either allowing none or
eliminating the possibility that one party's measurement depends on the result
of the other party's. These issues are studied for two-qubit states, and
optimal procedures are found. In some cases the restrictions cause increases in
the failure probability, but in other cases they do not. Applications of these
procedures, in particular to secret sharing, are discussed.Comment: 18 pages, two figure
Generic local distinguishability and completely entangled subspaces
A subspace of a multipartite Hilbert space is completely entangled if it
contains no product states. Such subspaces can be large with a known maximum
size, S, approaching the full dimension of the system, D. We show that almost
all subspaces with dimension less than or equal to S are completely entangled,
and then use this fact to prove that n random pure quantum states are
unambiguously locally distinguishable if and only if n does not exceed D-S.
This condition holds for almost all sets of states of all multipartite systems,
and reveals something surprising. The criterion is identical for separable and
for nonseparable states: entanglement makes no difference.Comment: 12 page
Classical and quantum fingerprinting with shared randomness and one-sided error
Within the simultaneous message passing model of communication complexity,
under a public-coin assumption, we derive the minimum achievable worst-case
error probability of a classical fingerprinting protocol with one-sided error.
We then present entanglement-assisted quantum fingerprinting protocols
attaining worst-case error probabilities that breach this bound.Comment: 10 pages, 1 figur
Distillable entanglement in dimension
Distillable entanglement () is one of the acceptable measures of
entanglement of mixed states. Based on discrimination through local operation
and classical communication, this paper gives for two classes of
orthogonal multipartite maximally entangled states.Comment: 6 page
Mixture of multiple copies of maximally entangled states is quasi-pure
Employing the general BXOR operation and local state discrimination, the
mixed state of the form
\rho^{(k)}_{d}=\frac{1}{d^{2}}\sum_{m,n=0}^{d-1}(|\phi_{mn}><\phi_{mn}|)^{\otim
es k} is proved to be quasi-pure, where is the canonical set
of mutually orthogonal maximally entangled states in . Therefore
irreversibility does not occur in the process of distillation for this family
of states. Also, the distillable entanglement is calculated explicitly.Comment: 6 pages, 1 figure. The paper is subtantially revised and the general
proof is give
Optimally Conclusive Discrimination of Non-orthogonal Entangled States Locally
We consider one copy of a quantum system prepared with equal prior
probability in one of two non-orthogonal entangled states of multipartite
distributed among separated parties. We demonstrate that these two states can
be optimally distinguished in the sense of conclusive discrimination by local
operations and classical communications(LOCC) alone. And this proves strictly
the conjecture that Virmani et.al. [8] confirmed numerically and analytically.
Generally, the optimal protocol requires local POVM operations which are
explicitly constructed. The result manifests that the distinguishable
information is obtained only and completely at the last operation and all prior
ones give no information about that state.Comment: 4 pages, no figure, revtex. few typos correcte
A framework for bounding nonlocality of state discrimination
We consider the class of protocols that can be implemented by local quantum
operations and classical communication (LOCC) between two parties. In
particular, we focus on the task of discriminating a known set of quantum
states by LOCC. Building on the work in the paper "Quantum nonlocality without
entanglement" [BDF+99], we provide a framework for bounding the amount of
nonlocality in a given set of bipartite quantum states in terms of a lower
bound on the probability of error in any LOCC discrimination protocol. We apply
our framework to an orthonormal product basis known as the domino states and
obtain an alternative and simplified proof that quantifies its nonlocality. We
generalize this result for similar bases in larger dimensions, as well as the
"rotated" domino states, resolving a long-standing open question [BDF+99].Comment: 33 pages, 7 figures, 1 tabl
Experimentally obtaining the Likeness of Two Unknown Quantum States on an NMR Quantum Information Processor
Recently quantum states discrimination has been frequently studied. In this
paper we study them from the other way round, the likeness of two quantum
states. The fidelity is used to describe the likeness of two quantum states.
Then we presented a scheme to obtain the fidelity of two unknown qubits
directly from the integral area of the spectra of the assistant qubit(spin) on
an NMR Quantum Information Processor. Finally we demonstrated the scheme on a
three-qubit quantum information processor. The experimental data are consistent
with the theoretical expectation with an average error of 0.05, which confirms
the scheme.Comment: 3 pages, 4 figure
- …