Some general probabilistic quantum cloning and deleting machines

Sumana Karmakar, Ajoy Sen, Debasis Sarkar

L.-M. Duan, Guang‐Can Guo

Ting Gao, Fengli Yan, Zhi‐Xi Wang +1 more

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.

Yuan Feng, Shengyu Zhang, Mingsheng Ying

We construct a probabilistic cloning and deleting machine which, taking several copies of an input quantum state, can output a linear superposition of multiple cloning and deleting states. Since the machine can perform cloning and deleting in a single unitary evolution, the probabilistic cloning and other cloning machines proposed in the previous literature can be thought of as special cases of our machine. A sufficient and necessary condition for successful cloning and deleting is presented, and it requires that the copies of an arbitrarily presumed number of the input states are linearly independent. This simply generalizes some results for cloning. We also derive an upper bound for the success probability of the cloning and deleting machine.

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