Related papers: Efficiently Computable Strategies and Limits for B…
Recently, the resource theory of asymmetric distinguishability for quantum strategies was introduced by [Wang et al., Phys. Rev. Research 1, 033169 (2019)]. The fundamental objects in the resource theory are pairs of quantum strategies,…
Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that…
We consider the discrimination of lossy bosonic channels and focus to the case when one of the values for the loss parameter is zero, i.e., we address the detection of a possible loss against the alternative hypothesis of an ideal lossless…
The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the…
We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of…
We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…
Adaptiveness is a key principle in information processing including statistics and machine learning. We investigate the usefulness of adaptive methods in the framework of asymptotic binary hypothesis testing, when each hypothesis represents…
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and…
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum…
Quantum computation and communication are important branches of quantum information science. However, noise in realistic quantum devices fundamentally limits the utility of these quantum technologies. A conventional approach towards…
Data-processing inequalities capture the phenomenon that two probability distributions can only become less distinguishable under any common post-processing. For more fine-grained inequalities, one turns to strong data-processing inequality…
Studying the stability of partially observed Markov decision processes (POMDPs) with respect to perturbations in either transition or observation kernels is a significant problem. While asymptotic robustness/stability results as approximate…
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 completely determines the asymptotic behavior: when it holds, a…
This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n +…
Data-processing is a desired property of classical and quantum divergences and information measures. In information theory, the contraction coefficient measures how much the distinguishability of quantum states decreases when they are…
Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress…
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that…
We study the LOCC-assisted quantum capacity of bosonic dephasing channel with energy constraint on input states. We start our analysis by focusing on the energy-constrained squashed entanglement of the channel, which is an upper bound for…
Noise and errors are unavoidable in any realistic quantum process, including processes designed to reduce noise and errors in the first place. In particular, quantum thermodynamical protocols for cooling can be significantly affected,…