Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2201.12524 · Open Systems & Information Dynamics

Accessible Maps in a Group of Classical or Quantum Channels

Koorosh Sadri, Fereshte Shahbeigi, Zbigniew Puchała, Karol Życzkowski

Published Mar 1, 2022• 0 citations
arXivHTMLPDF

Abstract

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 structure of the closure of the analyzed group [Formula: see text] plays a pivotal role in this regard. The set of all convex combinations of the group elements contains a subset of channels that are accessible by a dynamical semigroup. We demonstrate that accessible channels are determined by probability vectors of weights of a convex combination of the group elements, which depend neither on the dimension of the space on which the channels act, nor on the specific representation of the group. Investigating geometric properties of the set [Formula: see text] of accessible maps we show that this set is nonconvex, but it enjoys the star-shape property with respect to the uniform mixture of all elements of the group. We demonstrate that the set [Formula: see text] covers a positive volume in the polytope of all convex combinations of the elements of the group.

DOI
10.1142/s1230161222500020

Related papers

Log-convex set of Lindblad semigroups acting on N-level system

Fereshte Shahbeigi, David Amaro-Alcalá, Zbigniew Puchała +1 more

We analyze the set ANQ of mixed unitary channels represented in the Weyl basis and accessible by a Lindblad semigroup acting on an N-level quantum system. General necessary and sufficient conditions for a mixed Weyl quantum channel of an arbitrary dimension to be accessible by a semigroup are established. The set ANQ is shown to be log-convex and star-shaped with respect to the completely depolarizing channel. A decoherence supermap acting in the space of Lindblad operators transforms them into the space of Kolmogorov generators of classical semigroups. We show that for mixed Weyl channels, the super-decoherence commutes with the dynamics so that decohering a quantum accessible channel, we obtain a bistochastic matrix from the set ANC of classical maps accessible by a semigroup. Focusing on three-level systems, we investigate the geometry of the sets of quantum accessible maps, its classical counterpart, and the support of their spectra. We demonstrate that the set A3Q is not included in the set U3Q of quantum unistochastic channels, although an analogous relation holds for N = 2. The set of transition matrices obtained by super-decoherence of unistochastic channels of order N ≥ 3 is shown to be larger than the set of unistochastic matrices of this order and yields a motivation to introduce the larger sets of k-unistochastic matrices.

arXiv:2003.12184•Journal of Mathematical Physics•Jul 1, 2021•11 citations

Convex bodies of states and maps

Janusz Grabowski, Alberto Ibort, Marek Kuś +1 more

We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k -entangled states are also considered as examples of our techniques.

arXiv:1306.3187•Journal of Physics A Mathematical and Theoretical•Oct 7, 2013•3 citations

Generalized channels: Channels for convex subsets of the state space

Anna Jenčová

Let K be a convex subset of the state space of a finite-dimensional C*-algebra. We study the properties of channels on K, which are defined as affine maps from K into the state space of another algebra, extending to completely positive maps on the subspace generated by K. We show that each such map is the restriction of a completely positive map on the whole algebra, called a generalized channel. We characterize the set of generalized channels and also the equivalence classes of generalized channels having the same value on K. Moreover, if K contains the tracial state, the set of generalized channels forms again a convex subset of a multipartite state space, this leads to a definition of a generalized supermap, which is a generalized channel with respect to this subset. We prove a decomposition theorem for generalized supermaps and describe the equivalence classes. The set of generalized supermaps having the same value on equivalent generalized channels is also characterized. Special cases include quantum combs and process positive operator valued measures (POVMs).

arXiv:1105.1899•Journal of Mathematical Physics•Jan 1, 2012•34 citations

Concrete Quantum Channels and Algebraic Structure of Abstract Quantum Channels

M. N. N. Namboodiri

