Multi-party bidirectional teleportation

被引:0
|
作者
Seida, C. [1 ]
El Allati, A. [2 ,3 ]
Metwally, N. [4 ,5 ]
Hassouni, Y. [1 ]
机构
[1] ESMaR, Faculty of Sciences, Mohammed V University in Rabat, Morocco
[2] Laboratory of R&D in Engineering Sciences, Faculty of Sciences and Techniques Al-Hoceima, Abdelmalek Essaadi University, Tétouan, Morocco
[3] The Abdus Salam International Center for Theoretical Physics, Strada Costiera 11, Miramare-Trieste, Italy
[4] Department of mathematics, College of Science, University of Bahrain, P.O. Box 32038, Bahrain
[5] Math. Dept. Faculty of Science, Aswan University, Aswan, Egypt
来源
Optik | 2021年 / 247卷
关键词
Bidirectional teleportation - Fidelity - Local measurement - Local operations - Minimisation - Quantum network - Qubit state - Storage state - Three-party - Unknown state;
D O I
暂无
中图分类号
学科分类号
摘要
In this contribution, a three-party bidirectional teleportation scheme is suggested, where the users initially share a maximally entangled three qubits state of the GHZ type. In this proposed scheme, it is assumed that each user has the unknown state to be teleported, a trigger state and two storage states. Any two members can teleport unknown information bidirectionally by the help of the third member who plays the role of a mediator. There are series of local operations and measurements are needed to perform the teleportation process. The maximization/minimization of the fidelity of the teleported state depends on the teleported information (classical/quantum), the trigger's states of the receiver and the mediator. The phase angles of all states could be used as control parameters to improve the fidelity of the teleported state. The possibility of teleporting classical information is much better than teleporting quantum information. The possibility of generalizing this protocol to N users as members of quantum network which consists of n qubits of GHZ is discussed. © 2021 Elsevier GmbH
引用
收藏
相关论文
共 50 条
  • [21] Everlasting Multi-party Computation
    Unruh, Dominique
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2013, PT II, 2013, 8043 : 380 - 397
  • [22] MULTI-PARTY SYSTEM IN KERALA
    MAMMEN, PM
    [J]. INDIAN POLITICAL SCIENCE REVIEW, 1974, 8 (02): : 170 - 185
  • [23] Everlasting Multi-party Computation
    Unruh, Dominique
    [J]. JOURNAL OF CRYPTOLOGY, 2018, 31 (04) : 965 - 1011
  • [24] Everlasting Multi-party Computation
    Dominique Unruh
    [J]. Journal of Cryptology, 2018, 31 : 965 - 1011
  • [25] Multi-party elections in Africa
    Dorman, SR
    [J]. AFRICAN AFFAIRS, 2003, 102 (406) : 168 - 170
  • [26] Multi-Party Functional Encryption
    Agrawal, Shweta
    Goyal, Rishab
    Tomida, Junichi
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2021, PT II, 2021, 13043 : 224 - 255
  • [27] Multi-Party Quantum Steganography
    Mihara, Takashi
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2017, 56 (02) : 576 - 583
  • [28] Covert multi-party computation
    Chandran, Nishanth
    Goyal, Vipul
    Ostrovsky, Rafail
    Sahai, Arnit
    [J]. 48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 238 - 248
  • [29] Secure Multi-Party Computation
    Bayatbabolghani, Fattaneh
    Blanton, Marina
    [J]. PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 2157 - 2159
  • [30] Multi-party politics in Kenya
    Orvis, S
    [J]. POLITICAL SCIENCE QUARTERLY, 1999, 114 (02) : 347 - 349