On the modified logarithmic Sobolev inequality for the heat-bath dynamics for 1D systems
I. Bardet, A. Capel, A. Lucia, D. Pérez-García, C. Rouzé
Journal of Mathematical Physics 62, 61901 (2021).
The mixing time of Markovian dissipative evolutions of open quantum many-body systems can be bounded using optimal constants of certain quantum functional inequalities, such as the modified logarithmic Sobolev constant. For classical spin systems, the positivity of such constants follows from a mixing condition for the Gibbs measure via quasi-factorization results for the entropy. Inspired by the classical case, we present a strategy to derive the positivity of the modified logarithmic Sobolev constant associated with the dynamics of certain quantum systems from some clustering conditions on the Gibbs state of a local, commuting Hamiltonian. In particular, we show that for the heat-bath dynamics of 1D systems, the modified logarithmic Sobolev constant is positive under the assumptions of a mixing condition on the Gibbs state and a strong quasi-factorization of the relative entropy.
Approximate tensorization of the relative entropy for noncommuting conditional expectations
Ivan Bardet, Angela Capel, Cambyse Rouzé
In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call approximate tensorization of the relative entropy, can be expressed as a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.
Complete entropic inequalities for Quantum Markov chains
Li Gao, Cambyse Rouzé
We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum channel satisfies a strong data processing inequality with respect to its decoherence free part. Moreover, we establish the first general approximate tensorization property of relative entropy. This extends the famous strong subadditivity of the quantum entropy (SSA) of two subsystems to the general setting of two subalgebras. All the three results are independent of the size of the environment and hence satisfy the tensorization property. They are obtained via a common, conceptually simple method for proving entropic inequalities via spectral or L2-estimates. As applications, we combine our results on the modified log-Sobolev inequality and approximate tensorization to derive bounds for examples of both theoretical and practical relevance, including representation of sub-Laplacians on SU(2) and various classes of local quantum Markov semigroups such as quantum Kac generators and continuous time approximate unitary designs. For the latter, our bounds imply the existence of local continuous time Markovian evolutions on nk qudits forming ε-approximate k-designs in relative entropy for times scaling as Õ(n poly(k)).
The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
Ángela Capel, Cambyse Rouzé, Daniel Stilck França
Given a uniform, frustration-free family of local Lindbladians defined on a quantum lattice spin system in any spatial dimension, we prove a strong exponential convergence in relative entropy of the system to equilibrium under a condition of spatial mixing of the stationary Gibbs states and the rapid decay of the relative entropy on finite-size blocks. Our result leads to the first examples of the positivity of the modified logarithmic Sobolev inequality for quantum lattice spin systems independently of the system size. Moreover, we show that our notion of spatial mixing is a consequence of the recent quantum generalization of Dobrushin and Shlosman's complete analyticity of the free-energy at equilibrium. The latter typically holds above a critical temperature Tc. Our results have wide-ranging applications in quantum information. As an illustration, we discuss four of them: first, using techniques of quantum optimal transport, we show that a quantum annealer subject to a finite range classical noise will output an energy close to that of the fixed point after constant annealing time. Second, we prove Gaussian concentration inequalities for Lipschitz observables and show that the eigenstate thermalization hypothesis holds for certain high-temperture Gibbs states. Third, we prove a finite blocklength refinement of the quantum Stein lemma for the task of asymmetric discrimination of two Gibbs states of commuting Hamiltonians satisfying our conditions. Fourth, in the same setting, our results imply the existence of a local quantum circuit of logarithmic depth to prepare Gibbs states of a class of commuting Hamiltonians.
Energy-constrained discrimination of unitaries, quantum speed limits and a Gaussian Solovay-Kitaev theorem
Simon Becker, Nilanjana Datta, Ludovico Lami, Cambyse Rouzé
Physical Review Letters 126, 190504 (2021).
We investigate the energy-constrained (EC) diamond norm distance between unitary channels acting on possibly infinite-dimensional quantum systems, and establish a number of results. Firstly, we prove that optimal EC discrimination between two unitary channels does not require the use of any entanglement. Extending a result by Acín, we also show that a finite number of parallel queries suffices to achieve zero error discrimination even in this EC setting. Secondly, we employ EC diamond norms to study a novel type of quantum speed limits, which apply to pairs of quantum dynamical semigroups. We expect these results to be relevant for benchmarking internal dynamics of quantum devices. Thirdly, we establish a version of the Solovay--Kitaev theorem that applies to the group of Gaussian unitaries over a finite number of modes, with the approximation error being measured with respect to the EC diamond norm relative to the photon number Hamiltonian.
Energy-Constrained Discrimination of Unitaries, Quantum Speed Limits, and a Gaussian Solovay-Kitaev Theorem
S. Becker, N. Datta, L. Lami, C. Rouzé
Physical Review Letters 126, 190504 (2021).
We investigate the energy-constrained (EC) diamond norm distance between unitary channels acting on possibly infinite-dimensional quantum systems, and establish a number of results. First, we prove that optimal EC discrimination between two unitary channels does not require the use of any entanglement. Extending a result by Acín, we also show that a finite number of parallel queries suffices to achieve zero error discrimination even in this EC setting. Second, we employ EC diamond norms to study a novel type of quantum speed limits, which apply to pairs of quantum dynamical semigroups. We expect these results to be relevant for benchmarking internal dynamics of quantum devices. Third, we establish a version of the Solovay-Kitaev theorem that applies to the group of Gaussian unitaries over a finite number of modes, with the approximation error being measured with respect to the EC diamond norm relative to the photon number Hamiltonian.
Group Transference Techniques for the Estimation of the Decoherence Times and Capacities of Quantum Markov Semigroups
I. Bardet, M. Junge, N. LaRacuente, C. Rouzé, D.S. França
IEEE Transactions on Information Theory 67, 2878-2909 (2021).
Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable in general. Much recent work has focused on upper bounding certain capacities in terms of more tractable quantities such as specific norms from operator theory. In the meantime, there has also been substantial recent progress on estimating decoherence times with techniques from analysis and geometry, even though many hard questions remain open. In this article, we introduce a class of continuous-time quantum channels that we called transferred channels , which are built through representation theory from a classical Markov kernel defined on a compact group. In particular, we study two subclasses of such kernels: Hörmander systems on compact Lie-groups and Markov chains on finite groups. Examples of transferred channels include the depolarizing channel, the dephasing channel, and collective decoherence channels acting on d qubits. Some of the estimates presented are new, such as those for channels that randomly swap subsystems. We then extend tools developed in earlier work by Gao, Junge and LaRacuente to transfer estimates of the classical Markov kernel to the transferred channels and study in this way different non-commutative functional inequalities. The main contribution of this article is the application of this transference principle to the estimation of decoherence time, of private and quantum capacities, of entanglement-assisted classical capacities as well as estimation of entanglement breaking times, defined as the first time for which the channel becomes entanglement breaking. Moreover, our estimates hold for non-ergodic channels such as the collective decoherence channels, an important scenario that has been overlooked so far because of a lack of techniques.
Convergence Rates for the Quantum Central Limit Theorem
S. Becker, N. Datta, L. Lami, C. Rouzé
Communications in Mathematical Physics 383, 223–279 (2021).
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 O(n−1/2) 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 O(n−12(m+1)). 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 ρ.
On contraction coefficients, partial orders and approximation of capacities for quantum channels
Christoph Hirche, Cambyse Rouzé, Daniel Stilck França
The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel. It is the centerpiece of many results in information theory and justifies the operational interpretation of most entropic quantities. In this work, we revisit the notion of contraction coefficients of quantum channels, which provide sharper and specialized versions of the data processing inequality. A concept closely related to data processing are partial orders on quantum channels. We discuss several quantum extensions of the well known less noisy ordering and then relate them to contraction coefficients. We further define approximate versions of the partial orders and show how they can give strengthened and conceptually simple proofs of several results on approximating capacities. Moreover, we investigate the relation to other partial orders in the literature and their properties, particularly with regards to tensorization. We then investigate further properties of contraction coefficients and their relation to other properties of quantum channels, such as hypercontractivity. Next, we extend the framework of contraction coefficients to general f-divergences and prove several structural results. Finally, we consider two important classes of quantum channels, namely Weyl-covariant and bosonic Gaussian channels. For those, we determine new contraction coefficients and relations for various partial orders.
Quantum Reverse Hypercontractivity: Its Tensorization and Application to Strong Converses
S. Beigi, N. Datta, C. Rouzé
Communications in Mathematical Physics 376, 753–794 (2020).
In this paper we develop the theory of quantum reverse hypercontractivity inequalities and show how they can be derived from log-Sobolev inequalities. Next we prove a generalization of the Stroock–Varopoulos inequality in the non-commutative setting which allows us to derive quantum hypercontractivity and reverse hypercontractivity inequalities solely from 2-log-Sobolev and 1-log-Sobolev inequalities respectively. We then prove some tensorization-type results providing us with tools to prove hypercontractivity and reverse hypercontractivity not only for certain quantum superoperators but also for their tensor powers. Finally as an application of these results, we generalize a recent technique for proving strong converse bounds in information theory via reverse hypercontractivity inequalities to the quantum setting. We prove strong converse bounds for the problems of quantum hypothesis testing and classical-quantum channel coding based on the quantum reverse hypercontractivity inequalities that we derive.