23 citations · 97 across the 22 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
cs.CR2006★ 2 cited
Towards a classical proof of exponential lower bound for 2-probe smooth codes
Rahul Jain
Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c, e) smooth code if there exists a decoding algorithm which while de…
quant-ph2006★ 1 cited
On parallel composition of zero-knowledge proofs with black-box quantum simulators
Rahul Jain, Alexandra Kolla, Gatis Midrijanis +1
Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove…
quant-ph2006
Accessible versus Holevo Information for a Binary Random Variable
Rahul Jain, Ashwin Nayak
The accessible information acc(E) of an ensemble E is the maximum mutual information between a random variable encoded into quantum states, and the probabilistic outcome of a quant…