Six-qubit Entangled State Research Articles

Cyclic quantum teleportation of two-qubit entangled states by using six-qubit cluster state and six-qubit entangled state

Cyclic quantum teleportation schemes requires at least the existence of three collaborators acting all as senders and receivers of quantum information, each one of them has an information to be transmitted to the next neighbour in a circular manner. Here, new cyclic quantum teleportation scheme is proposed for perfectly transmitting cyclically three arbitrary unknown two-qubit states (α\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\alpha $$\\end{document}, β\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\beta $$\\end{document} and γ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\gamma $$\\end{document}) among the three collaborators. In this scheme, Alice can send to Bob the quantum information contained in her two-qubit state α\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\alpha $$\\end{document} and receive from Charlie the quantum information contained in the two-qubit state in his possession γ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\gamma $$\\end{document} and similarly, Bob can transmit to Charlie the quantum information contained in his two-qubit state β\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\beta $$\\end{document} through a quantum channel of twelve-qubit state consisting of a six-qubit cluster state and a six-qubit entangled state by sequentially and cyclically performing Bell state measurements. Subsequently, each one of the three participants can afterwards retrieve his own desired two-qubit state using classical channel and by performing appropriate unitary Pauli operators and we have shown that our proposed scheme performs efficiently.

Simplified quantum teleportation for a distinctive six-qubit target state via a six-qubit entangled state

Based on a six-qubit entangled state, a quantum information processing scheme for teleporting a distinctive six-qubit state is presented. In the scheme, only Bell-state measurements and two-qubit controlled-NOT gate operations as well as some single-qubit transformed operations are needed. Compared with a rival scheme put forwarded by Tan et al [Int. J. Theor. Phys. 55, 155 (2016)], the present scheme is more simpler and easier to execute because it does not require to make the six-qubit entangled state measurement. Besides, it is deterministic and feasible in terms of the current experimental technologies.

Synchronous multicast-based quantum teleportation scheme via a six-qubit entangled state

With the deepening of research on quantum information transmission, multicast-based quantum teleportation (QT) has attracted considerable attention. In this paper, utilizing the six-qubit cluster state entanglement feature, a synchronous multicast-based QT scheme is presented, which fulfills multicast-based QT among four participants. This means that a controller is not needed, the sender Alice can realize quantum multicast communication successfully and efficiently, which makes the receivers Bob, Charlie and David gain the desired states synchronously with only knowing the measurement outcomes of Alice. Our scheme realizes the synchronous transmission of different coded information. In addition, we analyze the impact of four distinct noises and calculate the fidelities of the output states.

Quantum network coding based on six-qubit entangled state

In order to improve the security and transmission efficiency of quantum network coding (QNC), we propose a new QNC scheme based on butterfly network. The scheme uses two groups of GHZ states to distribute quantum entangled states through intermediate nodes, so as to establish the connection between multiple nodes and achieve safe and reliable quantum traffic. This paper can not only improve the security of QNC, but also reduce the transmission of particles and improve the anti-interference ability of information. Compared with the traditional network coding method based on a priori entanglement, our scheme is a better attempt.

Quantum sharing of two unknown single-qubit states by using a six-qubit entangled state

Owing to the advantages of entanglement, in this work, an efficient and simple quantum sharing of two unknown state (QSTUS) protocol based on a six-qubit entangled state as the quantum channel is proposed. During the procession of the protocol, sender Alleyn possesses two unknown quantum states, at the same time, she wishes her four agents to share her quantum states. Hence, Alleyn implements two Bell basis measurements on her qubits, meanwhile the appointed controllers make a single-qubit measurement on her own qubit. Applying the suitable unitary operations, the state receivers can recover the original states. Analysis shows that only if all agents cooperate with each other, the proposed protocol QSTUS will be realized easily and successfully.

Cyclic Remote State Preparation

We present a novel scheme of cyclic remote state preparation via a six-qubit entangled state as the quantum channel. By introducing three auxiliary particles and using feedforward measurement strategy, Alice can remotely prepare an arbitrary single-qubit quantum state for Bob, Bob can remotely prepare an arbitrary single-qubit quantum state on Charlie’s site and Charlie can also remotely prepare an arbitrary single-qubit quantum state for Alice. It is pointed out that the cyclic remote preparation in the opposite direction can be perfectly achieved by changing the quantum channel. Furthermore, we generalize the above scheme to systems having N observers, so that cyclic remote state preparation can be realized in quantum information networks with N observers in different directions by changing quantum channels.

Cyclic Remote Implementation of Partially Unknown Quantum Operations

