Exponential Decay of Matrix $Φ$-Entropies on Markov Semigroups with Applications to Dynamical Evolutions of Quantum Ensembles
November 09, 2015 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel
arXiv ID
1511.02627
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph,
math.OA,
math.PR
Citations
18
Venue
arXiv.org
Last Checked
5 months ago
Abstract
In the study of Markovian processes, one of the principal achievements is the equivalence between the $Φ$-Sobolev inequalities and an exponential decrease of the $Φ$-entropies. In this work, we develop a framework of Markov semigroups on matrix-valued functions and generalize the above equivalence to the exponential decay of matrix $Φ$-entropies. This result also specializes to spectral gap inequalities and modified logarithmic Sobolev inequalities in the random matrix setting. To establish the main result, we define a non-commutative generalization of the carré du champ operator, and prove a de Bruijn's identity for matrix-valued functions. The proposed Markov semigroups acting on matrix-valued functions have immediate applications in the characterization of the dynamical evolution of quantum ensembles. We consider two special cases of quantum unital channels, namely, the depolarizing channel and the phase-damping channel. In the former, since there exists a unique equilibrium state, we show that the matrix $Φ$-entropy of the resulting quantum ensemble decays exponentially as time goes on. Consequently, we obtain a stronger notion of monotonicity of the Holevo quantity - the Holevo quantity of the quantum ensemble decays exponentially in time and the convergence rate is determined by the modified log-Sobolev inequalities. However, in the latter, the matrix $Φ$-entropy of the quantum ensemble that undergoes the phase-damping Markovian evolution generally will not decay exponentially. This is because there are multiple equilibrium states for such a channel. Finally, we also consider examples of statistical mixing of Markov semigroups on matrix-valued functions. We can explicitly calculate the convergence rate of a Markovian jump process defined on Boolean hypercubes, and provide upper bounds of the mixing time on these types of examples.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Quantum Computing
R.I.P.
👻
Ghosted
R.I.P.
👻
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
👻
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
👻
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
👻
Ghosted
Quantum Recommendation Systems
R.I.P.
👻
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted