3,690 research outputs found
Any subspace is locally distinguishable
A subspace of a multipartite Hilbert space is called \textit{locally
indistinguishable} if any orthogonal basis of this subspace cannot be perfectly
distinguished by local operations and classical communication. Previously it
was shown that any bipartite system such that and has
a locally indistinguishable subspace. However, it has been an open problem
since 2005 whether there is a locally indistinguishable bipartite subspace with
a qubit subsystem. We settle this problem by showing that any
bipartite subspace is locally distinguishable in the sense it contains a basis
perfectly distinguishable by LOCC. As an interesting application, we show that
any quantum channel with two Kraus operations has optimal environment-assisted
classical capacity.Comment: 3 pages (Revtex 4).Comments are welcome
Bisimulation for quantum processes
In this paper we introduce a novel notion of probabilistic bisimulation for
quantum processes and prove that it is congruent with respect to various
process algebra combinators including parallel composition even when both
classical and quantum communications are present. We also establish some basic
algebraic laws for this bisimulation. In particular, we prove uniqueness of the
solutions to recursive equations of quantum processes, which provides a
powerful proof technique for verifying complex quantum protocols.Comment: Journal versio
- β¦