Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Natural Computation (ICNC)

Probabilistic teleportation of an arbitrary Multi-qubit state

Lin-Yuan Ren, Cheng Zhang

Published Jul 1, 2011• 0 citations
Publisher

Abstract

in this letter, we describe a protocol for multi-qubit quantum teleportation between two parties with control of many agents in the networks. Our method is different from the method proposed recently [Phys. Lett. A 341 (2005)55–59], since the quantum channels we used is not maximally entangled state. And we discuss the probability which the receiver can teleport an unknown Multi-qubit.

DOI
10.1109/icnc.2011.6022518

Related papers

Probabilistic teleportation of quantum state

Ren Lin-yuan

This paper describes a protocol for multi-qubit quantum teleportation between two parties by using the networks with control of many agents.This method is different from the proposed method recently.The result is that the senders can only probabilistic restore the qubit even if all the agents cooperate with the receiver.And the quantum channels are not maximally entangled state,so the protocol has the practical significance.

Computer Engineering and Applications Journal•Jan 1, 2011•0 citations

Many-Agent Controlled Teleportation of Multi-qubit Quantum Information via Quantum Entanglement Swapping

Zhanjun Zhang, Yimin Liu, Zhong‐Xiao Man

We present a method to teleport multi-qubit quantum information in an easy way from a sender to a receiver via the control of many agents in a network. Only when all the agents collaborate with the quantum information receiver can the unknown states in the sender's qubits be fully reconstructed in the receiver's qubits. In our method, agents's control parameters are obtained via quantum entanglement swapping. As the realization of the many-agent controlled teleportation is concerned, compared to the recent method [C.P. Yang, et al. , Phys. Rev. A 70 (2004) 022329], our present method considerably reduces the preparation difficulty of initial states and the identification difficulty of entangled states, moreover, it does not need local Hadamard operations and it is more feasible in technology.

Communications in Theoretical Physics•Nov 1, 2005•47 citations

Multi-agent controlled teleportation of multi-qubit quantum information via two-step protocol

Yang Jie

Utilizing both the general quantum teleportation and the two-step protocol, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way from a sender Alice to a receiver Bob via the control of many agents in a network than by Yang et al 's method. In this method, only all the agents collaborate with Bob can the unknown states in Alice's qubits be fully reconstructed in Bob's qubits. Comparisons between the method and Yang et al 's method are made. Results show that, in this method, the preparation difficulty of initial states and the identification difficulty of entangled states are considerably reduced, new method is more feasible in technique and Hadamard operations are not needed at all.

Chinese Physics•Oct 31, 2005•10 citations

Multiparty-controlled teleportation of an arbitrarym-qudit state with a pure entangled quantum channel

Ping Zhou, Xihan Li, Fu‐Guo Deng +1 more

We present a general scheme for multiparty-controlled teleportation of an arbitrary m -qudit ( d -dimensional quantum system) state by using non-maximally entangled states as the quantum channel. The sender performs m generalized Bell-state measurements on her 2 m particles, the controllers take some single-particle measurements with the measuring basis X d and the receiver only needs to introduce one auxiliary two-level particle to extract quantum information probabilistically with the fidelity unit if he cooperates with all the controllers. All the parties can use some decoy photons to set up their quantum channel securely, which will forbid a dishonest party to eavesdrop freely. This scheme is optimal as the probability that the receiver obtains the originally unknown m -qudit state equals the entanglement of the quantum channel.

arXiv:0705.2660•Journal of Physics A Mathematical and Theoretical•Oct 9, 2007•107 citations

Deterministic and Probabilistic Short-Distance Teleportation of an Unknown Three-Qubit State

Manoj Kumar Mandal, Binayak Samadder Choudhury, Plaban Saha

Abstract Teleportation across short distances has become relevant in view of some recent developments in quantum technology. The advantage here is that certain auxiliary qubits can be accessed and utilized by both the sender and the receiver. Such act reduces the requirement of the number of qubits in the entangled quantum channel which would have been otherwise necessary. In this paper we present a short-distance teleportation protocol by which an arbitrary three-qubit state can be transferred with the help of auxiliary qubits and a maximally entangled Bell-State. In the second part of the paper we introduce a probabilistic short-distance protocol for the same arbitrary three-qubit state by using a non-maximally entangled Bell-state. The success probability of the protocol is calculated and its relation with the first protocol is discussed. We presented a circuit diagram for the first protocol and execute it in the IBM-QE platform.

International Journal of Theoretical Physics•Sep 23, 2024•3 citations

Probabilistic Teleportation of an Arbitrary N-qubit State via Entanglement Swapping

Yi-Qi Wang, Fang Jian-Xing, Jiang Wei-Xing +1 more

