SearcharxivSearch

arXiv subjects

Jyotirmoy Basak

Publications and source records attributed to Jyotirmoy Basak.

3 recordsLinked to original sources

Analysis of Boolean Functions Related to Binary Input Binary Output Two-party Nonlocal Games

The famous CHSH game can be interpreted with Boolean functions while understanding the success probability in the classical scenario. In this paper, we have exhaustively studied all the Boolean functions on four variables to express binary input binary output two-party nonlocal games and explore their performance in both classical and quantum scenarios. Our analysis finds out some other games (other than the CHSH game) which offer a higher success probability in the quantum scenario as compared to the classical one. Naturally, our study also notes that the CHSH game (and the games corresponding to the similar partition) is the most efficient in terms of separation between quantum and classical techniques.

quant-ph

Improved and Formal Proposal for Device Independent Quantum Private Query

In this paper, we propose a novel Quantum Private Query (QPQ) scheme with full Device-Independent certification. To the best of our knowledge, this is the first time we provide such a full DI-QPQ scheme using EPR-pairs. Our proposed scheme exploits self-testing of shared EPR-pairs along with the self-testing of projective measurement operators in a setting where the client and the server do not trust each other. To certify full device independence, we exploit a strategy to self-test a particular class of POVM elements that are used in the protocol. Further, we provide formal security analysis and obtain an upper bound on the maximum cheating probabilities for both the dishonest client as well as the dishonest server.

quant-ph

Device Independent Quantum Private Query with Finite Number of Entangled Qubits

In a recent work by Maitra et al. (Phys. Rev. A, 2017), it was shown that the existing Quantum Private Query (QPQ) protocols fail to maintain the database security if the entangled states shared between Alice and Bob are not of a certain form. So it is necessary to certify the states a priori. In this regard, the local CHSH test was proposed. However, the proposed scheme works perfectly for the asymptotic case when we have infinite number of qubits. In this brief report, we upgrade the protocol for finite number of qubits and connect the sample size to the success probability of CHSH test. We also perform a rigorous security analysis of the proposed protocol.

quant-ph