Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    A Protocol for Conversion of Path-Spin to Spin-Spin Quantum Entanglement

    Indranil Bayal1, Pradipta Panchadhyayee1,2,*

    Journal of Quantum Computing, Vol.5, pp. 71-79, 2023, DOI:10.32604/jqc.2023.045164 - 14 December 2023

    Abstract The present model deals with a protocol which involves the generation and conversion of entanglement from path-spin (P-S) hybrid entanglement associated with half-spin particle to spin-spin (S-S) interparticle entanglement. This protocol finds its applications in quantum information processing via a series of operations which include a beam splitter, spin flipper, spin measurement, classical channel, unitary transformations. Finally, it leads to two particles having completely entangled spin variables, without any requirement of any simultaneous operation on the two particles. More >

  • Open Access

    ARTICLE

    Design and Implementation of Quantum Repeaters: Insights on Quantum Entanglement Purification

    Karoki A. Mũgambi*, Geoffrey O. Okeng’o

    Journal of Quantum Computing, Vol.5, pp. 25-40, 2023, DOI:10.32604/jqc.2023.045654 - 12 December 2023

    Abstract Quantum communication is a groundbreaking technology that is driving the future of information transmission and communication technologies to a new paradigm. It relies on quantum entanglement to facilitate the transmission of quantum states between parties. Quantum repeaters are crucial for facilitating long-distance quantum communication. These quantum devices act as intermediaries between adjacent communication channel segments within a fragmented quantum network, allowing for entanglement swapping between the channel segments. This entanglement swapping process establishes entanglement links between the endpoints of adjacent segments, gradually creating a continuous entanglement connection over the entire length of the transmission channel. More >

  • Open Access

    ARTICLE

    A Quantum Authorization Management Protocol Based on EPR-Pairs

    Yan Chang1,*, Shibin Zhang1, Lili Yan1, Guihua Han1, Haiquan Song1, Yan Zhang1, Xueyang Li1, Qirun Wang2

    CMC-Computers, Materials & Continua, Vol.59, No.3, pp. 1005-1014, 2019, DOI:10.32604/cmc.2019.06297

    Abstract Quantum authorization management (QAM) is the quantum scheme for privilege management infrastructure (PMI) problem. Privilege management (authorization management) includes authentication and authorization. Authentication is to verify a user’s identity. Authorization is the process of verifying that a authenticated user has the authority to perform a operation, which is more fine-grained. In most classical schemes, the authority management center (AMC) manages the resources permissions for all network nodes within the jurisdiction. However, the existence of AMC may be the weakest link of the whole scheme. In this paper, a protocol for QAM without AMC is proposed More >

  • Open Access

    ARTICLE

    Controlled Secure Direct Communication Protocol via the Three-Qubit Partially Entangled Set of States

    Gang Xu1,2,*, Ke Xiao1,*, Zongpeng Li3, Xin-Xin Niu2,4, Michael Ryan5

    CMC-Computers, Materials & Continua, Vol.58, No.3, pp. 809-827, 2019, DOI:10.32604/cmc.2019.04400

    Abstract In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one More >

Displaying 1-10 on page 1 of 4. Per Page