Related papers: Quantum Hypothesis Testing Lemma for Deterministic…
We study a distributed hypothesis testing setup where peripheral nodes send quantized data to the fusion center in a memoryless fashion. The \emph{expected} number of bits sent by each node under the null hypothesis is kept limited. We…
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…
A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the…
Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…
An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the output distributions induced by the optimal input in the channel…
In this paper, we address the problem of state communication in finite-level quantum systems through noise-affected channels. Our approach is based on a self-consistent theory of decoding inner products associated with the code and error…
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting".…
In the simple quantum hypothesis testing problem, upper bound with asymmetric setting is shown by using a quite useful inequality by Audenaert et al, quant-ph/0610027, which was originally invented for symmetric setting. Using this upper…
We look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix…
Superdense coding is a paradigmatic protocol in quantum information science, employing a quantum communication channel to send classical information more efficiently. As we show here, it can be understood as a particular case of a prepare…
Directed information (DI) is a fundamental measure for the study and analysis of sequential stochastic models. In particular, when optimized over input distributions it characterizes the capacity of general communication channels. However,…
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…
Continuing our earlier work (quant-ph/0401060), we give two alternative proofs of the result that a noiseless qubit channel has identification capacity 2: the first is direct by a "maximal code with random extension" argument, the second is…
Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hamming weight constraint, is established. As a key finding, we…
We develop a framework for characterizing quantum temporal correlations in a general temporal scenario, in which an initial quantum state is measured, sent through a quantum channel, and finally measured again. This framework does not make…
We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the…
We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by…
In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a…