Srijita Kundu

most citedLifting randomized query complexity to randomized communication complexity

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2017★ 1 cited

Lifting randomized query complexity to randomized communication complexity

Anurag Anshu, Naresh B. Goud, Rahul Jain +2

We show that for a relation $f \subseteq {0, 1}^{n} \times O$ and a function $g : {0, 1}^{m} \times {0, 1}^{m} \to {0, 1}$ (with $m = O (lo g n)$ ), $$\mathrm{R}_{1/3}(…

quant-ph2015

Quantifying incompatibility beyond entropic uncertainty

Srijita Kundu, Kaustubh Wagh, Prabha Mandayam

We study two operational approaches to quantifying incompatibility that depart significantly from the well known entropic uncertainty relation (EUR) formalism. Both approaches resu…