arXiv subjects

Cambyse Rouzé

Publications and source records attributed to Cambyse Rouzé.

65 records · Page 4Linked to original sources

arXiv2020

Eventually entanglement breaking Markovian dynamics: structure and characteristic times

We investigate entanglement breaking times of Markovian evolutions in discrete and continuous time. In continuous time, we characterize which Markovian evolutions are eventually entanglement breaking, that is, evolutions for which there is a finite time after which any entanglement initially present has been destroyed by the noisy evolution. In the discrete time framework, we consider the entanglement breaking index, that is, the number of times a quantum channel has to be composed with itself before it becomes entanglement breaking. The PPT-square conjecture is that every PPT quantum channel has an entanglement breaking index of at most 2; we prove that every faithful PPT quantum channel has a finite entanglement breaking index, and more generally, any faithful PPT CP map whose Hilbert-Schmidt adjoint is also faithful is eventually entanglement breaking. We also provide a method to obtain concrete bounds on this index for any faithful quantum channel. To obtain these estimates, we use a notion of robustness of separability to obtain bounds on the radius of the largest separable ball around faithful product states. We also extend the framework of Poincaré inequalities for nonprimitive semigroups to the discrete setting to quantify the convergence of quantum semigroups in discrete time, which is of independent interest.

quant-ph↗

arXiv2020

Convergence rates for the quantum central limit theorem

Various quantum analogues of the central limit theorem, which is one of the cornerstones of probability theory, are known in the literature. One such analogue, due to Cushen and Hudson, is of particular relevance for quantum optics. It implies that the state in any single output arm of an $n$-splitter, which is fed with $n$ copies of a centred state $ρ$ with finite second moments, converges to the Gaussian state with the same first and second moments as $ρ$. Here we exploit the phase space formalism to carry out a refined analysis of the rate of convergence in this quantum central limit theorem. For instance, we prove that the convergence takes place at a rate $\mathcal{O}\left(n^{-1/2}\right)$ in the Hilbert--Schmidt norm whenever the third moments of $ρ$ are finite. Trace norm or relative entropy bounds can be obtained by leveraging the energy boundedness of the state. Via analytical and numerical examples we show that our results are tight in many respects. An extension of our proof techniques to the non-i.i.d. setting is used to analyse a new model of a lossy optical fibre, where a given $m$-mode state enters a cascade of $n$ beam splitters of equal transmissivities $λ^{1/n}$ fed with an arbitrary (but fixed) environment state. Assuming that the latter has finite third moments, and ignoring unitaries, we show that the effective channel converges in diamond norm to a simple thermal attenuator, with a rate $\mathcal{O}\Big(n^{-\frac{1}{2(m+1)}}\Big)$. This allows us to establish bounds on the classical and quantum capacities of the cascade channel. Along the way, we derive several results that may be of independent interest. For example, we prove that any quantum characteristic function $χ_ρ$ is uniformly bounded by some $η_ρ<1$ outside of any neighbourhood of the origin; also, $η_ρ$ can be made to depend only on the energy of the state $ρ$.

quant-ph↗

arXiv2019

Stability of logarithmic Sobolev inequalities under a noncommutative change of measure

We generalize Holley-Stroock's perturbation argument from commutative to quantum Markov semigroups. As a consequence, results on (complete) modified logarithmic Sobolev inequalities and logarithmic Sobolev inequalities for self-adjoint quantum Markov process can be used to prove estimates on the exponential convergence in relative entropy of quantum Markov systems which preserve a fixed state. This leads to estimates for the decay to equilibrium for coupled systems and to estimates for mixed state preparation times using Lindblad operators. Our techniques also apply to discrete time settings, where we show that the strong data processing inequality constant of a quantum channel can be controlled by that of a corresponding unital channel.

quant-ph↗

arXiv2019

On the mass of static metrics with positive cosmological constant -- II

This is the second of two works, in which we discuss the definition of an appropriate notion of mass for static metrics, in the case where the cosmological constant is positive and the model solutions are compact. In the first part, we have established a positive mass statement, characterising the de Sitter solution as the only static vacuum metric with zero mass. In this second part, we prove optimal area bounds for horizons of black hole type and of cosmological type, corresponding to Riemannian Penrose inequalities and to cosmological area bounds à la Boucher-Gibbons-Horowitz, respectively. Building on the related rigidity statements, we also deduce a uniqueness result for the Schwarzschild--de Sitter spacetime.

