Complete entropic inequalities for quantum Markov chains

Abstract

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 $L_2$-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 $\mathrm{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 $\epsilon$-approximate $k$-designs in relative entropy for times scaling as $\tilde{\mathcal{O}}(n^2\mathrm{poly}(k))$.

arXiv commentv2: results are improved and added. In particular asymptotically tighter bounds are provided in Section 5. Two new sections (Section 6 and 7) contain examples including transferred sub-Laplacians, quantum Kac generators and approximate designs. v3: minor corrections with new title and abstract

References in corpus (35)

• The Uncertainty Principle in the Presence of Quantum Memory
• Entropic Uncertainty Relations and their Applications
• Superadditivity of communication capacity using entangled inputs
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Quantum Communication With Zero-Capacity Channels
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces
• Quantum logarithmic Sobolev inequalities and rapid mixing
• The ${\chi }^2$-divergence and Mixing times of quantum Markov processes
• Universal recovery maps and approximate sufficiency of quantum relative entropy
• Optimal Hypercontractivity for Fermi Fields and Related Non-Commutative Integration
• Monotonicity of the Quantum Relative Entropy Under Positive Maps
• Information theoretic treatment of tripartite systems and quantum channels
• Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems
• Unitary designs from statistical mechanics in random quantum circuits
• A simple proof of the detectability lemma and spectral gap amplification
• Entropy Production of Doubly Stochastic Quantum Channels
• The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
• Families of completely positive maps associated with monotone metrics
• Contraction coefficients for noisy quantum channels
• Estimating the decoherence time using non-commutative Functional Inequalities
• Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing
• Relative entropy for von Neumann subalgebras
• Approximate tensorization of the relative entropy for noncommuting conditional expectations
• Stability of logarithmic Sobolev inequalities under a noncommutative change of measure
• Quantum Brascamp-Lieb Dualities
• Pseudo-randomness and Learning in Quantum Computation
• Quasi-factorization and Multiplicative Comparison of Subalgebra-Relative Entropy
• Quantum Hamiltonian complexity and the detectability lemma
• Graph Hörmander Systems
• Complete Sobolev Type Inequalities
• Unifying Entanglement with Uncertainty via Symmetries of Observable Algebras
• Complete Logarithmic Sobolev Inequalities via Ricci Curvature Bounded Below II
• Complete Logarithmic Sobolev inequalities via Ricci curvature bounded below

Cited by in corpus (23)

• Rapid thermalization of spin chain commuting Hamiltonians
• Entropy decay for Davies semigroups of a one dimensional quantum lattice
• Quantum concentration inequalities
• The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
• Approximate tensorization of the relative entropy for noncommuting conditional expectations
• Stability of logarithmic Sobolev inequalities under a noncommutative change of measure
• Rapid thermalization of dissipative many-body dynamics of commuting Hamiltonians
• Quantum computational advantage with constant-temperature Gibbs sampling
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Fundamental Limit on the Power of Entanglement Assistance in Quantum Communication
• Quasi-factorization and Multiplicative Comparison of Subalgebra-Relative Entropy
• Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits
• Optimal convergence rate in the quantum Zeno effect for open quantum systems in infinite dimensions
• Deviation bounds and concentration inequalities for quantum noises
• Quantum Optimal Transport: Quantum Channels and Qubits
• Mixing Time of Open Quantum Systems via Hypocoercivity
• Ricci curvature of quantum channels on non-commutative transportation metric spaces
• Derivations and KMS-Symmetric Quantum Markov Semigroups
• A Meta Logarithmic-Sobolev Inequality for Phase-Covariant Gaussian Channels
• Reverse-type Data Processing Inequality
• Universal trade-off between irreversibility and intrinsic timescale in thermal relaxation with applications to thermodynamic inference
• The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions
• Efficient and simple Gibbs state preparation of the 2D toric code via duality to classical Ising chains