Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Quantum Cloning Machines

Heng Fan

Published Jun 15, 2006• 5 citations
Publisher
DOI
10.1007/3-540-33133-6_4

Related papers

Combinations of probabilistic and approximate quantum cloning and deleting

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.

Physical Review A•May 13, 2002•18 citations

Quantum cloning machines and the applications

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

arXiv:1301.2956•Physics Reports•Jul 10, 2014•137 citations

Optimal quantum cloning based on the maximin principle by usinga prioriinformation

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.

Physical Review A•Oct 5, 2016•9 citations

Hybrid Quantum Cloning Machine

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

arXiv:0705.0631•Quantum Information Processing•Jun 18, 2007•13 citations

Process-optimized phase-covariant quantum cloning

Chloe Kim, Eric Chitambar

After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) has become a well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM, single-qudit fidelity and global fidelity have been most widely used. In this paper we compute the optimal global fidelity for phase-covariant cloning machines via semidefinite programming optimization, thereby completing a remaining gap in the previous results on QCMs. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise optimal QCMs. For the cloning map the composition method is suboptimal whereas for the transpose cloning map the method is asymptotically optimal.

arXiv:2107.03042•Physical Review A•Aug 9, 2022•2 citations

Quantum Cloning and Processing

Springer eBooks•Oct 22, 2007•0 citations
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.
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.
After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) has become a well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM, single-qudit fidelity and global fidelity have been most widely used. In this paper we compute the optimal global fidelity for phase-covariant cloning machines via semidefinite programming optimization, thereby completing a remaining gap in the previous results on QCMs. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise optimal QCMs. For the cloning map the composition method is suboptimal whereas for the transpose cloning map the method is asymptotically optimal.