math.AP↗

arXiv2019

Strong converse bounds in quantum network information theory: distributed hypothesis testing and source coding

We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between Alice and Bob. They are allowed to perform local operations on their respective systems and send quantum information to Charlie at limited rates. By doing measurements on the systems that he receives, Charlie needs to infer which of the two different states the original bipartite state was in, that is, which of the two hypotheses is true. We prove that the Stein exponent for this problem is given by a regularized quantum relative entropy. The latter reduces to a single letter formula when the alternative hypothesis consists of the products of the marginals of the null hypothesis, and there is no rate constraint imposed on Bob. Our proof relies on certain properties of the so-called quantum information bottleneck function. The second part of this paper concerns the general problem of finding finite blocklength strong converse bounds in quantum network information theory. In the classical case, the analogue of this problem has been reformulated in terms of the so-called image size characterization problem. Here, we extend this problem to the classical-quantum setting and prove a second order strong converse bound for it. As a by-product, we obtain a similar bound for the Stein exponent for distributed hypothesis testing in the special case in which the bipartite system is a classical-quantum system, as well as for the task of quantum source coding with compressed classical side information. Our proofs use a recently developed tool from quantum functional inequalities, namely, the tensorization property of reverse hypercontractivity for the quantum depolarizing semigroup.

quant-ph↗

arXiv2019

Strong Converse for Classical-Quantum Degraded Broadcast Channels

We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of such a channel is contained in a region characterized by certain entropic quantities. We prove that this region satisfies the strong converse property, that is, the maximal probability of error incurred in transmitting information at rates lying outside this region converges to one exponentially in the number of uses of the channel. In establishing this result, we prove a second-order Fano-type inequality, which might be of independent interest. A powerful analytical tool which we employ in our proofs is the tensorization property of the quantum reverse hypercontractivity for the quantum depolarizing semigroup.

quant-ph↗

arXiv2018

Hypercontractivity and logarithmic Sobolev Inequality for non-primitive quantum Markov semigroups and estimation of decoherence rates

We generalize the concepts of weak quantum logarithmic Sobolev inequality (LSI) and weak hypercontractivity (HC), introduced in the quantum setting by Olkiewicz and Zegarlinski, to the case of non-primitive quantum Markov semigroups (QMS). The originality of this work resides in that this new notion of hypercontractivity is given in terms of the so-called amalgamated $\mathbb{L}_p$ norms introduced recently by Junge and Parcet in the context of operator spaces theory. We make three main contributions. The first one is a version of Gross' integration lemma: we prove that (weak) HC implies (weak) LSI. Surprisingly, the converse implication differs from the primitive case as we show that LSI implies HC but with a weak constant equal to the cardinal of the center of the decoherence-free algebra. Building on the first implication, our second contribution is the fact that strong LSI and therefore strong HC do not hold for non-trivially primitive QMS. This implies that the amalgamated $\mathbb{L}_p$ norms are not uniformly convex for $1\leq p \leq 2$. As a third contribution, we derive universal bounds on the (weak) logarithmic Sobolev constants for a QMS on a finite dimensional Hilbert space, using a similar method as Diaconis and Saloff-Coste in the case of classical primitive Markov chains, and Temme, Pastawski and Kastoryano in the case of primitive QMS. This leads to new bounds on the decoherence rates of decohering QMS. Additionally, we apply our results to the study of the tensorization of HC in non-commutative spaces in terms of the completely bounded norms (CB norms) recently introduced by Beigi and King for unital and trace preserving QMS. We generalize their results to the case of a general primitive QMS and provide estimates on the (weak) constants.

math-ph↗

arXiv2017

Concentration of quantum states from quantum functional and transportation cost inequalities

