activity
20082019
most citedFundamental bound on the reliability of quantum information transmission

108 citations · 241 across the 10 of their papers we have counts for

collaborators

12 papers

quant-ph2019

Comment on "Conditional Decoupling of Quantum Information"

Naresh Sharma

Berta et al [Phys. Rev. Lett., 121, 040504 (2018)] claim that their result provides a conceptually new extension of the decoupling approach to quantum information theory. We provid…

quant-ph2015★ 1 cited

More on a trace inequality in quantum information theory

Naresh Sharma

It is known that for a completely positive and trace preserving (cptp) map , $-\log {\cal N}(σ)] \}…

quant-ph2015★ 1 cited

Random coding exponents galore via decoupling

Naresh Sharma

A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the…

quant-ph2014★ 3 cited

A strong converse for the quantum state merging protocol

Naresh Sharma

The Polyanskiy-Verdú paradigm provides an elegant way of using generalized-divergences to obtain strong converses and thus far has remained confined to protocols involving channels…

quant-ph2013

A gambling interpretation of some quantum information-theoretic quantities

Naresh Sharma

It is known that repeated gambling over the outcomes of independent and identically distributed (i.i.d.) random variables gives rise to alternate operational meaning of entropies i…

quant-ph2013★ 108 cited

Fundamental bound on the reliability of quantum information transmission

Naresh Sharma, Naqueeb Ahmad Warsi

Information theory tells us that if the rate of sending information across a noisy channel were above the capacity of that channel, then the transmission would necessarily be unrel…

quant-ph2012★ 108 cited

On the strong converses for the quantum channel capacity theorems

Naresh Sharma, Naqueeb Ahmad Warsi

A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum info…

cs.IT2011

Non-asymptotic information theoretic bound for some multi-party scenarios

Naresh Sharma, Naqueeb Ahmad Warsi

In the last few years, there has been a great interest in extending the information-theoretic scenario for the non-asymptotic or one-shot case, i.e., where the channel is used only…

quant-ph2011★ 1 cited

On some special cases of the Entropy Photon-Number Inequality

Smarajit Das, Naresh Sharma, Siddharth Muthukrishnan

We show that the Entropy Photon-Number Inequality (EPnI) holds where one of the input states is the vacuum state and for several candidates of the other input state that includes t…

cs.IT2010★ 12 cited

Entropy power inequality for a family of discrete random variables

Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan

It is known that the Entropy Power Inequality (EPI) always holds if the random variables have density. Not much work has been done to identify discrete distributions for which the…

quant-ph2009

On the quantum f-relative entropy and generalized data processing inequalities

Naresh Sharma

We study the fundamental properties of the quantum f-relative entropy, where f(.) is an operator convex function. We give the equality conditions under monotonicity and joint conve…

quant-ph2008★ 7 cited

Extensions of the quantum Fano inequality

Naresh Sharma

Quantum Fano inequality (QFI) in quantum information theory provides an upper bound to the entropy exchange by a function of the entanglement fidelity. We give various Fano-like up…