Quantum probabilistically cloning and computation

Front. Comput. Sci. ›› 2008, Vol. 2 ›› Issue (2) : 179 -189.

PDF (175KB)
Front. Comput. Sci. ›› 2008, Vol. 2 ›› Issue (2) : 179 -189. DOI: 10.1007/s11704-008-0019-6

Quantum probabilistically cloning and computation

Author information +
History +
PDF (175KB)

Abstract

In this article we make a review on the usefulness of probabilistically cloning and present examples of quantum computation tasks for which quantum cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, one needs to distribute quantum information contained in states about which we have some partial information. To perform quantum computations, one uses state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation. And we discuss the achievable efficiencies and the efficient quantum logic network for probabilistic cloning the quantum states used in implementing quantum computation tasks for which cloning provides enhancement in performance.

Keywords

quantum no-cloning theorem / quantum probalistically cloning / quantum computation achievable efficiency / efficient quantum logic network

Cite this article

Download citation ▾
null. Quantum probabilistically cloning and computation. Front. Comput. Sci., 2008, 2(2): 179-189 DOI:10.1007/s11704-008-0019-6

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (175KB)

1039

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/