Reexamining Security of Improved Multiparty Quantum Secret Splitting and Quantum State Sharing

In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 （2006） 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 （2006） 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.     

Quantum Secret Sharing Using GHZ-Like State

This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.     

Quantum entanglement and quantum nonlocality for N-photon entangled states

Quantum entanglement and quantum nonlocality of N-photon entangled states |psi_{N m}rangle=C_m[cosgamma|N-mrangle₁|mrangle₂ +e^{iθ_m}singamma|mrangle₁|N-mrangle₂] and their superpositions are studied. We point out that the relativephase θ_m affects the quantum nonlocality but not the quantumentanglement for the state |psi_{N m}rangle. We show thatquantum nonlocality can be controlled and manipulated by adjustingthe state parameters of |psi_{N m}rangle, superpositioncoefficients, and the azimuthal angles of the Bell operator. Wealso show that the violation of the Bell inequality can reach itsmaximal value under certain conditions. It is found that quantumsuperpositions based on |psi_{N m}rangle can increase theamount of entanglement, and give more ways to reach the maximalviolation of the Bell inequality.     

Quantum discord dynamics of two qubits in single-mode cavities

The dynamics of quantum discord for two identical qubits in two independent single-mode cavities and a common single-mode cavity are discussed. For the initial Bell state with correlated spins, while the entanglement sudden death can occur, the quantum discord vanishes only at discrete moments in the independent cavities and never vanishes in the common cavity. Interestingly, quantum discord and entanglement show opposite behavior in the common cavity, unlike in the independent cavities. For the initial Bell state with anti-correlated spins, quantum discord and entanglement behave in the same way for both independent cavities and a common cavity. It is found that the detunings always stabilize the quantum discord.     

An Efficient Scheme for Multiparty Multi-particle State Sharing

We present an efficient scheme for sharing an arbitrary m-qubit state with n agents. In our scheme, the sender Alice first shares m Bell states with the agent Bob, who is designated to recover the original m-qubit state. Furthermore, Alice introduces n- 1 auxiliary particles in the initial state ｜0）, applies Hadamard （H） gate and Controlled-Not （CNOT） gate operations on the particles, which make them entangled with one of m particle pairs in Bell states, and then sends them to the controllers （i.e., other n - 1 agents）, where each controller only holds one particle in hand. After Alice performing m Bell-basis measurements and each controller a single-particle measurement, the recover Bob can obtain the original unknown quantum state by applying the corresponding local unitary operations on his particles. Its intrinsic efficiency for qubits approaches 100%, and the total efficiency really approaches the maximal value.     

Quantum Secure Communication Using a Class of Three-Particle W State

A theoretical scheme of quantum secure communication using a class of three-particle W states is proposed. In the scheme, two communicators may communicate after they test the security of the quantum channel. The receiver can obtain the secret message determinately if the quantum channel is safe. The present scheme can be realized without using teleportation.     

Quantum Secure Direct Intercommunication with Superdense Coding and Entanglement Swapping

A quantum secure direct intercommunication scheme is proposed to exchange directly the communicators＇ secret messages by making ase of swapping entanglement of Bell states. It has great capacity to distribute the secret messages since these messages have been imposed on high-dimensional Bell states via the local unitary operations with superdense coding. The security is ensured by the secure transmission of the travel sequences and the application of entanglement swapping.     

Robust Multiparty Quantum Secret Sharing against Participant Forcible Manipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Commun. Theor. Phys. 52 （2009） 421] is analyzed. It is shown that this protocol is vulnerable since the agents＇ imperfect encryption scheme can be attacked by a powerful participant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.     

Cryptanalysis and improvement of a quantum secret sharing scheme based on x-type entangled states

In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on χ-type entangled states, they claimed that the scheme is secure. However, in this paper, we study the security of the protocol and find that it is insecure. Applying intercept and resend attack, the agent Bob can obtain Alice’s secret without the help from the other agent Charlie. In the end, we give our effective modification for its improvement.     

Cryptanalysis and improvement of a quantum secret sharing scheme based on χ-type entangled states

In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on χ-type entangled states, they claimed that the scheme is secure. However, in this paper, we study the security of the protocol and find that it is insecure. Applying intercept and resend attack, the agent Bob can obtain Alice's secret without the help from the other agent Charlie. In the end, we give our effective modification for its improvement.     

Quantum Pseudo-Telepathy

Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and not-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors. Supported in Part by Canada’s Natural Sciences and Engineering Research Council (NSERC), the Canada Research Chair programme and the Canadian Institute for Advanced Research (CIAR). Supported in part by a scholarship from Canada’s NSERC. Supported in part by Canada’s NSERC Québec’s Fonds de recherche sur la nature et les technologies (FQRNT), the CIAR and the Mathematics of Information Technology and Complex Systems Network (MITACS).     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.