Abstract

The purpose of this paper is to investigate the double-direction cyclic (DDC) controlled quantum communication of single-particle states. We construct 13-particle, 19-particle and 16-particle entangled channels via Hadamard gates and controlled-NOT gates, separately. Based on these quantum channels that we construct, three novel theoretical schemes are proposed for achieving four-party DDC controlled quantum teleportation (QT), remote state preparation (RSP) and hybrid quantum communication, respectively. For any of these three schemes, each correspondent can simultaneously teleport two different single-particle states to two other correspondents under the control of the supervisor, which ensures that cyclic controlled quantum communication is implemented simultaneously in both clockwise and anticlockwise directions. Furthermore, the three presented four-party schemes for DDC controlled quantum communication can be extended to scenarios with n (n>3) correspondents. In each of our schemes, the general analysis formulas for both the sender’s manipulations and the receiver’s transformations are respectively given, and the unit success probability of each scheme is achieved. This article requires specific two-particle projective measurement, single-particle von Neumann measurement, Hadamard gate, controlled-NOT gates and Pauli gates, so our schemes can be physically implemented in terms of current technologies. We also analyzed the inherent efficiency, safety, and control power of the proposed schemes, and the results showed that our schemes are good.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.