Quantum Cloning Machines

Daowen Qiu

We first construct a probabilistic and approximate quantum cloning machine (PACM) and then clarify the relation between the PACM and other cloning machines. After that, we estimate the global fidelity of the approximate cloning that improves the previous estimation for the deterministic cloning machine; and also derive a bound on the success probability of producing perfect multiple clones. Afterwards, we further establish a more generalized probabilistic and approximate cloning and deleting machine (PACDM) and discuss the connections of the PACDM to some of the existing quantum cloning and deleting machines. Finally the global fidelity and a bound on the success probability of the PACDM are obtained. Summarily, the quantum devices established in this paper improve and also greatly generalize some of the existing machines.

Heng Fan, Yi-Nan Wang, Li Jing +4 more

Satyabrata Adhikari, Arun Kumar Pati, Indranil Chakrabarty +1 more

Heng Fan, Yi-Nan Wang, Jing Li +4 more

No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal fidelity, or instead, we can try to clone it perfectly with the largest probability. Thus various quantum cloning machines have been designed for different quantum information protocols. Specifically, quantum cloning machines can be designed to analyze the security of quantum key distribution protocols such as BB84 protocol, six-state protocol, B92 protocol and their generalizations. Some well-known quantum cloning machines include universal quantum cloning machine, phase-covariant cloning machine, the asymmetric quantum cloning machine and the probabilistic quantum cloning machine etc. In the past years, much progress has been made in studying quantum cloning machines and their applications and implementations, both theoretically and experimentally. In this review, we will give a complete description of those important developments about quantum cloning and some related topics. On the other hand, this review is self-consistent, and in particular, we try to present some detailed formulations so that further study can be taken based on those results.

Miguel Orszag

Peng Kang, Hong‐Yi Dai, Jiahua Wei +1 more

We propose an optimal $1\ensuremath{\rightarrow}2$ quantum cloning method based on the maximin principle by making full use of a priori information of amplitude and phase about the general cloned qubit input set, which is a simply connected region enclosed by a ``longitude-latitude grid'' on the Bloch sphere. Theoretically, the fidelity of the optimal quantum cloning machine derived from this method is the largest in terms of the maximin principle compared with that of any other machine. The problem solving is an optimization process that involves six unknown complex variables, six vectors in an uncertain-dimensional complex vector space, and four equality constraints. Moreover, by restricting the structure of the quantum cloning machine, the optimization problem is simplified as a three-real-parameter suboptimization problem with only one equality constraint. We obtain the explicit formula for a suboptimal quantum cloning machine. Additionally, the fidelity of our suboptimal quantum cloning machine is higher than or at least equal to that of universal quantum cloning machines and phase-covariant quantum cloning machines. It is also underlined that the suboptimal cloning machine outperforms the ``belt quantum cloning machine'' for some cases.