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:quant-ph/0406104

Probabilistically Cloning and Quantum Computation

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

Published Jun 15, 2004• 0 citations
arXivHTMLPDF

Abstract

We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need to distribute quantum information contained in states about which we have some partial information. To perform quantum computations, we use state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.

DOI
10.48550/arxiv.quant-ph/0406104

Related papers

Probabilistic Cloning and Quantum Computation

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

We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which the cloning offers an advantage which cannot be matched by any approach that does not resort to quantum cloning. In these quantum computations, we need to distribute quantum information contained in the states about which we have some partial information. To perform quantum computations, we use a state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.

Chinese Physics Letters•May 28, 2004•9 citations

Cloning and quantum computation

Ernesto F. Galvão, Lucién Hardy

We discuss how quantum information distribution can improve the performance of some quantum computation tasks. This distribution can be naturally implemented with different types of quantum cloning procedures. We give two examples of tasks for which cloning provides some enhancement in performance, and briefly discuss possible extensions of the idea.

arXiv:quant-ph/0002053•Physical Review A•Jul 7, 2000•72 citations

Achievable efficiencies for probabilistically cloning the states

T Gao, F L Yan, Z X Wang

We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore, we give achievable efficiencies for probabilistically cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

arXiv:quant-ph/0307186•Journal of Physics A Mathematical and General•Feb 18, 2004•9 citations

Achievable efficiencies for probabilistically cloning the states

Ting Gao, Fengli Yan, Z X Wang

We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore, we give achievable efficiencies for probabilistically cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

•Jan 1, 2003•9 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

Optimal probabilistic cloning and purification of quantum states

Jaromı́r Fiurášek

We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explicitly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our examples reveal that the probabilistic cloner may yield higher fidelity than the best deterministic cloner even when the states that should be cloned are linearly dependent and are drawn from a continuous set.

arXiv:quant-ph/0403165•Physical Review A•Sep 10, 2004•65 citations
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need to distribute quantum information contained in states about which we have some partial information. To perform quantum computations, we use state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which the cloning offers an advantage which cannot be matched by any approach that does not resort to quantum cloning. In these quantum computations, we need to distribute quantum information contained in the states about which we have some partial information. To perform quantum computations, we use a state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explicitly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our examples reveal that the probabilistic cloner may yield higher fidelity than the best deterministic cloner even when the states that should be cloned are linearly dependent and are drawn from a continuous set.