State Dependent N-M Cloning

From Quantum Protocol Zoo
Revision as of 14:06, 11 March 2019 by Shraddha (talk | contribs)
Jump to navigation Jump to search

This example protocol achieves the functionality of Quantum Cloning. A state-dependent cloner is a Quantum Cloning Machine (QCM) which is dependent on the input states. The main purpose of a state-dependent cloner is to design a QCM which produces better copies (compared to the universal QCMs) by having some partial information about the input states. We investigate the general $N \rightarrow M$ approximate state-dependent cloner which transforms two set of non-orthogonal states (consisting of N states) to M identical clones with a special constraint on the inner product of the final states. For the special case of $1 \rightarrow 2$ cloner, it is shown that, in general, this machine acts much better than the universal cloning protocol for two special set of states.


Tags: Non-Universal Cloning, State-Dependent Cloning, Building Blocks, Quantum Cloning, Universal Cloning, asymmetric cloning, copying quantum states, Quantum Functionality, Specific Task,symmetric or Optimal or Symmetric Cloning, Probabilistic Cloning

Assumptions

  • We assume that no ancillary states (test qubits) are not needed for this state-dependent protocol.
  • We assume that this state-dependent QCM is symmetric.
  • We assume that the transformation is unitary, acting on the Hilbert space of qubits and thus, the following relation holds between the inner product of input and output states:

  • We assume that protocol is optimal on the input states meaning that it will give the maximum possible fidelity value on average for a given set of states.

Outline

This state-dependent QCM can only act effectively on two sets of states. These states are non-orthogonal (orthogonal case is trivial). For a state-dependent cloner, the only thing that we need is to perform a transformation which takes N identical input states and blank states, to M copies such that it yields the best copies for the given special input states. It is important to note that this transformation is useful when we have a prior information about the input states.

Notations Used

  • Two nonorthogonal input states
  • The inner (scalar) product of two input states 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\rangle} 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 |\alpha_{NM}\rangle, |\beta_{NM}\rangle,} Output states produced by the state-dependent QCM acting on input states
  • 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 F_g^{opt}(N,M):} The global optimal fidelity for 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 N \rightarrow M} state-dependent cloning protocol
  • 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 F_{sd}(N,M):} The fidelity of the subsystem for state-dependent cloning protocol

Properties

  • State-dependent cloning machine only transforms a set of two non-orthogonal input states, parametrized as follows:


|b\rangle = sin\theta |0\rangle + cos\theta |1\rangle,</math>
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 \theta \in [0, \pi/4]} and their scalar product (or inner product) is specified as 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 S = \langle a|b \rangle = sin 2\theta} .

  • The condition that transformation should be unitary adds following constraint on the scalar product of final states:

  • Fidelity Claims
    • Optimal global fidelity: The average global fidelity of the machine for both sets of input states in terms of the inner(scalar) product of the two sets will be:

    • Subsystem fidelity: The fidelity of the density matrix of the subsystem with the original state 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} in terms of the inner product (similar fidelity for the subsystem b):


where the reduced density matrix of the subsystem 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} (The quantum state of a subsystem in density matrix representation) is described as:
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 \rho_{\alpha} = (A+B)^2 |a\rangle\langle a| + (A-B)^2 |b\rangle\langle b| + (A^2 - B^2)S^{M-1}(|a\rangle\langle b| + |b\rangle\langle a|)}
A and B are presented in the Protocol section.

Pseudo Code

General Case For more generality, we use the density matrix representation of the states which includes mixed states as well as pure states. For a simple pure state 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} the density matrix representation will be . Let us assume the initial qubit to be in an unknown state . Our task is to clone this qubit universally, i.e. input-state independently, in such a way, that we can control the scaling of the original and the clone at the output. In other words, we look for output which can be represented as below:


Here we assume that the original qubit after the cloning is “scaled” by the factor $s_0$, while the copy is scaled by the factor . These two scaling parameters are not independent and they are related by a specific inequality.

Stage 1 Cloner State Preparation

  1. Prepare the original qubit and two additional blank qubits and in pure states:
  2. Prepare , where the complex coefficients will be specified so that the flow of information between the clones will be as desired.
    At this stage the original qubit is not involved, but this preparation stage will affect the fidelity of the clones at the end of the process.
  3. To prepare the state, a Unitary gate must be performed so that:

  • Use following relations to specify $c_j$ in terms of and :

, , ,
these satisfy the scaling equations and also the normalization condition of the state . They are being used to control the flow of information between the clones

Stage 2 Cloning Circuit

  • The cloning circuit consists of four CNOT gates acting on original and pre-prepared qubits from stage 2. We call the original qubit , ``first qubit", the first ancillary qubit of $|\psi\rangle_{m_1,n_1}$, ``second qubit" and the second one, ``third qubit". The CNOT gates will act as follows:
  1. First CNOT acts on first and second qubit while the first qubit is control and the second qubit is the target.
  2. Second CNOT acts on first and third qubit while the first qubit is control and the third qubit is the target.
  3. Third CNOT acts on first and second qubit while the second qubit is control and the first qubit is the target.
  4. Forth CNOT acts on first and third qubit while the third qubit is control and the first qubit is the target.
  • Mathematically the cloning part of the protocol can be shown as:



Stage 3 Discarding ancillary state

  • Discard one of the extra states. The output states will be the first and second (or third) output.

Special case with bell state:
Stage 1 Cloner state preparation

  1. Prepare the original qubit and two additional blank qubits and in pure states:
  2. Prepare , where is a Bell state and . In this case, the density matrix representation of the output states will be:



Stage 2 Cloning Circuit

  • The cloning circuit is exactly the same as the general case. after the cloning circuit, the output state will be:

The reduced density matrix of two clones A and B can be written in terms of their fidelities:


Stage 3 Discarding ancillary state

  • The same as the general case.

Further Information

One of the most important applications of quantum cloning is to analyze the security of Quantum Key Distribution (QKD) protocols. Usually, an eavesdropper is supposed in QKD protocols os assumed to be able to perform any attacks, including copying of states used by parties involved in the protocol. Special states which are being used in different QKD protocols will lead to different state-dependent cloners for analyzing cloning attacks.