Optimal Universal N-M Cloning

This protocol achieves the functionality of Quantum Cloning. Symmetric or Optimal Universal ${\displaystyle N\rightarrow M}$ quantum cloning machine (QCM) transformation, acting on N original qubits, ${\displaystyle (M-N)}$ blank qubits and an extra system which usually contains the states of the QCM itself, and produces M identical copies. Mathematically, this transformation is a Unitary transformation (It preserves the inner product). This machine is universal meaning it is not depending on the input states and works for all the possible inputs. Also, the machine is symmetric so all the output clones are the same and have the same fidelity with the original states. We investigate the optimal protocol which has the maximum possible average fidelity over all the states (produces best clones in average for all of the states).

Tags: Universal Cloning, optimal cloning, N to M cloning, symmetric cloning, Asymmetric Cloning,Building Blocks, Quantum Cloning, copying quantum states, Quantum Functionality, Specific Task, Probabilistic Cloning

Assumptions

• We assume that all of the original states are identical and also all of the output copies will be identical at the end of the protocol (In other words, the final output state belongs to the symmetric subspace of M qubits).
• We assume that the protocol is an approximate deterministic cloning protocol, meaning that in every round it produces approximate copies of the original states.

Outline

The steps of the protocol will be as follow:

• Prepare your N original states and ${\displaystyle (M-N)}$ blank states. This machine acts on these states and also on internal states of the QCM.
• Perform the operation of the QCM which is a transformation taking these states to M identical states as close as possible to the original states. This unitary operation can be implemented by quantum gates (or other equivalent quantum computing models)
• Discard the extra machine states that have been used in the previous step. Mathematically this means that you should ${\displaystyle traceout}$ the states of the machine. The final output states will be the M approximately similar copies.

Notation

• ${\displaystyle |\psi \rangle ^{\otimes N}:}$ N initial states
• ${\displaystyle |\psi ^{\perp }\rangle :}$ The state orthogonal to ${\displaystyle |\psi \rangle }$
• ${\displaystyle R_{j}:}$ ancillary and internal states of the QCM
• ${\displaystyle U_{N,M}:}$ Unitary operation describing the QCM
• ${\displaystyle F_{N\rightarrow M}:}$ Fidelity of the USQCM showing how close the M output copies are to the N original states

Properties

• The protocol-
• assumes that all of the original states are identical and also all of the output copies will be identical at the end of the protocol (In other words, the final output state belongs to the symmetric subspace of M qubits).
• assumes that the protocol is an approximate deterministic cloning protocol, meaning that in every round it produces approximate copies of the original states.
• Fidelity of the ${\displaystyle N\rightarrow M}$ UQCM: ${\displaystyle F_{N\rightarrow M}={\frac {MN+M+N}{M(N+2)}}}$
• Special case of 1 qubit to 2 qubits: ${\displaystyle F_{1\rightarrow 2}={\frac {5}{6}}}$

Protocol Description

Input: j qubits where ${\displaystyle R_{j}}$ are ancillary and internal states of the QCM.

Stage 1 State preparation

1. Prepare N initial states: ${\displaystyle |\psi \rangle ^{\otimes N}}$ and ${\displaystyle M-N}$ blank states: ${\displaystyle |0\rangle ^{\otimes M-N}}$

Stage 2 Unitary transformation

1. Perform the following unitary transformation on input state ${\displaystyle |N\psi \rangle =|\psi \rangle ^{\otimes N}|0\rangle ^{\otimes M-N}|R\rangle }$

${\displaystyle U_{N,M}|N\psi \rangle =\sum _{j=0}^{M-N}\alpha _{j}|(M-j)\psi ,j\psi ^{\perp }\rangle \otimes R_{j}(\psi )}$
where ${\displaystyle \alpha _{j}={\sqrt {\frac {N+1}{M+1}}}{\sqrt {\frac {(M-N)!(M-j)!}{(M-N-j)!M!}}}}$
Stage 3: Trace out the QCM state

1. Trace out the state of the QCM in ${\displaystyle R_{j}}$ states.

Further Information

*contributed by Mina Doosti