Asymmetric Universal 1-2 Cloning
Functionality Description
Asymmetric universal cloning refers to a quantum cloning machine (QCM) where its output clones are not the same or in other words, they have different fidelities. Here we focus on universal cloning. In asymmetric cloning, we try to distribute information unequally among the copies. A trade-off relation exists between the fidelities, meaning if one of the copies are very close to the original state, the other one will be far from it. There are two approaches to this kind of cloning, both leading to same trade-off relation. Here we discuss the quantum circuit approach (Buzek et al., 1997) It can be also noted that the symmetric universal Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1 \rightarrow 2} cloning can be considered as a special case of the asymmetric universal cloning where the information between copies has been equally distributed.
Tags:Building blocks, Quantum Cloning, Universal Cloning, asymmetric cloning, symmetric cloning, copying quantum states, quantum functionality, symmetric or Optimal Cloning, Probabilistic Cloning
Requirements
Example:
Outline
In this protocol, there are three main stages. The first stage is a preparation stage. we prepare two ancillary states with special coefficients which will lead to the desired flow of the information between copied states. The original state will not be engaged at this stage. At the second stage the cloner circuit will act on all the three states (the original and two other states) and at the second stage the two copied state will appear at two of the outputs and one of the outputs should be discarded. The Procedure will be as following:
- Prepare two blank states and then perform a transformation taking these two states to a new state with pre-selected coefficients in such a way that the information distribution between two final states will be the desired.
- Perform the cloner circuit. the cloner circuit consists of four CNOT gate acting in all the three input qubits. For every CNOT gate, we have a control qubit (which indicates whether or not the CNOT should act) and a target qubit (which is the qubit that CNOT gate acts on it and flips it).
- The two asymmetric clones will appear at two of the outputs (depending on the preparation stage) and the other output should be discarded.
Properties
- Notations Used:
- Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |\psi\rangle_{in}:} The original input state
- The density matrix of the input pure state equal to Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |\psi_{in}\rangle\langle\psi_{in}|}
- The scaling parameter of the first clone
- The scaling parameter of the second clone
- The output density matrix of the first clone (equal to if the output state is pure)
- The output density matrix of the second clone (equal to Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |\psi_{b}^{out}\rangle\langle\psi_{b}^{out}|} if the output state is pure)
- The ``Identity" or completely mixed density matrix
- state of the ancillary qubits before preparation phase
- state of the ancillary qubits after the preparation
- amplitudes (or coefficients) of the prepared state $|\psi\rangle_{m_1,n_1}$. These coefficients are being used to control the flow of the information between the copies before starting the cloning process.
- The CNOT gate where the control qubit is and the target qubit is
- The total output of the asymmetric cloning circuit
- Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle |\Phi^+\rangle = \frac{1}{\sqrt{2}}(|00\rangle + |11\rangle):} Bell state
- Plus state. The eigenvector of Pauli X
- The protocol assumes that the original input qubit is unknown and the protocol is independent of the original input state (universality).
- The output copies are not identical and we are able to control the likelihood (fidelity) of the output copies to the original state by pre-preparing the ancillary states with special coefficients.
- Claims for General case:
- Following inequality holds between the scaling factors and
- Following inequality holds between the scaling factors and
- Optimality is provided when the fidelities of two clones, and , saturate the above inequality
- Claims for Special case with bell state:
- Following ellipse equation holds between the scaling factors Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a}
and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle b}
- Following ellipse equation holds between the scaling factors Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a}
and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle b}
- Following equations holds for fidelities of the clones:
Pseudo Code
Input: j qubits where are ancillary and internal states of the QCM.
Stage 1 State preparation
- Prepare N initial states: and blank states:
Stage 2 Unitary transformation
- Perform the following unitary transformation on input state
where Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\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
- Trace out the state of the QCM in states.