Teleportation of the three-level three-particle entangled state and classical communication cost

We propose a scheme to probabilistically teleport an unknown three-level three-particle entangled state. The quantum channel is composed of a partial entangled three-level two-particle state and a partial entangled three-level three-particle state. We calculate the successful total probability and the classical communication cost required in the ideal probabilistic teleportation process, respectively. It is shown that an unknown three-level three-particle entangled state can be teleported using fewer entangled particles and lesser classical communication cost than Bennett et al.'s original protocol.