This article analyzes the algebraic structure of the set of all quantum channels and its subset consisting of quantum channels that have Holevo representation. The regularity of these semigroups under composition of mappings is analyzed. It is also known that these sets are compact convex sets and, therefore, rich in geometry. An attempt is made to identify generalized invertible channels and also the idempotent channels. When channels are of the Holevo type, these two problems are fully studied in this article. The motivation behind this study is its applicability to the reversibility of channel transformations and recent developments in resource-destroying channels, which are idempotents. This is related to the coding-encoding problem in quantum information theory. Several examples are provided, with the main examples coming from pre-conditioner maps which assign preconditioners to matrices in numerical linear algebra. Thus, the known pre-conditioner maps are viewed as quantum channels in finite dimensions. In addition, the infinite-dimensional analogue of preconditioners is introduced and certain limit theorems are discussed; this is with an aim to analyze asymptotic methods in quantum channels analogous to problems in asymptotic linear algebra.

arXiv:2305.11471•May 19, 2023•1 citation

On quantum channels: extreme points, topology, and categorical properties

J. M. S. T. da Silva

In this thesis, quantum channels are studied from the point of view of Mathematics. We studied the CPTP (completely positive trace preserving) and UCPTP channels, the latter being the unital channels. In both cases, the sets are compact convex, so they are the closure of their extreme points. We constructed extreme CPTP maps for every possible rank. We also constructed extreme UCPTP maps with rank 2 for each possible dimension. For ranks of at least 3, we constructed extreme UCPTP maps for many dimensions and ranks. We also proved that the tensor product of extreme CPTP maps is an extreme CPTP map. For UCPTP maps, we proved that the same is not always true, with many counterexamples. It is known that the category of CPTP maps is semicartesian. We add to this a classification of binary products. We proved that products only exist in trivial cases. For binary coproducts, we obtained the dimensions they should have, if they exist. In both cases, topological techniques were used. For this reason, we also investigated the topology of the closure of the set of extreme points of the CPTP maps. Topological invariants can be computed from decompositions of a space such as CW structures. These are a type of decomposition in which the space is expressed as a gluing of balls. In the search for a CW structure for the closure of the set of extreme CPTP maps, we obtained a partial decomposition that resembles a CW structure of the complex projective space.

math-phCross-listedarXiv:2608.20689•Aug 24, 2026•0 citations

Convex combinations of Pauli semigroups: Geometry, measure, and an application

Vinayak Jagadish, R. Srikanth, Francesco Petruccione

Finite-time Markovian channels, unlike their infinitesimal counterparts, do not form a convex set. As a particular instance of this observation, we consider the problem of mixing the three Pauli channels, conservatively assumed to be quantum dynamical semigroups, and fully characterize the resulting ``Pauli simplex.'' We show that neither the set of non-Markovian (completely positive indivisible) nor Markovian channels is convex in the Pauli simplex, and that the measure of non-Markovian channels is about 0.87. All channels in the Pauli simplex are P divisible. A potential application in the context of quantum resource theory is also discussed.

