Analyzing the efficiency of partially entangled states in Vaidman's-type games and its applications in Quantum Secret Sharing. Issue 1 (2nd January 2019)

• Record Type: Journal Article
• Authors: Kaur, Hargeet; Kumar, Atul
• Is Part Of: International journal of computers and applications. Volume 41:Issue 1(2019)
• Page Start: 2
• Page End: 13
• Publication Date: 2019-01-02
• Subjects: Vaidman's game -- quantum secret sharing -- entanglement -- noise -- GHZ and W; Computers -- Periodicals; Computer software -- Periodicals; Computer networks -- Periodicals; Multimedia systems -- Periodicals; Internet -- Periodicals; World Wide Web -- Periodicals; Minicomputers -- Periodicals; Microcomputers -- Periodicals; 004.05
• DOI: 10.1080/1206212X.2018.1465666
• Languages: English
• ISSNs: 1206-212X

Abstract

Abstract: We analyze the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be always helpful in winning a game as opposed to the classical strategies. We further find the conditions under which quantum strategies are always helpful in achieving higher winning probability in the game in comparison to classical strategies. Moreover, we show that a special class of W states can always be used to win the game using quantum strategies irrespective of the degree of entanglement between the three qubits. Our analysis also helps us in comparing the Vaidman's game with the secret sharing protocol. Furthermore, we propose a new Vaidman-type game where the rule maker itself is entangled with the other two players and acts as a facilitator to share a secret key with the two players. For practical purposes, the analysis is extended to study the proposed game under noisy conditions. In addition, the results obtained here are also generalized for multi-qubit games.