Noninvertibility as a requirement for creating a semigroup under convex combinations of channels
Abstract
We study the conditions under which a semigroup is obtained upon convex combinations of channels. In particular, we study the set of Pauli and generalized Pauli channels. We find that mixing only semigroups can never produce a semigroup. Counter-intuitively, we find that for a convex combination to yield a semigroup, most of the input channels have to be noninvertible.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.