Write
262
edits
Probabilistic Cloning: Difference between revisions
→Pseudo Code
| Line 33: | Line 33: | ||
<math>p = \frac{1}{1 + cos2\eta}</math> | <math>p = \frac{1}{1 + cos2\eta}</math> | ||
== | ==Pseudocode== | ||
The probabilistic cloning machine can only perform effectively for a special set of input states. It was shown that states chosen from a set <math>S = \{|\psi_1\rangle, |\psi_2\rangle, ..., |\psi_n\rangle,\}</math> can be probabilistic-ally cloned if and only if the <math>|\psi_i\rangle</math> are linearly independent. This protocol in general consists of three stages as follows: | The probabilistic cloning machine can only perform effectively for a special set of input states. It was shown that states chosen from a set <math>S = \{|\psi_1\rangle, |\psi_2\rangle, ..., |\psi_n\rangle,\}</math> can be probabilistic-ally cloned if and only if the <math>|\psi_i\rangle</math> are linearly independent. This protocol in general consists of three stages as follows: | ||
===General case=== | ===General case=== | ||