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

Quantum Information Processing

Probabilistically teleporting arbitrary two-qubit states

Binayak Samadder Choudhury, Arpan Dhara

Published Sep 29, 2016• 8 citations
Publisher
DOI
10.1007/s11128-016-1447-0

Related papers

Probabilistic and Controlled Teleportation of an Arbitrary Two-Qubit State via One Dimensional Five-Qubit Cluster-Class State

Lian-Fang Han, Haifeng Xu

International Journal of Theoretical Physics•Mar 22, 2012•18 citations

Probabilistic Controlled Teleportation of an Arbitrary Three-Qubit State

Zha, Xin-wei

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

Probabilistic teleportation of an arbitrary three-qubit state by using three sets of W-class states

Min Jiang, Xiang Chen, Xu Huang +1 more

Optik•Mar 18, 2013•6 citations

Tripartite Probabilistic and Controlled Teleportation of an Arbitrary Single-Qubit State via One-Dimensional Four-Qubit Cluster-Type State

Haifeng Xu, Mingyu Zhang, Huanyin Guo +1 more

International Journal of Theoretical Physics•Jun 7, 2010•6 citations

Quantum Logic Networks for Probabilistic Teleportation of an Arbitrary Three-Particle State

Qian Qian, Xuemin, Fang +5 more

The scheme for probabilistic teleportation of an arbitrary three-particle state is proposed. By using single qubit gate and three two-qubit gates, efficient quantum logic networks for probabilistic teleportation of an arbitrary three-particle state are constructed.

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

Quantum Logic Networks for Probabilistic Teleportation of an Arbitrary Three-Particle State

Xuemin Qian, Fang Jian-Xing, Shiqun Zhu +1 more

The scheme for probabilistic teleportation of an arbitrary three-particle state is proposed. By using single qubit gate and three two-qubit gates, efficient quantum logic networks for probabilistic teleportation of an arbitrary three-particle state are constructed.

Communications in Theoretical Physics•Oct 1, 2005•1 citation