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

arXiv:1104.3643 · Physical Review Letters

Experimental Demonstration of Probabilistic Quantum Cloning

Hongwei Chen, Dawei Lu, Bo Chong, Gan Qin, Xianyi Zhou, Xinhua Peng, Jiangfeng Du

Published May 6, 2011• 47 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.106.180404

Related papers

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

Approximate Quantum Cloning with Nuclear Magnetic Resonance

Holly K. Cummins, C.M.S. Jones, Alistair Furze +4 more

Here we describe a nuclear magnetic resonance (NMR) experiment that uses a three qubit NMR device to implement the one-to-two approximate quantum cloning network of Buzek et al. [Phys. Rev. A 56, 3446 (1997)]. As expected the experimental results indicate that the network clones all input states with similar fidelities, but as a result of decoherence and incoherent evolution arising from B(1) inhomogeneity the total fidelity achieved does not exceed the measurement bound.

arXiv:quant-ph/0111098•Physical Review Letters•Apr 17, 2002•118 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

Experimental demonstration of entanglement-enabled universal quantum cloning in a circuit

Zhen‐Biao Yang, Pei-Rong Han, Xin-Jie Huang +6 more

Abstract No-cloning theorem forbids perfect cloning of an unknown quantum state. A universal quantum cloning machine (UQCM), capable of producing two copies of any input qubit with the optimal fidelity, is of fundamental interest and has applications in quantum information processing. This is enabled by delicately tailored nonclassical correlations between the input qubit and the copying qubits, which distinguish the UQCM from a classical counterpart, but whose experimental demonstrations are still lacking. We here implement the UQCM in a superconducting circuit and investigate these correlations. The measured entanglements well agree with our theoretical prediction that they are independent of the input state and thus constitute a universal quantum behavior of the UQCM that was not previously revealed. Another feature of our experiment is the realization of deterministic and individual cloning, in contrast to previously demonstrated UQCMs, which either were probabilistic or did not constitute true cloning of individual qubits.

arXiv:1909.03170•npj Quantum Information•Feb 26, 2021•19 citations

Probabilistic Cloning and Identification of Linearly Independent Quantum States

L.-M. Duan, Guang‐Can Guo

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of $n+1$ outcome measurement on $n$ linearly independent states. The optimal efficiencies for this type of measurement are obtained.

arXiv:quant-ph/9804064•Physical Review Letters•Jun 1, 1998•474 citations

Quantum cloning

Valerio Scarani, S. Iblisdir, Nicolas Gisin +1 more

The impossibility of perfectly copying (or cloning) an unknown quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These ``quantum cloning machines'' are important tools for studying a wide variety of tasks, e.g., state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines both for discrete-dimensional and for continuous-variable quantum systems. In addition, it presents the role of cloning in quantum cryptography, the link between optimal cloning and light amplification via stimulated emission, and the experimental demonstrations of optimal quantum cloning.

arXiv:quant-ph/0511088•Reviews of Modern Physics•Nov 8, 2005•615 citations
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.
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.
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.
Abstract No-cloning theorem forbids perfect cloning of an unknown quantum state. A universal quantum cloning machine (UQCM), capable of producing two copies of any input qubit with the optimal fidelity, is of fundamental interest and has applications in quantum information processing. This is enabled by delicately tailored nonclassical correlations between the input qubit and the copying qubits, which distinguish the UQCM from a classical counterpart, but whose experimental demonstrations are still lacking. We here implement the UQCM in a superconducting circuit and investigate these correlations. The measured entanglements well agree with our theoretical prediction that they are independent of the input state and thus constitute a universal quantum behavior of the UQCM that was not previously revealed. Another feature of our experiment is the realization of deterministic and individual cloning, in contrast to previously demonstrated UQCMs, which either were probabilistic or did not constitute true cloning of individual qubits.
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of n+1n+1n+1 outcome measurement on nnn linearly independent states. The optimal efficiencies for this type of measurement are obtained.
The impossibility of perfectly copying (or cloning) an unknown quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These ``quantum cloning machines'' are important tools for studying a wide variety of tasks, e.g., state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines both for discrete-dimensional and for continuous-variable quantum systems. In addition, it presents the role of cloning in quantum cryptography, the link between optimal cloning and light amplification via stimulated emission, and the experimental demonstrations of optimal quantum cloning.