Teleportation of Quantum States Prepared by Grover's Algorithm

摘要

A protocol for quantum teleportation of states prepared by Grover's algorithm is considered. We study the case when there are several senders (Alice) and one receiver (Bob). The complete state of the states prepared and teleported by the senders to Bob possesses all their features, namely it more likely collapses to its complete marked state. Possible applications of the protocol are discussed.