4 citations · 6 across the 8 of their papers we have counts for
4 papers · 1 filter
Dimension Independent and Computationally Efficient Shadow Tomography
Pulkit Sinha
We describe a new shadow tomography algorithm that uses samples, for measurements and additive error , which is independent of the dimension of the…
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Omkar Baraskar, Agrim Dewan, Chandan Saha +1
An -sparse polynomial has at most monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…
Phase error rate estimation in QKD with imperfect detectors
Devashish Tupkary, Shlok Nahar, Pulkit Sinha +1
We present a finite-size security proof of the decoy-state BB84 QKD protocol against coherent attacks, using entropic uncertainty relations, for imperfect detectors. We apply this…
Proper vs Improper Quantum PAC learning
Ashwin Nayak, Pulkit Sinha
A basic question in the PAC model of learning is whether proper learning is harder than improper learning. In the classical case, there are examples of concept classes with VC dime…