arXiv:1910.04114•Physical Review A•Jun 1, 2020•29 citations
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 structure of the closure of the analyzed group [Formula: see text] plays a pivotal role in this regard. The set of all convex combinations of the group elements contains a subset of channels that are accessible by a dynamical semigroup. We demonstrate that accessible channels are determined by probability vectors of weights of a convex combination of the group elements, which depend neither on the dimension of the space on which the channels act, nor on the specific representation of the group. Investigating geometric properties of the set [Formula: see text] of accessible maps we show that this set is nonconvex, but it enjoys the star-shape property with respect to the uniform mixture of all elements of the group. We demonstrate that the set [Formula: see text] covers a positive volume in the polytope of all convex combinations of the elements of the group.
We analyze the set ANQ of mixed unitary channels represented in the Weyl basis and accessible by a Lindblad semigroup acting on an N-level quantum system. General necessary and sufficient conditions for a mixed Weyl quantum channel of an arbitrary dimension to be accessible by a semigroup are established. The set ANQ is shown to be log-convex and star-shaped with respect to the completely depolarizing channel. A decoherence supermap acting in the space of Lindblad operators transforms them into the space of Kolmogorov generators of classical semigroups. We show that for mixed Weyl channels, the super-decoherence commutes with the dynamics so that decohering a quantum accessible channel, we obtain a bistochastic matrix from the set ANC of classical maps accessible by a semigroup. Focusing on three-level systems, we investigate the geometry of the sets of quantum accessible maps, its classical counterpart, and the support of their spectra. We demonstrate that the set A3Q is not included in the set U3Q of quantum unistochastic channels, although an analogous relation holds for N = 2. The set of transition matrices obtained by super-decoherence of unistochastic channels of order N ≥ 3 is shown to be larger than the set of unistochastic matrices of this order and yields a motivation to introduce the larger sets of k-unistochastic matrices.
We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k -entangled states are also considered as examples of our techniques.
Let K be a convex subset of the state space of a finite-dimensional C*-algebra. We study the properties of channels on K, which are defined as affine maps from K into the state space of another algebra, extending to completely positive maps on the subspace generated by K. We show that each such map is the restriction of a completely positive map on the whole algebra, called a generalized channel. We characterize the set of generalized channels and also the equivalence classes of generalized channels having the same value on K. Moreover, if K contains the tracial state, the set of generalized channels forms again a convex subset of a multipartite state space, this leads to a definition of a generalized supermap, which is a generalized channel with respect to this subset. We prove a decomposition theorem for generalized supermaps and describe the equivalence classes. The set of generalized supermaps having the same value on equivalent generalized channels is also characterized. Special cases include quantum combs and process positive operator valued measures (POVMs).
This article analyzes the algebraic structure of the set of all quantum channels and its subset consisting of quantum channels that have Holevo representation. The regularity of these semigroups under composition of mappings is analyzed. It is also known that these sets are compact convex sets and, therefore, rich in geometry. An attempt is made to identify generalized invertible channels and also the idempotent channels. When channels are of the Holevo type, these two problems are fully studied in this article. The motivation behind this study is its applicability to the reversibility of channel transformations and recent developments in resource-destroying channels, which are idempotents. This is related to the coding-encoding problem in quantum information theory. Several examples are provided, with the main examples coming from pre-conditioner maps which assign preconditioners to matrices in numerical linear algebra. Thus, the known pre-conditioner maps are viewed as quantum channels in finite dimensions. In addition, the infinite-dimensional analogue of preconditioners is introduced and certain limit theorems are discussed; this is with an aim to analyze asymptotic methods in quantum channels analogous to problems in asymptotic linear algebra.
In this thesis, quantum channels are studied from the point of view of Mathematics. We studied the CPTP (completely positive trace preserving) and UCPTP channels, the latter being the unital channels. In both cases, the sets are compact convex, so they are the closure of their extreme points. We constructed extreme CPTP maps for every possible rank. We also constructed extreme UCPTP maps with rank 2 for each possible dimension. For ranks of at least 3, we constructed extreme UCPTP maps for many dimensions and ranks. We also proved that the tensor product of extreme CPTP maps is an extreme CPTP map. For UCPTP maps, we proved that the same is not always true, with many counterexamples. It is known that the category of CPTP maps is semicartesian. We add to this a classification of binary products. We proved that products only exist in trivial cases. For binary coproducts, we obtained the dimensions they should have, if they exist. In both cases, topological techniques were used. For this reason, we also investigated the topology of the closure of the set of extreme points of the CPTP maps. Topological invariants can be computed from decompositions of a space such as CW structures. These are a type of decomposition in which the space is expressed as a gluing of balls. In the search for a CW structure for the closure of the set of extreme CPTP maps, we obtained a partial decomposition that resembles a CW structure of the complex projective space.
Finite-time Markovian channels, unlike their infinitesimal counterparts, do not form a convex set. As a particular instance of this observation, we consider the problem of mixing the three Pauli channels, conservatively assumed to be quantum dynamical semigroups, and fully characterize the resulting ``Pauli simplex.'' We show that neither the set of non-Markovian (completely positive indivisible) nor Markovian channels is convex in the Pauli simplex, and that the measure of non-Markovian channels is about 0.87. All channels in the Pauli simplex are P divisible. A potential application in the context of quantum resource theory is also discussed.