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

理论物理通讯:英文版

Probabilistic Remote Preparation of a Three-Particle Entangled State via Two Different Non-maximally Entangled Channels

Zhan Zhan, You-Bang, Wang, Yu-Wu

Published Jan 1, 2007• 2 citations
OpenAlex

Related papers

Controlled-Joint Remote Preparation of an Arbitrary Two-Qubit State via Non-maximally Entangled Channel

Xiao-Wei Guan, Xiu‐Bo Chen, Yixian Yang

International Journal of Theoretical Physics•Jul 14, 2012•27 citations

Remote Preparation of Some Three Particle Entangled States Under Divided Information

Binayak Samadder Choudhury, Soumen Samanta

International Journal of Theoretical Physics•Oct 7, 2018•14 citations

Probabilistic Remote Preparation of a Three-Particle Entangled State via Two Different Non-maximally Entangled Channels

You-Bang Zhan, Wang Yu-wu

We present two schemes for preparing remotely a three-particle entangled state by two different quantum channels. In the first scheme, two partial three-particle entangled states are used as the quantum channels, while in the second scheme, three two-particle non-maximally entangled states are employed as the quantum channels. It is shown that the remote state preparation can be successfully realized with certain probability, for both two schemes, if a sender performs some projective measurements and a receiver adopts some appropriate unitary transformations. It is shown also that the successful probabilities of these two schemes are different.

Communications in Theoretical Physics•Sep 1, 2007•9 citations

Two Schemes for Probabilistic Remote Preparation of a Four-Particle Entangled Cluster-Type State

Hou, Kui, Wang +3 more

理论物理通讯:英文版•Jan 1, 2014•0 citations

Remote Preparation of Multipartite Equatorial Entangled States in High Dimensions with Three Parties

Kui Hou, Jing Wang, Shi Shou-Hua

A scheme for probabilistic remotely preparing N-particle d-dimensional equatorial entangled states via entangled swapping with three parties is presented. The quantum channel is composed of N – 1 pairs of bipartite d-dimensional non-maximally entangled states and a tripartite d-dimension non-maximally entangled state. It is shown that the sender can help either of the two receivers to remotely prepare the original state, and the N-particle projective measurement and the generalized Hadamard transformation are needed in this scheme. The total success probability and classical communication cost are calculated.

Communications in Theoretical Physics•Apr 1, 2009•6 citations

Remote Preparation of a Two-Particle Entangled State via Two Tripartite W Entangled States

Xiao-Qi Xiao, Jin‐Ming Liu

International Journal of Theoretical Physics•May 4, 2007•22 citations
We present two schemes for preparing remotely a three-particle entangled state by two different quantum channels. In the first scheme, two partial three-particle entangled states are used as the quantum channels, while in the second scheme, three two-particle non-maximally entangled states are employed as the quantum channels. It is shown that the remote state preparation can be successfully realized with certain probability, for both two schemes, if a sender performs some projective measurements and a receiver adopts some appropriate unitary transformations. It is shown also that the successful probabilities of these two schemes are different.
A scheme for probabilistic remotely preparing N-particle d-dimensional equatorial entangled states via entangled swapping with three parties is presented. The quantum channel is composed of N – 1 pairs of bipartite d-dimensional non-maximally entangled states and a tripartite d-dimension non-maximally entangled state. It is shown that the sender can help either of the two receivers to remotely prepare the original state, and the N-particle projective measurement and the generalized Hadamard transformation are needed in this scheme. The total success probability and classical communication cost are calculated.