Show simple item record

No-cloning of nonorthogonal states does not require inner product preserving

dc.contributor.authorLi, Dafaen_US
dc.contributor.authorLi, Xiangrongen_US
dc.contributor.authorHuang, Hongtaoen_US
dc.contributor.authorLi, Xinxinen_US
dc.date.accessioned2011-11-15T16:07:55Z
dc.date.available2011-11-15T16:07:55Z
dc.date.issued2005-08en_US
dc.identifier.citationLi, Dafa; Li, Xiangrong; Huang, Hongtao; Li, Xinxin (2005). "No-cloning of nonorthogonal states does not require inner product preserving." Journal of Mathematical Physics 46(8): 082102-082102-5. <http://hdl.handle.net/2027.42/87751>en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/87751
dc.description.abstractThe no-cloning theorem says there is no quantum copy machine which can copy any one-qubit state. Inner product preserving was always used to prove the no-cloning of nonorthogonal states. In this paper we show that the no-cloning of nonorthogonal states does not require inner product preserving and discuss the minimal properties which a linear operator possesses to copy two different states at the same device. In this paper, we obtain the following necessary and sufficient condition. For any two different states ∣ψ⟩ = a∣0⟩+b∣1⟩∣ψ⟩=a∣0⟩+b∣1⟩ and ∣ϕ⟩ = c∣0⟩+d∣1⟩∣ϕ⟩=c∣0⟩+d∣1⟩, assume that a linear operator LL can copy them, that is, L(∣ψ,0⟩) = ∣ψ,ψ⟩L(∣ψ,0⟩)=∣ψ,ψ⟩ and L(∣ϕ,0⟩) = ∣ϕ,ϕ⟩L(∣ϕ,0⟩)=∣ϕ,ϕ⟩. Then the two states are orthogonal if and only if L(∣0,0⟩)L(∣0,0⟩) and L(∣1,0⟩)L(∣1,0⟩) are unit length states. Thus we only need linearity and that L(∣0,0⟩)L(∣0,0⟩) and L(∣1,0⟩)L(∣1,0⟩) are unit length states to prove the no-cloning of nonorthogonal states. It implies that inner product preserving is not necessary for the no-cloning of nonorthogonal states.en_US
dc.publisherThe American Institute of Physicsen_US
dc.rights© The American Institute of Physicsen_US
dc.titleNo-cloning of nonorthogonal states does not require inner product preservingen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelPhysicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumElectrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, Michigan 48109en_US
dc.contributor.affiliationumDepartment of Computer Science, Wayne State University, Detroit, Michigan 48202en_US
dc.contributor.affiliationotherDepartment of Mathematical Sciences, Tsinghua University, Beijing 100084, Chinaen_US
dc.contributor.affiliationotherDepartment of Mathematics, University of California, Irvine, California 92697-3875en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/87751/2/082102_1.pdf
dc.identifier.doi10.1063/1.1996327en_US
dc.identifier.sourceJournal of Mathematical Physicsen_US
dc.identifier.citedreferenceW. K. Wootters and W. H. Zurek, Nature (London) 299, 802 (1982).en_US
dc.identifier.citedreferenceD. Dieks, Phys. Lett. 92A, 271 (1982).en_US
dc.identifier.citedreferenceH. Barnum et al., Phys. Rev. Lett. 76, 2818 (1996).en_US
dc.identifier.citedreferenceV. Buzek et al., Phys. Rev. A 56, 3446 (1997).en_US
dc.identifier.citedreferenceC. H. Bennett, G. Brassard, and N. D. Mermin. Phys. Rev. Lett. 68, 557 (1992).en_US
dc.identifier.citedreferenceP. H. Yuen. Phys. Lett. A 113, 405 (1986).en_US
dc.identifier.citedreferenceG. M. D’Ariano and H. P. Yuen, Phys. Rev. Lett. 76, 2832 (1996).en_US
dc.identifier.citedreferenceV. Buzek and M. Hillery, Phys. Rev. A 54, 1844 (1996).en_US
dc.identifier.citedreferenceT. Mor. Phys. Rev. Lett. 80, 3137 (1998).en_US
dc.identifier.citedreferenceM.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).en_US
dc.owningcollnamePhysics, Department of


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.