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

Chinese Physics B

Quantum logic networks for cloning a quantum state near a given state

Y. H. Zhou

Published Aug 1, 2011• 5 citations
Publisher

Abstract

Two quantum logic networks are proposed to simulate a cloning machine that copies the states near a given one. Probabilistic cloning based on the first network is realized and the cloning probability of success based on the second network is 100%. Therefore, the second network is more motivative than the first one.
DOI
10.1088/1674-1056/20/8/080305

Related papers

Quantum Logic Network for Cloning a State Near a Given One Based on Cavity QED

Dawei Zhang, Shao Xiao-Qiang, Ai‐Dong Zhu

A quantum logic network is constructed to simulate a cloning machine which copies states near a given one. Meanwhile, a scheme for implementing this cloning network based on the technique of cavity quantum electrodynamics (QED) is presented. It is easy to implement this network of cloning machine in the framework of cavity QED and feasible in the experiment.

Chinese Physics Letters•May 29, 2008•3 citations

Realizing probabilistic identification and cloning of quantum states via universal quantum logic gates

Chuanwei Zhang, Zi-Yang Wang, Chuan-Feng Li +1 more

Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a k-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.

arXiv:quant-ph/9907097•Physical Review A•May 16, 2000•18 citations

Experimental Demonstration of Probabilistic Quantum Cloning

Hongwei Chen, Dawei Lu, Bo Chong +4 more

The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the state probabilistically. Thus far, many approximate cloning machines have been experimentally demonstrated, but probabilistic cloning remains an experimental challenge, as it requires more complicated networks and a higher level of precision control. In this work, we design an efficient quantum network with a limited amount of resources and perform the first experimental demonstration of probabilistic quantum cloning in a NMR quantum computer. In our experiment, the optimal cloning efficiency proposed by Duan and Guo [Phys. Rev. Lett. 80, 4999 (1998)] is achieved.

arXiv:1104.3643•Physical Review Letters•May 6, 2011•47 citations

Strategies and networks for state-dependent quantum cloning

Anthony Chefles, Stephen Mark Barnett

State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of N approximate clones given M initial exact copies, where $N>M$. We also consider strategies that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit $N\stackrel{\ensuremath{\rightarrow}}{}\ensuremath{\infty}$, to a known inequality that expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described and we show how they may be decomposed into basic operations.

arXiv:quant-ph/9812035•Physical Review A•Jul 1, 1999•65 citations

Quantum Logic Network for Probabilistic Cloning Quantum States

GAOTing, YANFeng-Li, WANGZhi-Xi

We construct efficient quantum logic network for probabilistic cloning the quantum states used in imple mented tasks for which cloning provides some enhancement in performance.

理论物理通讯：英文版•Jan 1, 2005•0 citations

Quantum Logic Network for Probabilistic Cloning Quantum States

Gao Ting, Yan Feng-Li, Zhi‐Xi Wang

We construct efficient quantum logic network for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

Communications in Theoretical Physics•Jan 1, 2005•5 citations
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a k-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.
The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the state probabilistically. Thus far, many approximate cloning machines have been experimentally demonstrated, but probabilistic cloning remains an experimental challenge, as it requires more complicated networks and a higher level of precision control. In this work, we design an efficient quantum network with a limited amount of resources and perform the first experimental demonstration of probabilistic quantum cloning in a NMR quantum computer. In our experiment, the optimal cloning efficiency proposed by Duan and Guo [Phys. Rev. Lett. 80, 4999 (1998)] is achieved.
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of N approximate clones given M initial exact copies, where N>MN>MN>M. We also consider strategies that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit $N\stackrel{\ensuremath{\rightarrow}}{}\ensuremath{\infty}$, to a known inequality that expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described and we show how they may be decomposed into basic operations.