Related papers: Hypercontractivity for Quantum Erasure Channels vi…
We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum…
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…
Lieb and Solovej \cite{liebsolBloch} studied traces of quantum channels, defined by the leading component in the decomposition of the tensor product of two irreducible representations of $SU(2)$, to establish a Wehrl-type inequality for…
Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…
We establish an improved form of the classical logarithmic Sobolev inequality for the Gaussian measure restricted to probability densities which satisfy a Poincar\'e inequality. The result implies a lower bound on the deficit in terms of…
We define the quantum $p$-divergences and introduce Beckner's inequalities for primitive quantum Markov semigroups on a finite-dimensional matrix algebra satisfying the detailed balance condition. Such inequalities quantify the convergence…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…
In this article we study generalization of the classical Talagrand transport-entropy inequality in which the Wasserstein distance is replaced by the entropic transportation cost. This class of inequalities has been introduced in the recent…
This paper establishes several converse bounds on the private transmission capabilities of a quantum channel. The main conceptual development builds firmly on the notion of a private state, which is a powerful, uniquely quantum method for…
We prove an intrinsic equivalence between strong hypercontractivity and a strong logarithmic Sobolev inequality for the cone of logarithmically subharmonic functions. We introduce a new large class of measures, Euclidean regular and…
We derive a lower bound for the Wehrl entropy in the setting of SU(1,1). For asymptotically high values of the quantum number k, this bound coincides with the analogue of the Lieb-Wehrl conjecture for SU(1,1) coherent states. The bound on…
We propose a hybrid quantum-classical eigensolver to address the computational challenges of simulating strongly correlated quantum many-body systems, where the exponential growth of the Hilbert space and extensive entanglement render…
Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on the system state in general, with the…
We prove the quantum conditional Entropy Power Inequality for quantum additive noise channels. This inequality lower bounds the quantum conditional entropy of the output of an additive noise channel in terms of the quantum conditional…
We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back to the classical decoding problem. It appears for the first…
We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB [Pirandola,…
Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…