Noninvertibility as a requirement for creating a semigroup under convex combinations of channels

• URL: http://arxiv.org/abs/2111.09264v3
• Date: Thu, 10 Mar 2022 22:36:44 GMT
• Title: Noninvertibility as a requirement for creating a semigroup under convex combinations of channels
• Authors: Vinayak Jagadish, R. Srikanth, Francesco Petruccione
• Abstract summary: We find that mixing only semigroups can never produce a semigroup. For a convex combination to yield a semigroup, most of the input channels have to be noninvertible.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Phase-covariant mixtures of non-unital qubit maps [0.0]
  We analyze convex combinations of non-unital qubit maps that are phase-covariant. We show that mixing non-unital channels can result in restoring the unitality, whereas mixing commutative maps can lead to non-commutativity.
  arXiv  Detail & Related papers  (2022-06-21T21:35:17Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Bi-PPT channels are entanglement breaking [77.34726150561087]
  We show that bi-PPT channels are always entanglement breaking. We also show that degradable quantum channels staying completely positive under composition with a transposition are entanglement breaking.
  arXiv  Detail & Related papers  (2022-04-04T17:53:38Z)
• Accessible maps in a group of classical or quantum channels [0.0]
  We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the closure of the analyzed group $G structure are studied.
  arXiv  Detail & Related papers  (2022-01-29T08:06:21Z)
• Digitising SU(2) Gauge Fields and the Freezing Transition [0.0]
  For any Lie group other than U$(1)$, there is no class ofally dense discrete subgroups. Discretisations limited to subgroups are bound to lead to freezing of Monte Carlo simulations at weak couplings. A generalised version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
  arXiv  Detail & Related papers  (2022-01-24T12:09:09Z)
• Lattice-Based Methods Surpass Sum-of-Squares in Clustering [98.46302040220395]
  Clustering is a fundamental primitive in unsupervised learning. Recent work has established lower bounds against the class of low-degree methods. We show that, perhaps surprisingly, this particular clustering model textitdoes not exhibit a statistical-to-computational gap.
  arXiv  Detail & Related papers  (2021-12-07T18:50:17Z)
• Local versions of sum-of-norms clustering [77.34726150561087]
  We show that our method can separate arbitrarily close balls in the ball model. We prove a quantitative bound on the error incurred in the clustering of disjoint connected sets.
  arXiv  Detail & Related papers  (2021-09-20T14:45:29Z)
• On the universal constraints for relaxation rates for quantum dynamical semigroup [0.0]
  A conjecture for the universal constraints for relaxation rates of a quantum dynamical semigroup is proposed. It holds for several interesting classes of semigroups, e.g. unital semigroups and semigroups derived in the weak coupling limit from the proper microscopic model.
  arXiv  Detail & Related papers  (2020-11-20T00:40:13Z)
• On construction of finite averaging sets for $SL(2, \mathbb{C})$ via its Cartan decomposition [0.0]
  Averaging physical quantities over Lie groups appears in many contexts like quantum information science or quantum optics. In this work we investigate the problem of constructing finite averaging sets for averaging over general non-compact matrix Lie groups. We provide an explicit calculation of such sets for the group $SL(2, mathbbC)$, although our construction can be applied to other cases.
  arXiv  Detail & Related papers  (2020-10-29T17:26:33Z)
• Learning Halfspaces with Tsybakov Noise [50.659479930171585]
  We study the learnability of halfspaces in the presence of Tsybakov noise. We give an algorithm that achieves misclassification error $epsilon$ with respect to the true halfspace.
  arXiv  Detail & Related papers  (2020-06-11T14:25:02Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.