Recently, there is much interest in the study of quantum teleportation. Its marvelous security property makes it particularly attractive as potential means for future communication. Uncertain principal and no-cloning theories of quantum mechanics forbid exact copy of quantum states. To solve the problem, quantum teleportation devides message state into two parts: classical message and quantum message which are transmitted through relevant classical and quantum channels from a sender Alice to a distant receiver Bob, respectively. According to both message states, Bob can recover the original message state with certain possibility. Utilizing the general quantum teleportation protocol, in this scheme, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way. It has been extended to teleportation of an arbitrary N-qubit state via entanglement swapping and probabilistic teleportation is investigated as well, which has a more general meaning. N non-maximally entangled triplet GHZ states (Greenberger-Home-Zeilinger), taking the place of the previous EPR states (Einstein-Podolsky-Rosen), serve as quantum channels, which avoids introducing extra auxiliary qubit. In order to complete the teleportation, Alice has to devide all qubits into N parts and make Bell-State measurement on qubit pair (i, x(subscript i)) and tell Bob the measurement result through classical channel, then Bob perform some simple local operations on qubits (y(subscript i), z(subscript i)) to finish teleporting the i-th qubit. Conditioned on N-times similar repeat, Bob can faithfully reconstruct the initial state. Results show that, in this method, the identification difficulty of entangled states is considerably reduced, the new method is more feasible in technique. And the total possibility of successful teleportation is (The equation is abbreviated). As a special case, teleportation of an arbitrary two-qubit state is proposed.

Chinese Journal of Luminescence•Oct 1, 2007•0 citations
in this letter, we describe a protocol for multi-qubit quantum teleportation between two parties with control of many agents in the networks. Our method is different from the method proposed recently [Phys. Lett. A 341 (2005)55–59], since the quantum channels we used is not maximally entangled state. And we discuss the probability which the receiver can teleport an unknown Multi-qubit.
We present a method to teleport multi-qubit quantum information in an easy way from a sender to a receiver via the control of many agents in a network. Only when all the agents collaborate with the quantum information receiver can the unknown states in the sender's qubits be fully reconstructed in the receiver's qubits. In our method, agents's control parameters are obtained via quantum entanglement swapping. As the realization of the many-agent controlled teleportation is concerned, compared to the recent method [C.P. Yang, et al. , Phys. Rev. A 70 (2004) 022329], our present method considerably reduces the preparation difficulty of initial states and the identification difficulty of entangled states, moreover, it does not need local Hadamard operations and it is more feasible in technology.
Utilizing both the general quantum teleportation and the two-step protocol, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way from a sender Alice to a receiver Bob via the control of many agents in a network than by Yang et al 's method. In this method, only all the agents collaborate with Bob can the unknown states in Alice's qubits be fully reconstructed in Bob's qubits. Comparisons between the method and Yang et al 's method are made. Results show that, in this method, the preparation difficulty of initial states and the identification difficulty of entangled states are considerably reduced, new method is more feasible in technique and Hadamard operations are not needed at all.
We present a general scheme for multiparty-controlled teleportation of an arbitrary m -qudit ( d -dimensional quantum system) state by using non-maximally entangled states as the quantum channel. The sender performs m generalized Bell-state measurements on her 2 m particles, the controllers take some single-particle measurements with the measuring basis X d and the receiver only needs to introduce one auxiliary two-level particle to extract quantum information probabilistically with the fidelity unit if he cooperates with all the controllers. All the parties can use some decoy photons to set up their quantum channel securely, which will forbid a dishonest party to eavesdrop freely. This scheme is optimal as the probability that the receiver obtains the originally unknown m -qudit state equals the entanglement of the quantum channel.
Abstract Teleportation across short distances has become relevant in view of some recent developments in quantum technology. The advantage here is that certain auxiliary qubits can be accessed and utilized by both the sender and the receiver. Such act reduces the requirement of the number of qubits in the entangled quantum channel which would have been otherwise necessary. In this paper we present a short-distance teleportation protocol by which an arbitrary three-qubit state can be transferred with the help of auxiliary qubits and a maximally entangled Bell-State. In the second part of the paper we introduce a probabilistic short-distance protocol for the same arbitrary three-qubit state by using a non-maximally entangled Bell-state. The success probability of the protocol is calculated and its relation with the first protocol is discussed. We presented a circuit diagram for the first protocol and execute it in the IBM-QE platform.
Recently, there is much interest in the study of quantum teleportation. Its marvelous security property makes it particularly attractive as potential means for future communication. Uncertain principal and no-cloning theories of quantum mechanics forbid exact copy of quantum states. To solve the problem, quantum teleportation devides message state into two parts: classical message and quantum message which are transmitted through relevant classical and quantum channels from a sender Alice to a distant receiver Bob, respectively. According to both message states, Bob can recover the original message state with certain possibility. Utilizing the general quantum teleportation protocol, in this scheme, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way. It has been extended to teleportation of an arbitrary N-qubit state via entanglement swapping and probabilistic teleportation is investigated as well, which has a more general meaning. N non-maximally entangled triplet GHZ states (Greenberger-Home-Zeilinger), taking the place of the previous EPR states (Einstein-Podolsky-Rosen), serve as quantum channels, which avoids introducing extra auxiliary qubit. In order to complete the teleportation, Alice has to devide all qubits into N parts and make Bell-State measurement on qubit pair (i, x(subscript i)) and tell Bob the measurement result through classical channel, then Bob perform some simple local operations on qubits (y(subscript i), z(subscript i)) to finish teleporting the i-th qubit. Conditioned on N-times similar repeat, Bob can faithfully reconstruct the initial state. Results show that, in this method, the identification difficulty of entangled states is considerably reduced, the new method is more feasible in technique. And the total possibility of successful teleportation is (The equation is abbreviated). As a special case, teleportation of an arbitrary two-qubit state is proposed.