17 citations · 28 across the 4 of their papers we have counts for
4 papers
Constant communication complexity protocols for multiparty accumulative boolean functions
Sudebkumar Prasant Pal, Sima Das, Somesh Kumar
Generalizing a boolean function from Cleve and Buhrman \cite{cb:sqec}, we consider the class of {\it accumulative boolean functions} of the form $f_B(X_1,X_2,..., X_m)=\bigoplus_{i…
A combinatorial approach for studying LOCC transformations of multipartite states
Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar +1
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored m…
Multi-partite Quantum Entanglement versus Randomization: Fair and Unbiased Leader Election in Networks
Sudebkumar Prasant Pal, Sudhir Kumar Singh, Somesh Kumar
In this paper we show that sufficient multi-partite quantum entanglement helps in fair and unbiased election of a leader in a distributed network of processors with only linear cla…
Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement
Sudhir Kumar Singh, Somesh Kumar, Sudebkumar Prasant Pal
We develop protocols for preparing a GHZ state and, in general,a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between age…