Complete Entropic Inequalities for Quantum Markov Chains

نویسندگان

چکیده

We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies modified log-Sobolev inequality. In the discrete time setting, we channel strong data processing inequality with respect to its decoherence free part. Moreover, establish first general approximate tensorization property of relative entropy. This extends famous subadditivity entropy (SSA) two subsystems setting subalgebras. All three results are independent size environment and hence satisfy property. They obtained via common, conceptually simple method for proving entropic inequalities spectral or $L_2$-estimates. As applications, combine our derive bounds examples both theoretical practical relevance, including representation sub-Laplacians $\operatorname{SU}(2)$ various classes local semigroups such as Kac generators continuous unitary designs. For latter, imply existence Markovian evolutions $nk$ qudits forming $\epsilon$-approximate $k$-designs in times scaling $\widetilde{\mathcal{O}}(n^2 \operatorname{poly}(k))$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cheeger inequalities for transient Markov chains

We construct upper and lower bounds for Cheeger-type constants for transient Markov chains. We first treat the situation where there is a detailed balance condition and obtain bounds that rely exclusively on the first and second eigenvalues of the substochastic transition matrix. Secondly, we consider general substochastic transition matrices and develop bounds in this broader setting. The effi...

متن کامل

Nash Inequalities for Finite Markov Chains

This paper develops bounds on the rate of decay of powers of Markov kernels on finite state spaces. These are combined with eigenvalue estimates to give good bounds on the rate of convergence to stationarity for finite Markov chains whose underlying graph has moderate volume growth. Roughly, for such chains, order (diameter) 2 steps are necessary and suffice to reach stationarity. We consider l...

متن کامل

Approximate quantum Markov chains

This chapter reviews the concept of a Markov chain for random variables and then introduces a generalization to quantummechanical systems. We discuss the subtle differences between classical and quantumMarkov chains and point out difficulties that show up in the quantum case. Unlike the classical case that has been analyzed and understood well in the past, certain aspects of quantumMarkov chain...

متن کامل

Quantum Markov Chains

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G, E) where G is a directed graph and E = [Eij ] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archive for Rational Mechanics and Analysis

سال: 2022

ISSN: ['0003-9527', '1432-0673']

DOI: https://doi.org/10.1007/s00205-022-01785-1