Related papers: Tensorization of the strong data processing inequa…
The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory, due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More…
It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8),…
We consider continuous-time (not necessarily finite) Markov chains on discrete spaces and identify a curvature-dimension inequality, the condition $CD_\Upsilon(\kappa,\infty)$, which serves as a natural analogue of the classical…
We investigate models of nonlinear quantum computation based on deterministic positive trace-preserving (PTP) channels and evolution equations. The models are defined in any finite Hilbert space, but the main results are for dimension $N \!…
Single-shot quantum channel discrimination is a fundamental task in quantum information theory. It is well known that entanglement with an ancillary system can help in this task, and furthermore that an ancilla with the same dimension as…
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by the diamond norm. Beyond this basic setting, however, many…
We consider a quantum system described by a quantum channel $\Phi$ that is applied at every time step and study the time evolution of its information capacities. When $\Phi$ is a GNS-symmetric channel (this includes Pauli channels, for…
The measured relative entropies of quantum states and channels find operational significance in quantum information theory as achievable error rates in hypothesis testing tasks. They are of interest in the near term, as they correspond to…
We introduce quantum versions of the $\chi^2$-divergence, provide a detailed analysis of their properties, and apply them in the investigation of mixing times of quantum Markov processes. An approach similar to the one presented in [1-3]…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
The relative entropy and chi-squared divergence are fundamental divergence measures in information theory and statistics. This paper is focused on a study of integral relations between the two divergences, the implications of these…
In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong…
This work provides data-processing and majorization inequalities for $f$-divergences, and it considers some of their applications to coding problems. This work also provides tight bounds on the R\'{e}nyi entropy of a function of a discrete…
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…
Transmission of high dimensional entanglement through quantum channels is a significant area of interest in quantum information science. The certification of high dimensional entanglement is usually done through Schmidt numbers. Schmidt…
It has been shown that the $\alpha-z$ R{\'e}nyi relative entropy satisfies the Data Processing Inequality (DPI) for a certain range of $\alpha$'s and $z$'s. Moreover, the range is completely characterized by Zhang in `20. We prove necessary…
The main topic of this thesis is the proof of two fundamental entropic inequalities for quantum Gaussian channels. Quantum Gaussian channels model the propagation of electromagnetic waves through optical fibers and free space in the quantum…
This paper considers the speed of convergence (mixing) of a finite Markov kernel $P$ with respect to the Kullback-Leibler divergence (entropy). Given a Markov kernel one defines either a discrete-time Markov chain (with the $n$-step…
Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information…
Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from,…