Quantum functional inequalities (e.g. the logarithmic Sobolev- and Poincaré inequalities) have found widespread application in the study of the behavior of primitive quantum Markov semigroups. The classical counterparts of these inequalities are related to each other via a so-called transportation cost inequality of order 2 (TC2). The latter inequality relies on the notion of a metric on the set of probability distributions called the Wasserstein distance of order 2. (TC2) in turn implies a transportation cost inequality of order 1 (TC1). In this paper, we introduce quantum generalizations of the inequalities (TC1) and (TC2), making use of appropriate quantum versions of the Wasserstein distances, one recently defined by Carlen and Maas and the other defined by us. We establish that these inequalities are related to each other, and to the quantum modified logarithmic Sobolev- and Poincaré inequalities, as in the classical case. We also show that these inequalities imply certain concentration-type results for the invariant state of the underlying semigroup. We consider the example of the depolarizing semigroup to derive concentration inequalities for any finite dimensional full-rank quantum state. These inequalities are then applied to derive upper bounds on the error probabilities occurring in the setting of finite blocklength quantum parameter estimation.

quant-ph↗

arXiv2017

Relating relative entropy, optimal transport and Fisher information: a quantum HWI inequality

Quantum Markov semigroups characterize the time evolution of an important class of open quantum systems. Studying convergence properties of such a semigroup, and determining concentration properties of its invariant state, have been the focus of much research. Quantum versions of functional inequalities (like the modified logarithmic Sobolev and Poincaré inequalities) and the so-called transportation cost inequalities, have proved to be essential for this purpose. Classical functional and transportation cost inequalities are seen to arise from a single geometric inequality, called the Ricci lower bound, via an inequality which interpolates between them. The latter is called the HWI-inequality, where the letters I, W and H are, respectively, acronyms for the Fisher information (arising in the modified logarithmic Sobolev inequality), the so-called Wasserstein distance (arising in the transportation cost inequality) and the relative entropy (or Boltzmann H function) arising in both. Hence, classically, all the above inequalities and the implications between them form a remarkable picture which relates elements from diverse mathematical fields, such as Riemannian geometry, information theory, optimal transport theory, Markov processes, concentration of measure, and convexity theory. Here we consider a quantum version of the Ricci lower bound introduced by Carlen and Maas, and prove that it implies a quantum HWI inequality from which the quantum functional and transportation cost inequalities follow. Our results hence establish that the unifying picture of the classical setting carries over to the quantum one.

quant-ph↗

arXiv2016

Data processing for the sandwiched Rényi divergence: a condition for equality

The $α$-sandwiched Rényi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for $α\geq 1/2$. In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the $α$-sandwiched Rényi divergence for all $α\geq 1/2$. For the range $α\in [1/2,1)$, our result provides the only condition for equality obtained thus far. To prove our result, we first consider the special case of partial trace, and derive a condition for equality based on the original proof of the data processing inequality by Frank and Lieb [J. Math. Phys. 54.12 (2013), p. 122201] using a strict convexity/concavity argument. We then generalize to arbitrary quantum operations via the Stinespring Representation Theorem. As applications of our condition for equality in the data processing inequality, we deduce conditions for equality in various entropic inequalities. We formulate a Rényi version of the Araki-Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb [Lett. Math. Phys. 101.1 (2012), pp. 1-11] about equality in the original Araki-Lieb inequality. Furthermore, we prove a general lower bound on a Rényi version of the entanglement of formation, and observe that it is attained by states saturating the Rényi version of the Araki-Lieb inequality. Finally, we prove that the known upper bound on the entanglement fidelity in terms of the usual fidelity is saturated only by pure states.

quant-ph↗

arXiv2016

Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. - quantum lattice systems and more

Quantum Stein's Lemma is a cornerstone of quantum statistics and concerns the problem of correctly identifying a quantum state, given the knowledge that it is one of two specific states ($ρ$ or $σ$). It was originally derived in the asymptotic i.i.d. setting, in which arbitrarily many (say, $n$) identical copies of the state ($ρ^{\otimes n}$ or $σ^{\otimes n}$) are considered to be available. In this setting, the lemma states that, for any given upper bound on the probability $α_n$ of erroneously inferring the state to be $σ$, the probability $β_n$ of erroneously inferring the state to be $ρ$ decays exponentially in $n$, with the rate of decay converging to the relative entropy of the two states. The second order asymptotics for quantum hypothesis testing, which establishes the speed of convergence of this rate of decay to its limiting value, was derived in the i.i.d. setting independently by Tomamichel and Hayashi, and Li. We extend this result to settings beyond i.i.d.. Examples of these include Gibbs states of quantum spin systems (with finite-range, translation-invariant interactions) at high temperatures.

quant-ph↗