6 papers
The entanglement-assisted transmission capacity is a strong converse bound for identification
Satvik Singh
Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether i…
A short proof of the modified Kretschmann-Schlingemann-Werner conjecture
Satvik Singh
Let be two quantum channels with respective Stinespring isometries $V_1, V_2 : \mathbb{C}^{d}\to \mathbb{C}^{n}…
Gaussian mean width strong converse bound on the classical identification capacity of quantum channels
Satvik Singh
We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. By equipping the -fold channel output…
Discriminating idempotent quantum channels
Satvik Singh, Bjarne Bergh
We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition compl…
Zero-error communication under discrete-time Markovian dynamics
Satvik Singh, Mizanur Rahaman, Nilanjana Datta
Consider an open quantum system with (discrete-time) Markovian dynamics. Our task is to store information in the system in such a way that it can be retrieved perfectly, even after…
Information storage and transmission under Markovian noise
Satvik Singh, Nilanjana Datta
We study the information transmission capacities of quantum Markov semigroups acting on dimensional quantum systems. We show that, in the limit of $t…