Elsevier

Physics Letters A

Volume 355, Issue 2, 26 June 2006, Pages 94-97
Physics Letters A

Teleporting a quantum state from a subset of the whole Hilbert space

https://doi.org/10.1016/j.physleta.2006.02.017Get rights and content

Abstract

We investigate the lower bound of the amount of entanglement for faithfully teleporting a quantum state belonging to a subset of the whole Hilbert space. Moreover, when the quantum state belongs to a set composed of two states, a probabilistic teleportation scheme is presented using a non-maximally entangled state as the quantum channel.

Introduction

Quantum entanglement is one of the most striking features of quantum mechanics and has been widely used as an essential resource in the quantum information processing. Some physical incidents such as quantum teleportation [1], quantum key distribution [2], quantum computation [3], [4], [5] and quantum secure direct communication [6], [7], [8], [9], [10] use it essentially. Since quantum entanglement is the essential resource, we always expect to complete a task using as small amount of entanglement as possible or to complete more tasks when the amount of entanglement is certain. The amount of entanglement of the state |Ψ of the joint system of the two subsystems A and B is defined as the Von Neumann entropy of either of the two subsystems:E(|Ψ)=Tr(ρAlog2ρA)=Tr(ρBlog2ρB), where ρA is the partial trace of |ΨΨ| over subsystem B, and ρB has a similar meaning.

Since an arbitrary pure state of two-body has the form of Schmidt decomposition|Ψ=i=1npi|i|i, where n is the Schmidt number and pi is the Schmidt coefficient (we have included in the sum only the non-zero pi's). Thus it follows easily that E=ipilog2pi. Particularly, E=log2d when |Ψ is the maximally entangled state, where d is the dimension of the Hilbert space of the subsystem.

Quantum teleportation is one of the most important applications of quantum entanglement. In quantum teleportation process, an unknown quantum state can be transmitted from a sender (called Alice) to a receiver (Bob) without transmission of carrier of quantum state. Since Bennett et al. [1] presented a quantum teleportation scheme, there have been great developments in theoretical and experimental studies. Now quantum teleportation has been generalized to many cases such as continuous variable quantum teleportation [11], probabilistic teleportation [12], [13], [14], [15], [16], [17], controlled quantum teleportation [18], [19], [20] and so on [21], [22], [23], [24], [25], [26], [27], [28]. Moreover, quantum teleportation has been demonstrated with the polarization photon [29] and a single coherent mode of fields [30] in the experiments. The teleportation of a coherent state corresponding to continuous variable system was also realized in the laboratory [31].

In the Bennett's protocol [1], the quantum state to be teleported belongs to the whole Hilbert state vector space. A quantum state of d-state particle (or qudit) can be faithfully teleported using a pair of d-state particles in a maximally entangled state, in which, the amount of entanglement E=log2d is used. Gour [32] pointed out that log2d is the minimal amount of entanglement for faithfully teleporting an arbitrary d-dimensional quantum state. When knowing that the quantum state to be teleported is from the subspace of the whole Hilbert space, we can complete the quantum teleportation using less amount of entanglement. For instance, Gorbachev and Trubilko [33] considered the quantum teleportation of two-particle entangled state by a three-particle GHZ state. The amount of entanglement required is E=log22=1 instead of log24=2, the amount of entanglement for teleporting a general two-qubit state. Yan and Yang discussed the economical teleportation of multiparticle quantum state [34].

In this Letter, we will study how many amount of entanglement must be used at least when the quantum state belongs to a subset of the whole Hilbert space. The lower bound of the amount of entanglement for completing faithful teleportation in this case is calculated. Moreover, when we know the quantum state is coming from a two-state set, a probabilistic teleportation scheme is presented using a non-maximally entangled state as the quantum channel. The transmission efficiency of this scheme is calculated also.

Section snippets

The lower bound of the amount of entanglement for teleporting a quantum state from a subset of the whole Hilbert space

Suppose the quantum state to be teleported belongs to a set S={|ϕi,i=1,2,}, which is a subset of the d-dimensional Hilbert space either finite or infinite. In the following, we will investigate the lower bound of the amount of entanglement when teleporting a quantum state from S.

Case 1

The set S is an orthogonal set, i.e., the arbitrary two quantum states in S={|ϕi,i=1,2,} are orthogonal.

Apparently, S must be the finite set in this case. Let the number of quantum states be n. Alice can know

A probabilistic teleportation scheme

In the above section, we show that if we know the state belongs to a subset of the whole Hilbert space, we can complete the faithful teleportation with less amount of entanglement than that for teleporting a quantum state taken from the whole Hilbert space.

On the other hand, for given amount of entanglement, is it possible to teleport more quantum states when we know the state is from a subset of the whole Hilbert space? When the quantum channel is a non-maximally entangled state, the answer is

Conclusion

In conclusion, we have found the lower bound of the amount of quantum entanglement for faithfully teleporting a quantum state from a subset of the whole Hilbert space. Moreover, when the quantum state belongs to a two-state set, a probabilistic teleportation scheme is presented using a non-maximally entangled state as the quantum channel. The average transmission efficiency of this scheme is obtained also.

Acknowledgements

This work was supported by Hebei Natural Science Foundation of China under Grant Nos. A2004000141 and A2005000140, and Natural Science Foundation of Hebei Normal University.

References (35)

  • K. Shimizu et al.

    Phys. Rev. A

    (1999)
  • H. Lu et al.

    Phys. Lett. A

    (2000)
  • F.L. Yan et al.

    Phys. Lett. A

    (2003)
  • B.S. Shi et al.

    Phys. Lett. A

    (2000)
  • C.H. Bennett

    Phys. Rev. Lett.

    (1993)
  • A.K. Ekert

    Phys. Rev. Lett.

    (1991)
  • M.A. Nielsen et al.

    Quantum Computation and Quantum Information

    (2000)
  • J.I. Cirac et al.

    Phys. Rev. Lett.

    (1995)
  • A. Barenco

    Phys. Rev. Lett.

    (1995)
  • A. Beige

    Acta Phys. Pol. A

    (2002)
  • F.G. Deng et al.

    Phys. Rev. A

    (2004)
  • F.L. Yan et al.

    Eur. Phys. J. B

    (2004)
  • T. Gao

    Z. Naturforsch. A

    (2004)
  • L. Vaidman

    Phys. Rev. A

    (1994)
  • W.L. Li et al.

    Phys. Rev. A

    (2000)
  • F.L. Yan et al.

    Commun. Theor. Phys.

    (2002)
  • F.L. Yan et al.

    Commun. Theor. Phys.

    (2003)
  • Cited by (13)

    View all citing articles on Scopus
    View full text