Probabilistic cloning and identification of linearly independent quantum states

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Extension of quant-ph/9705018, 12pages, latex, to appear in Phys. Rev. Lett

Scientific paper

10.1103/PhysRevLett.80.4999

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $\$=\left\{\left| \Psi_1\right> ,\left| \Psi_2\right> ,... ,\left| \Psi_n\right> \right\} $ can be probabilistically cloned if and only if $% \left| \Psi_1\right>$, $\left| \Psi_2\right>$, $... ,$ and $\left| \Psi_n\right>$ are linearly-independent. We derive the best possible cloning efficiencies. Probabilistic cloning has close connection with the problem of identification of a set of states, which is a type of $n+1$ outcome measurement on $n$ linearly independent states. The optimal efficiencies for this type of measurement are obtained.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Probabilistic cloning and identification of linearly independent quantum states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic cloning and identification of linearly independent quantum states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic cloning and identification of linearly independent quantum states will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-574481

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.