Editing Probabilistic Cloning

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
Line 1: Line 1:
This protocol achieves the functionality of [[Quantum Cloning]]. The term Probabilistic Machine identifies that the output copies are exactly identical to the original state but the protocol is not successful in all of the rounds. The probabilistic cloner is not a [[Quantum Cloning|universal quantum cloning machine]] and it is limited to a special class of input states. The laws of quantum mechanics allow a probabilistic cloner to make copies from a set of linearly-independent quantum states.</br></br>
This [[example protocol]] achieves the functionality of [[Quantum Cloning]]. The term Probabilistic Machine identifies that the output copies are exactly identical to the original state but the protocol is not successful in all of the rounds. The probabilistic cloner is not a [[Quantum Cloning|universal quantum cloning machine]] and it is limited to a special class of input states. The laws of quantum mechanics allow a probabilistic cloner to make copies from a set of linearly-independent quantum states.
'''Tags:''' [[Quantum Cloning#Protocols|Non-Universal Cloning]], [[Phase Variant Cloning]], [[State Dependent N-M Cloning]] [[Category: Building Blocks]] [[:Category: Building Blocks|Building Blocks]], [[Quantum Cloning]], [[Quantum Cloning|Non-Universal Cloning]], copying quantum states, [[:Category: Quantum Functionality|Quantum Functionality]][[Category: Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], [[Optimal Universal N-M Cloning|Optimal or Symmetric Cloning]]
'''Tags:''' [[Quantum Cloning#Protocols|Non-Universal Cloning]], [[Phase Variant Cloning]], [[State Dependent N-M Cloning]] [[Category: Building Blocks]] [[:Category: Building Blocks|Building Blocks]], [[Quantum Cloning]], [[Quantum Cloning|Non-Universal Cloning]], copying quantum states, [[:Category: Quantum Functionality|Quantum Functionality]][[Category: Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]],symmetric or [[Optimal Universal N-M Cloning|Optimal or Symmetric Cloning]]
==Assumptions==
==Assumptions==
* We assume that the protocol succeeds with a certain probability and we are able to get the exact copies of the input states.
* We assume that the protocol succeeds with a certain probability and we are able to get the exact copies of the input states.
Line 6: Line 6:
==Outline==
==Outline==
The probabilistic cloning machine is a quantum cloner which is only able to produce copies of a limited set of linearly-dependent states with a probability of success. Despite deterministic protocols which usually consist of performing a unitary transformation, probabilistic cloning protocols are continued by a measurement. Two cases for probabilistic cloning are discussed below, general case and special case of two qubits. The two-qubit case means that our probabilistic machine is able to copy two non-orthogonal qubits efficiently. A probabilistic cloning protocol has three stages: blank or ancillary state preparation, unitary evolution and, measurement. The protocol can be described as follows
The probabilistic cloning machine is a quantum cloner which is only able to produce copies of a limited set of linearly-dependent states with a probability of success. Despite deterministic protocols which usually consist of performing a unitary transformation, probabilistic cloning protocols are continued by a measurement. Two cases for probabilistic cloning are discussed below, general case and special case of two qubits. The two-qubit case means that our probabilistic machine is able to copy two non-orthogonal qubits efficiently. A probabilistic cloning protocol has three stages: blank or ancillary state preparation, unitary evolution and, measurement. The protocol can be described as follows
[[File:Probabilisticcloner.jpg|right|thumb|1000px| Probabilistic cloner circuit for a single-qubit state (from set of two nonorthogonal but linearly independent state): Qubits <math>x</math>, <math>y</math> and <math>z</math> are the original qubit, blank qubit, and assistant qubit, respectively.<math>\circ</math> and <math>\bullet</math> respectively mean that the control states are <math>|0\rangle</math> and <math>|1\rangle</math>. <math>\otimes</math> indicates the operational qubit of the CNOT gate. <math>U_1</math> and <math>U_2</math> denote the unitary operations controlled by qubit x (explained in details in the Pseudo-code section). <math>H</math> is the Hadamard gate. <math>PM</math> represents the measurement.]]
*'''General case:''' First, an orthonormal set of states should be prepared. These states will be used as ancillary states for the protocol. Then a unitary transformation will take the input states to a [[superposition]](linear combination of quantum states) of a successful two identically copied states and unsuccessful two-qubit states along with probes states to be measured later. The last stage is the measurement. The output is measured in the basis of the ancillary orthonormal states. With some probability of success, the result of the measurement is the desired outcome and the final state collapses to the two identical desired copies. Otherwise, the protocol is aborted.
*'''Two qubit case:''' This special case is a more practical and clear example of the above general probabilistic cloner. One is only interested in two non-orthogonal qubits to be effectively copied by the probabilistic cloning machine. Here, the orthonormal bases are <math>|0\rangle</math> and <math>|1\rangle</math>. At the first stage of the protocol, only two blank states (<math>|0\rangle|0\rangle</math>) are needed. At the second stage, the unitary transformation takes the states to a superposition of two identical states along with the state <math>|0\rangle</math> and a two-qubit state (wrong state) along with the qubit <math>|1\rangle</math>. At the final stage, the third qubit is be measured in basis <math>\{|0\rangle,|1\rangle\}</math>. If the result of the measurement is <math>|0\rangle</math> the protocol is successful. Otherwise, the round is discarded. This construction can be shown more clearly in the quantum circuit below.


==Notation==
*'''General case:''' First, an orthonormal set of states should be prepared. These states will be used as ancillary states for the protocol. Then a unitary transformation will take the input states to a [[superposition]](linear combination of quantum states) of a successful two identically copied states and unsuccessful two-qubit states along with probes states to be measured later. The last stage is measurement. Output is measured in the basis of the ancillary orthonormal states. With some probability of success, the result of measurement is the desired [[probe]] and the final state collapses to the two identical desired copies. Otherwise, the protocol is aborted.
*'''Two qubit case:''' This special case is a more practical and clear example of the above general probabilistic cloner. One is  only interested in two non-orthogonal qubits to be effectively copied by the probabilistic cloning machine. Here, the orthonormal bases are <math>|0\rangle</math> and <math>|1\rangle</math>. At the first stage of the protocol, only two blank states (<math>|0\rangle|0\rangle</math>) are needed. At the second stage, the unitary transformation takes the states to a superposition of two identical states along with the state <math>|0\rangle</math> and a two-qubit state (wrong state) along with the qubit <math>|1\rangle</math>. At the final stage, the third qubit is be measured in basis <math>\{|0\rangle,|1\rangle\}</math>. If the result of the measurement is <math>|0\rangle</math> the protocol is successful. Otherwise, the round is discarded. This construction can be shown more clearly in the quantum circuit alongside.
==Notations Used==
* <math>S = {|\psi_1\rangle, |\psi_2\rangle, ...}:</math> Set of linearly independent states which can be copied by the probabilistic cloning machine
* <math>S = {|\psi_1\rangle, |\psi_2\rangle, ...}:</math> Set of linearly independent states which can be copied by the probabilistic cloning machine
* <math>|\psi\rangle:</math> Input state of the probabilistic cloner
* <math>|\psi\rangle:</math> Input state of the probabilistic cloner
Line 33: Line 32:
<math>p = \frac{1}{1 + cos2\eta}</math>
<math>p = \frac{1}{1 + cos2\eta}</math>


==Protocol Description==
==Pseudo Code==
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===
'''<u>Stage 1</u>''' Ancilla preparation
'''<u>Stage 1</u>''' Ancilla preparation
# Prepare an orthonormal set of states such as <math>\{|A_k\rangle\}</math> where <math>\langle A_k|A_l\rangle = \delta_{kl}</math> for <math>k,l= 0,1,...,n</math>. These states act as ancillary states of the protocol. </br></br>
# Prepare an orthonormal set of states such as <math>\{|A_k\rangle\}</math> where <math>\langle A_k|A_l\rangle = \delta_{kl}</math> for <math>k,l= 0,1,...,n</math>. These states act as ancillary states of the protocol. </br></br>
'''<u>Stage 2</u>''' Unitary Evolution</br></br>
'''<u>Stage 2</u>''' Unitary Evolution</br>
'''Input:''' <math>|\psi_i\rangle</math>, <math>|0\rangle</math>, <math>|A\rangle</math></br>
'''Input:''' <math>|\psi_i\rangle</math>, <math>|0\rangle</math>, <math>|A\rangle</math>
'''Output:''' <math>U|\psi_i\rangle|0\rangle|A\rangle</math>
'''Output:''' <math>U|\psi_i\rangle|0\rangle|A\rangle</math>
# Perform the unitary transformation of the following form:</br>
# Perform the unitary transformation of the following form:</br>
<math>U|\psi_i\rangle|0\rangle|A\rangle = \sqrt{p_i}|\psi_i\rangle|\psi_i\rangle|A_0\rangle + \sum_{j=1}^{n} c_{ij}|\Phi^{j}_{AB}\rangle|A_j\rangle</math></br></br>
<math>U|\psi_i\rangle|0\rangle|A\rangle = \sqrt{p_i}|\psi_i\rangle|\psi_i\rangle|A_0\rangle + \sum_{j=1}^{n} c_{ij}|\Phi^{j}_{AB}\rangle|A_j\rangle</math></br></br>
'''<u>Stage 3</u>''' Measurements </br>
'''<u>Stage 3</u>''' Measurements </br>
'''Input:''' <math>\sqrt{p_i}|\psi_i\rangle|\psi_i\rangle|A_0\rangle + \sum_{j=1}^{n} c_{ij}|\Phi^{j}_{AB}\rangle|A_j\rangle</math></br>
'''Input:''' <math>\sqrt{p_i}|\psi_i\rangle|\psi_i\rangle|A_0\rangle + \sum_{j=1}^{n} c_{ij}|\Phi^{j}_{AB}\rangle|A_j\rangle</math>
'''Output:''' <math>|\psi_i\rangle|\psi_i\rangle</math> with probability <math>p_i</math>
'''Output:''' <math>|\psi_i\rangle|\psi_i\rangle</math> with probability <math>p_i</math>
#  Measure the ancilla states on the basis <math>{|A_k\rangle}</math>.
#  Measure the ancilla states on the basis <math>{|A_k\rangle}</math>.
Line 50: Line 49:
##'''Then''' the protocol is successful and the output is the desired clones.
##'''Then''' the protocol is successful and the output is the desired clones.
##'''Else''' Abort
##'''Else''' Abort
===Two qubit case===
===Two qubit case===
'''General Informaton:''' The special case of the above probabilistic cloning machine is the following protocol for two nonorthogonal qubit states. The input states for this machine are presented in the following form:</br>
'''General Informaton:''' The special case of the above probabilistic cloning machine is the following protocol for two nonorthogonal qubit states. The input states for this machine are presented in the following form:</br>
Line 64: Line 62:
here we labelled the three qubits by x, y and z</br></br>
here we labelled the three qubits by x, y and z</br></br>
'''<u>Stage 3</u>''' Measurements </br>
'''<u>Stage 3</u>''' Measurements </br>
'''Input:''' <math>\sqrt{p}|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y|0\rangle_z + \sqrt{1-p}|\Phi\rangle_{xy}|1\rangle_z</math></br>
'''Input:''' <math>\sqrt{p}|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y|0\rangle_z + \sqrt{1-p}|\Phi\rangle_{xy}|1\rangle_z</math>
'''Output:''' <math>|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y</math> with probabiliy p
'''Output:''' <math>|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y</math> with probabiliy p
# Measure qubit z in the standard basis (<math>|0\rangle</math> and <math>|1\rangle</math> basis).
# Measure qubit z in the standard basis ($|0\rangle$ and $|1\rangle$ basis).
##'''If''' the output of the measurement is <math>|0\rangle</math>
##'''If''' the output of the measurement is <math>|0\rangle</math>
##'''Then''' the protocol is successful and the final state of the machine are <math>|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y</math>
##'''Then''' the protocol is successful and the final state of the machine are <math>|\psi_{\pm}\rangle_x|\psi_{\pm}\rangle_y</math>
##'''Else''' the protocol failed and the final state of the machine is <math>|\Phi\rangle_{xy}</math>
##'''Else''' the protocol failed and the final state of the machine is <math>|\Phi\rangle_{xy}</math>
 
===The quantum circuit===
'''The quantum circuit'''
Finally, the quantum circuit which illustrates the above stages can be described to consist of following gates and parts which have been also shown in the figure in [[Probabilistic Cloning#Outline|Outline]]
  \hrule
* Reverse Controlled <math>U_1</math> gate: A controlled unitary gates with the <math>x</math> (original) qubit as the control qubit and the <math>z</math> qubit as the operational qubit. The unitary gate <math>U_1</math> acts only if the control qubit is <math>|0\rangle</math>. The unitary <math>U_1</math> is:</br>
Finally, the quantum circuit which illustrates the above stages consists of following gates and parts which have been also shown in the figure in [[Probabilistic Cloning#Outline|Outline]]
<math>U_1 = sin\beta |0\rangle\langle 0| + cos\beta |1\rangle\langle 0| + cos\beta |1\rangle\langle 0| - sin\beta |1\rangle\langle 1|</math></br>
* Reverse Controlled $U_1$ gate: A controlled unitary gates with the <math>x</math> (original) qubit as the control qubit and the <math>z</math> qubit as the operational qubit. The unitary gate <math>U_1</math> acts only if the control qubit is <math>|0\rangle</math>. The unitary <math>U_1</math> is:</br>
where the <math>\beta = arcsin\Bigg(\sqrt{\frac{1+tan^4\eta}{2}}\Bigg)</math>
    <math>U_1 = sin\beta |0\rangle\langle 0| + cos\beta |1\rangle\langle 0| + cos\beta |1\rangle\langle 0| - sin\beta |1\rangle\langle 1|</math></br>
where the <math>\beta = arcsin(\sqrt{\frac{1+tan^4\eta}{2}})</math>
* A normal [[CNOT]] gate: The control qubit is <math>y</math> and the operational qubit is <math>x</math> (The flip occurs if the control qubit is <math>|1\rangle</math>)
* A normal [[CNOT]] gate: The control qubit is <math>y</math> and the operational qubit is <math>x</math> (The flip occurs if the control qubit is <math>|1\rangle</math>)
* Reverse Controlled $U_2$ gate: A controlled unitary gates with the <math>x</math> (original) qubit as the control qubit and the <math>y</math> qubit as the operational qubit. The unitary gate <math>U_2</math> acts only if the control qubit is <math>|0\rangle</math>. The unitary <math>U_2</math> is:</br>
* Reverse Controlled $U_2$ gate: A controlled unitary gates with the <math>x</math> (original) qubit as the control qubit and the <math>y</math> qubit as the operational qubit. The unitary gate <math>U_2</math> acts only if the control qubit is <math>|0\rangle</math>. The unitary <math>U_2</math> is:</br>
<math>U_2 = sin\delta |0\rangle\langle 0| + cos\delta |1\rangle\langle 0| + cos\delta |1\rangle\langle 0| - sin\delta |1\rangle\langle 1|</math></br>
<math>U_2 = sin\delta |0\rangle\langle 0| + cos\delta |1\rangle\langle 0| + cos\delta |1\rangle\langle 0| - sin\delta |1\rangle\langle 1|</math></br>
where the <math>\delta = arcsin[(\sqrt{\frac{2}{1+tan^4\eta}} + \sqrt{\frac{2}{1+tan^{-4}\eta}})/2]</math>
where the <math>\delta = arcsin[(\sqrt{\frac{2}{1+tan^4\eta}} + \sqrt{\frac{2}{1+tan^{-4}\eta}})/2]</math>
* [[Hadamard gate]]: A Hadamard gate on qubit <math>y</math>
* [[Hadamard gate: A Hadamard gate on qubit $y$
* Measurement part: Measuring qubit <math>z</math> in the standard basis.
* Measurement part: Measuring qubit <math>z</math> in the standard basis.


==Further Information==
==Further Information==
<div style='text-align: right;'>''*contributed by Mina Doosti''</div>
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Quantum Protocol Zoo:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel Editing help (opens in new window)