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

Physical Review A

One-to-one parametrization of quantum channels

Akio Fujiwara, P. Algoet

Published May 1, 1999• 156 citations
Publisher

Abstract

In contrast to the many-to-one and quadratic nature of correspondence in the conventional representation of quantum channels, such as the operator-sum or the unitary representation, we present a one-to-one and linear (affine) parametrization of quantum channels. This parametrization enables us to visualize the convex structure of the space of quantum channels. To demonstrate its usefulness, we apply it to the analysis of quantum binary channels.

DOI
10.1103/physreva.59.3290

Related papers

Affine Parametrization of Quantum Channels

Akio Fujiwara, P. Algoet

We establish a one-one affine parametrization of all completely positive maps on a matrix algebra that map the identity matrix to a given positive matrix. The parametrization is applied to the analysis of quantum binary channels.

•Jan 1, 1998•0 citations

Lattice structures for quantum channels

T. Constantinescu

We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is quite intricate, it admits a simple, lattice structure representation.

arXiv:math/0102138•Feb 17, 2001•0 citations

Optimal convex approximation of quantum channels based on $α$-affinity

Liqiang Zhang, Chengling Fu, Liuyong Cheng +2 more

Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum $α$-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.

quant-pharXiv:2606.05745•Jun 5, 2026•0 citations

Affine parameterization of quantum channels

Akio Fujiwara, P. Algoet

We establish a one-one affine parameterization of all completely positive maps on a matrix algebra that maps the identity matrix to a given positive matrix. The parameterization is applied to the analysis of quantum binary channels.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•1 citation

Representations of Quantum Channels

Tanner Crowder

The Bloch representation of an n-qubit channel provides a way to represent quantum channels as certain affine transformations on [special characters omitted]. In higher dimensions (n > 1), the correspondence between quantum channels and their Bloch representations is not well-understood. Partly motivated by the ability to simplify the calculation of information theoretic quantities of a qubit channel using the Bloch representation, in this thesis we investigate the correspondence between a channel and its Bloch representation with an emphasis on unital n-qubit channels, in which case the Bloch representation is linear. The thesis is divided into three main sections. First we focus our attention on qubit channels. For certain sets of quantum channels, we establish the surprising existence of a special isomorphism into the set of classical channels. We classify the sets of qubit channels with this property and show that information theoretic quantities are preserved by such classical representations. In a natural progression, we prove some well-known facts about SO(3), the proofs of which are either nonexistent or difficult to find in the literature. Some of this work is based on [12, 13]. In the next section, we consider the multi-qubit channels and show that every finite group can be realized as a subgroup of the quantum channels; this approach allows for the construction of a quantum representation for the free affine monoid over any finite group and gives a classical representation for it. We extend some fundamental results from [26, 28] to the multi-qubit case, including that the set of diagonal Bloch matrices is equal to the free affine monoid over the involution group [special characters omitted]. Some of this work appeared in [10]. Lastly, we study the extreme points for the set of n-qubit channels. There are two types of extreme points: invertible and non-invertible; invertible channels are non-singular maps for which the inverse is also a channel. We briefly study the non-invertible extreme points and then parameterize and analyze the invertiblen-qubit Bloch matrices, which form a compact connected Lie group. We calculate the Lie algebra and give an explicit generating set for the invertible Bloch matrices and a maximal torus.

•Jan 1, 2013•5 citations

On the convex characterisation of the set of unital quantum channels

Constantino Rodriguez-Ramos, Colin Wilmott

Abstract In this paper, we consider the convex structure of the set of unital quantum channels. To do this, we introduce a novel framework to construct and characterise different families of low-rank unital quantum maps. In this framework, unital quantum maps are represented as a set of complex parameters on which we impose a set of constraints. The different families of unital maps are obtained by mapping those parameters into the operator representation of a quantum map. For these families, we also introduce a scalar measuring their distance to the set of mixed-unitary maps. We consider the particular case of qutrit channels which is the smallest set of maps for which the existence of non-unitary extremal maps is known. In this setting, we show how our framework generalises the description of well-known maps such as the antisymmetric Werner–Holevo map but also novel families of qutrit maps.

arXiv:2111.13705•Journal of Physics A Mathematical and Theoretical•Sep 27, 2023•3 citations
In contrast to the many-to-one and quadratic nature of correspondence in the conventional representation of quantum channels, such as the operator-sum or the unitary representation, we present a one-to-one and linear (affine) parametrization of quantum channels. This parametrization enables us to visualize the convex structure of the space of quantum channels. To demonstrate its usefulness, we apply it to the analysis of quantum binary channels.
Optimal convex approximation of quantum channels based on ααα-affinity
Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum ααα-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.
The Bloch representation of an n-qubit channel provides a way to represent quantum channels as certain affine transformations on [special characters omitted]. In higher dimensions (n > 1), the correspondence between quantum channels and their Bloch representations is not well-understood. Partly motivated by the ability to simplify the calculation of information theoretic quantities of a qubit channel using the Bloch representation, in this thesis we investigate the correspondence between a channel and its Bloch representation with an emphasis on unital n-qubit channels, in which case the Bloch representation is linear. The thesis is divided into three main sections. First we focus our attention on qubit channels. For certain sets of quantum channels, we establish the surprising existence of a special isomorphism into the set of classical channels. We classify the sets of qubit channels with this property and show that information theoretic quantities are preserved by such classical representations. In a natural progression, we prove some well-known facts about SO(3), the proofs of which are either nonexistent or difficult to find in the literature. Some of this work is based on [12, 13]. In the next section, we consider the multi-qubit channels and show that every finite group can be realized as a subgroup of the quantum channels; this approach allows for the construction of a quantum representation for the free affine monoid over any finite group and gives a classical representation for it. We extend some fundamental results from [26, 28] to the multi-qubit case, including that the set of diagonal Bloch matrices is equal to the free affine monoid over the involution group [special characters omitted]. Some of this work appeared in [10]. Lastly, we study the extreme points for the set of n-qubit channels. There are two types of extreme points: invertible and non-invertible; invertible channels are non-singular maps for which the inverse is also a channel. We briefly study the non-invertible extreme points and then parameterize and analyze the invertiblen-qubit Bloch matrices, which form a compact connected Lie group. We calculate the Lie algebra and give an explicit generating set for the invertible Bloch matrices and a maximal torus.
Abstract In this paper, we consider the convex structure of the set of unital quantum channels. To do this, we introduce a novel framework to construct and characterise different families of low-rank unital quantum maps. In this framework, unital quantum maps are represented as a set of complex parameters on which we impose a set of constraints. The different families of unital maps are obtained by mapping those parameters into the operator representation of a quantum map. For these families, we also introduce a scalar measuring their distance to the set of mixed-unitary maps. We consider the particular case of qutrit channels which is the smallest set of maps for which the existence of non-unitary extremal maps is known. In this setting, we show how our framework generalises the description of well-known maps such as the antisymmetric Werner–Holevo map but also novel families of qutrit maps.