Apr 2019 – Dec 2023 · 4 yrs 8 mos · Bengaluru, Karnataka, India

Jan 2018 – Sep 2018 · 8 mos

Jul 2016 – Dec 2017 · 1 yr 5 mos

May 2015 – Jul 2015 · 2 mos · College Park, Maryland

• 1.) We worked on to find best(maximum success probability) LOCC protocol to distinguish a set of states given an extra shared resource state.
• 2.) We conjectured that teleportation based protocol is indeed the best SEP protocol and hence the best LOCC protocol. We have numerical evidence for it are currently working to prove it analytically using convex optimization and linear algebra techniques.
• 3.) We also tried to understand the amount of entanglement required to implement perfect nonlocal measurements. We made use of various numerical optimization techniques to study this in detail

May 2014 – Jul 2014 · 2 mos · Singapore

• 1.) Studied and implemented C++ code to calculate different Classical complexity measures (like Parity Bound, Block Sensitivity, Randomized Complexity etc.) of all 4-bit boolean functions.
• 2.) Studied Query complexity of important functions like Distributivity, Associativity testing etc. We were successful in giving tight bound of \theta(n^{1.5}) for query complexity of Distributivity testing in Learning Graph model.