Table of Contents
Fetching ...

An Exponential Mixing Condition for Quantum Channels

Abdessatar Souissi, Abdessatar Barhoumi

TL;DR

This paper develops a quantitative criterion for mixing in quantum channels via the quantum Markov-Dobrushin inequality, showing that a positive Markov-Dobrushin constant $\kappa_{\mathcal{M}}$ guarantees exponential mixing with rate $\theta_{\mathcal{M}} = -\ln(1-\mathrm{Tr}(\kappa_{\mathcal{M}}))$. It proves a contraction bound in the total-variation-like norm and extends the result to convex mixtures with the completely depolarizing channel, $\mathcal{M}_{\alpha}=\alpha\mathcal{M}+(1-\alpha)\Omega$, which are exponentially mixing with $\theta_{\mathcal{M}_{\alpha}} \ge -\ln(\alpha)$. The paper also identifies limitations, showing unistochastic channels are not mixing and characterizes ergodicity for mixed-unitary channels averaged over finite groups, with ergodicity precisely when the group-average channel equals $\Omega$. A detailed qubit example demonstrates mixing behavior and convergence rates, illustrating the practical impact for quantum information tasks. These results illuminate how Markov-Dobrushin-type contractions govern long-time behavior of quantum dynamics and offer avenues for applications in quantum algorithms and walks.

Abstract

Quantum channels, pivotal in information processing, describe transformations within quantum systems and enable secure communication and error correction. Ergodic and mixing properties elucidate their behavior. In this paper, we establish a sufficient condition for mixing based on a quantum Markov-Dobrushin inequality. We prove that if the Markov-Dobrushin constant of a quantum channel exceeds zero, it exhibits exponential mixing behavior. We explore limitations of some quantum channels, demonstrating that unistochastic channels are not mixing. Additionally, we analyze ergodicity of a class of mixed-unitary channels associated with finite groups of unitary operators. Finally, we apply our results to the qubit depolarizing channel.

An Exponential Mixing Condition for Quantum Channels

TL;DR

This paper develops a quantitative criterion for mixing in quantum channels via the quantum Markov-Dobrushin inequality, showing that a positive Markov-Dobrushin constant guarantees exponential mixing with rate . It proves a contraction bound in the total-variation-like norm and extends the result to convex mixtures with the completely depolarizing channel, , which are exponentially mixing with . The paper also identifies limitations, showing unistochastic channels are not mixing and characterizes ergodicity for mixed-unitary channels averaged over finite groups, with ergodicity precisely when the group-average channel equals . A detailed qubit example demonstrates mixing behavior and convergence rates, illustrating the practical impact for quantum information tasks. These results illuminate how Markov-Dobrushin-type contractions govern long-time behavior of quantum dynamics and offer avenues for applications in quantum algorithms and walks.

Abstract

Quantum channels, pivotal in information processing, describe transformations within quantum systems and enable secure communication and error correction. Ergodic and mixing properties elucidate their behavior. In this paper, we establish a sufficient condition for mixing based on a quantum Markov-Dobrushin inequality. We prove that if the Markov-Dobrushin constant of a quantum channel exceeds zero, it exhibits exponential mixing behavior. We explore limitations of some quantum channels, demonstrating that unistochastic channels are not mixing. Additionally, we analyze ergodicity of a class of mixed-unitary channels associated with finite groups of unitary operators. Finally, we apply our results to the qubit depolarizing channel.
Paper Structure (8 sections, 6 theorems, 38 equations)

This paper contains 8 sections, 6 theorems, 38 equations.

Key Result

Theorem 1

A super-operator $\mathcal{M}$ from $\mathcal{B}(\mathcal{H})$ into itself is completely positive iff it can be expressed in terms of a finite collection of operators $\{K_i\}_{i\in I}$ as follows where $K_i$ are referred to as Kraus operators Kraus83.

Theorems & Definitions (17)

  • Theorem 1: Choi75
  • Definition 1
  • Remark 1
  • Definition 2
  • Definition 3
  • Remark 2
  • Lemma 1
  • Theorem 2
  • Proof 1
  • Remark 3
  • ...and 7 more