We present a novel scheme of Cyclic remote implementation of partially unknown quantum operations (CRIPUQO) via a six-qubit entangled state as the quantum channel. Alice can remotely apply a partially unknown quantum operation Ud (d = 0, 1) to Bob's qubit b, and Bob can remotely apply Ud to Charlie's site; meanwhile, Charlie can also remotely apply Ud to Alice's qubit c. It is pointed out that the CRIPUQO in the opposite direction can be perfectly achieved by changing the quantum channel. The scheme above is also generalized to systems having N observers, so that the CRIPUQO can be realized in quantum information networks with N observers in different directions by changing quantum channels.

Bidirectional controlled quantum teleportation of multi-qubit entangled states via five-qubit entangled state

Several schemes for bidirectional controlled quantum teleportation (BCQT) of arbitrary single-qubit states have been proposed by utilizing five-qubit entangled states, six-qubit entangled state and seven-qubit entangled state as the quantum channels. In this paper, a generalization to BCQT of multi-qubit entangled states is presented. By using a five-qubit entangled state as the quantum channel, we propose a scheme for BCQT of certain class of multi-qubit entangled states in which two legitimate users exchange their unknown multi-qubit entangled state to each other with the help of a supervisor. Compared with previous BCQT (3 ↔ 3) scheme [2019 Int. J. Theor. Phys. 58 3594], our proposed BCQT (m ↔ n) scheme requires less consumption of quantum and classical resources, and possesses higher intrinsic efficiency. Also, the present BCQT scheme is more general and has less operation complexity.

Cyclic quantum teleportation via G-states

In 2017, Chen et al. [Quantum Inf. Process. 16 (2017) 201] proposed a scheme for cyclic quantum teleportation (CYQT) of three single-qubit information states among three participants by using six-qubit entangled state as a quantum channel. Following the work of Chen et al., we propose a new scheme for CYQT in which four participants cyclically teleport four arbitrary single-qubit information states among themselves by using two [Formula: see text]-states as a quantum channel. In our scheme, reverse CYQT can also be realized throughout changing the qubit pairs to be measured by each participant. We also generalize our scheme for CYQT of [Formula: see text]-qubit entangled states.

Quantum state sharing with mixing state from six-qubit entangled pure one

In this paper the possibility of using mixing entangled states as quantum channel to accomplish quantum state sharing (QSTS) is considered. As a preliminary study, an efficient tripartite QSTS scheme is put forward by utilizing a mixing entangled state, which is a derivative of a six-qubit entangled pure state under a two-qubit confusion. Some specific discussions about the QSTS scheme are made, including the issues of the scheme determinacy, the sharer symmetry, the scheme security and the essential role of quantum channel as well as the current experimental feasibility.

Tripartite Quantum Operation Sharing with Six-Qubit Entangled State

In this paper a tripartite quantum operation sharing scheme is put forward with a six-qubit entangled state presented by Chen et al. (Phys. Rev. A 74, 032324, 2006). Within the scheme the success probability of sharing the operation is deterministic. The scheme security is analyzed and thus confirmed.

Quantum Bidirectional Teleportation 2 ↔ 2 or 2 ↔ 3 Qubit Teleportation Protocol Via 6-Qubit Entangled State

In this paper, firstly we propose a new protocol for quantum bidirectional teleportation of two particles in a six-qubit entangled channel, which is based on GHZ measurement and unitary operation. Then, also based on the six-qubit entangled state channel, a protocol for quantum bidirectional teleportation of two-three particles is proposed. The protocol utilizes Toffoli gate to convert three-qubit states into two-qubit states and a single qubit, and the rest of the teleportation is the same as the first protocol. Finally, we introduce an auxiliary bit to restore the state of the sender. Both these proposed protocols are more efficient than others in the same situation, which will be compared at the end of the paper.

Quantum teleportation of an arbitrary two-qubit state by using two three-qubit GHZ states and the six-qubit entangled state

In this paper, we show that current two different quantum channels of two three-qubit GHZ states and the six-qubit entangled state can be used for quantum teleportation of an arbitrary two-qubit state deterministically. Moreover, we propose two distinct protocols for quantum teleportation of an arbitrary two-qubit state within a three-qubit, by using a single-qubit measurement under the basis and also using a two-qubit projective measurement under the basis $$\{|+\rangle ,|-\rangle \}$$ , so as to get 16 kinds of possible measured results with equal probability of 1/4. Furthermore, the deterministic quantum teleportation of an arbitrary two-qubit states can be realized in a cavity quantum electrodynamics systems. This is unique, in that a cluster state has a maximal persistence when compared with a entangled state and it is also more robust against decoherence. Furthermore, the schemes are secure against internal and external attacks.

A Proxy Blind Signature Scheme of Quantum Information Transmission in Two-Particle State

