Loading...
Please wait, while we are loading the content...
Many-agent controlled teleportation of multi-qubit quantum information
| Content Provider | Semantic Scholar |
|---|---|
| Author | Zhang, Zhan-Jun |
| Copyright Year | 2005 |
| Abstract | We present a general idea to construct methods for multi-qubit quantum teleportation between two remote parties with control of many agents in the network. Our methods seem to be much simpler than the existing method proposed recently (Phys. Rev. A 70, 022329(2004)). We then demonstrate our idea by using several different protocols of quantum key distribution, including Ekert 91 and the deterministic secure communication protocol raised by Deng and Long. No-cloning theorem forbids a perfect copy of an arbitrary unknown quantum state. How to interchange different resources has ever been a question in quantum computation and quantum information. In 1993, Bennett et al[1] first presented a quantum teleportation scheme. In the scheme, an arbitrary unknown quantum state in a qubit can be teleported to a distant qubit with the aid of Einstein-Podlsky-Rosen (EPR) pair. Their work showed in essence the interchangeability of different resources in quantum mechanics. Later, in 1998, Karlsson and Bourennane generalized Bennett et al's telepor-tation idea by using a 3-qubit Greenberger-Horne-Zeilinger (GHZ) state |000 + |111 instead of an EPR pair[2]. In their scheme, conditioned on one receiver's measurement outcome, the other receiver can recover the arbitrary quantum state initially in the sender's qubit. This means different resources can be exchanged in a control manner. In 1999, Hillery, Buzek and Berthiaume [3] first and explicitly presented the concept of quantum secret sharing, which is a quantum version of classical sharing schemes [4]. In their work not only classical messages but also quantum information can be securely shared by two (three) parties via using three-particle (four-particle) GHZ states. Since then, a number of works were focused on quantum secret sharing of quantum information[5-10]. Very recently, Yang et al[11] have presented their extensive study on teleporting multiqubit information with control of many agents in a network. In their paper [11] they briefly reviewed how to complete a controlled teleportation of multi-qubits by using the methods in the Refs.[2-3] and then proposed their prepon-derant method. Compared to the methods in the Refs.[2-3], as they claimed in Ref.[11], their method is apparently simpler and economical, because the required auxiliary qubit resources, the number of local operations, and the quantity of classical communication are greatly reduced. However, as the controlled teleportation is concerned, we think, Yang et al's method[11] is still very complicated. In this paper, we will present a general idea to construct various methods for multi-qubit teleportation between two remote … |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://arxiv.org/pdf/quant-ph/0411088v2.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Bell state Communications protocol Computation EPR paradox Greenberger–Horne–Zeilinger state HL7PublishingSubSection |
| Content Type | Text |
| Resource Type | Article |
