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))$.

v2: 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 (8)

• Quantum Communication With Zero-Capacity Channels
• Unitary designs from statistical mechanics in random quantum circuits
• Estimating the decoherence time using non-commutative Functional Inequalities
• Pseudo-randomness and Learning in Quantum Computation
• Complete Sobolev Type Inequalities
• Graph Hörmander Systems
• Complete Logarithmic Sobolev inequalities via Ricci curvature bounded below
• Complete Logarithmic Sobolev Inequalities via Ricci Curvature Bounded Below II

Cited by in corpus (19)

• Rapid thermalization of spin chain commuting Hamiltonians
• Quantum concentration inequalities
• Entropy decay for Davies semigroups of a one dimensional quantum lattice
• Rapid thermalization of dissipative many-body dynamics of commuting Hamiltonians
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Quantum computational advantage with constant-temperature Gibbs sampling
• Fundamental Limit on the Power of Entanglement Assistance in Quantum Communication
• Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits
• Deviation bounds and concentration inequalities for quantum noises
• Optimal convergence rate in the quantum Zeno effect for open quantum systems in infinite dimensions
• Mixing Time of Open Quantum Systems via Hypocoercivity
• Quantum Optimal Transport: Quantum Channels and Qubits
• Ricci curvature of quantum channels on non-commutative transportation metric spaces
• Derivations and KMS-Symmetric Quantum Markov Semigroups
• Reverse-type Data Processing Inequality
• A Meta Logarithmic-Sobolev Inequality for Phase-Covariant Gaussian Channels
• 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
• Universal trade-off between irreversibility and intrinsic timescale in thermal relaxation with applications to thermodynamic inference