A new proxy blind signature scheme based on controlled quantum teleportation is presented in this paper. We present a scheme for teleporting an unknown two-particle entangled state with message from a sender (Alice) to a receiver (David) via a genuine six-qubit entangled state. In this scheme, we introduce a trusted third party to enhance security and effectively resist forgery attacks. One-way hash faction, Von-Neumann measurement and unitary operation are adapted in this scheme. Our scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. Moreover, quantum key distribution (QKD) protocol and one-time pad are adapted in this scheme.

Quantum Private Comparison Protocols With a Number of Multi-Particle Entangled States

Private comparison allows n(n ≥ 2) participants who do not trust each other to compare whether their secret data are the same, without leaking the secret data of their own. Quantum private comparison (QPC) uses quantum mechanics to accomplish the comparison. In this paper, we present a simple and effective method which can design QPC protocols based on multi-particle entangled states including the genuinely entangled five-qubit state, the generalized Brown state, the genuine six-qubit entangled state, etc. We take the Bell state and the genuinely entangled five-qubit state as examples, respectively, to present two QPC protocols, where a semi-honest third party who assists two participants in implementing the protocols is assumed. A key feature of our protocols is that quantum states are prepared by two participants rather than by the third party, which effectively prevents the third party from preparing fake quantum states, thus improving the security of the protocols. In addition, we use the entanglement properties of multi-particle entangled states and collaborative computing between participants for privacy protection, and we use QKD to ensure the security of the cooperative computing when two participants are in different locations. We show that the security of our protocols towards both outsider and insider attacks can be guaranteed.

Improvement of a Quantum Proxy Blind Signature Scheme

Improvement of a quantum proxy blind signature scheme is proposed in this paper. Six-qubit entangled state functions as quantum channel. In our scheme, a trust party Trent is introduced so as to avoid David’s dishonest behavior. The receiver David verifies the signature with the help of Trent in our scheme. The scheme uses the physical characteristics of quantum mechanics to implement message blinding, delegation, signature and verification. Security analysis proves that our scheme has the properties of undeniability, unforgeability, anonymity and can resist some common attacks.

A Quantum Multi-proxy Multi-blind-signature Scheme Based on Genuine Six-Qubit Entangled State

In this paper, a very efficient and secure multi-proxy multi-blind-signature scheme is proposed which is based on controlled quantum teleportation. Genuine six-qubit entangled state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to guarantee its unforgeability, undeniability, blindness and unconditional security.

Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State

In this paper, our concern is to design some criteria for deterministic remote state preparation for preparing an arbitrary three-particle state via a genuinely entangled six-qubit state. First, we put forward two schemes in both the real and complex Hilbert space, respectively. Using an appropriate set of eight-qubit measurement basis, the remote three-qubit preparation is completed with unit success probability. Departing from previous research, our protocol has a salient feature in that the serviceable measurement basis only contains the initial coefficients and their conjugate values. By utilizing the permutation group, it is convenient to provide the permutation relationship between coefficients. Second, our ideas and methods can also be generalized to the situation of preparing an arbitrary N-particle state in complex case by taking advantage of Bell states as quantum resources. More importantly, criteria satisfied conditions for preparation with 100% success probability in complex Hilbert space is summarized. Third, the classical communication costs of our scheme are calculated to determine the classical recourses required. It is also worth mentioning that our protocol has higher efficiency and lower resource costs compared with the other papers.

Deterministic controlled bidirectional remote state preparation via a six-qubit entangled state

In this paper, we presented a controlled bidirectional remote state preparation scheme which used the six-qubit entangled state as quantum channel. In our scheme, Alice and Bob can prepare simultaneously an arbitrary single-qubit state in each other's place with the control of the supervisor Charlie. The success probability for our scheme reaches unit. Furthermore, we analyze the expression of quantum channel for controlled bidirectional remote state preparation. Finally, we discuss the security of our scheme, the detailed security analysis shows that the supervisor Charlie's control can greatly improve the security of our scheme.

Multi-Party Quantum Key Agreement by an Entangled Six-Qubit State

Since the first quantum key agreement protocol based on Bell state was presented by Zhou et al., much attention has focused on it, which is based on entangled states and product states. In this paper, we propose a multi-party quantum key agreement protocol, in which the genuinely maximally entangled six-qubit states are used. The presented protocol allows participants to share a secret key and preserves the following advantages. First, the outcome of the protocol is influenced by all parties; Second, the presented protocol is fairness, i.e., no one can determine the shared key alone; Third, outside eavesdroppers cannot gain the generated key without introducing any error. The security analysis shows that our protocol can resist both outside attacks and inside attacks.