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.
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.
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.
We investigate the semigroup structure of bosonic Gaussian quantum channels. Particular focus lies on the sets of channels which are divisible, idempotent or Markovian (in the sense of either belonging to one-parameter semigroups or being infinitesimal divisible). We show that the non-compactness of the set of Gaussian channels allows for remarkable differences when comparing the semigroup structure with that of finite dimensional quantum channels. For instance, every irreversible Gaussian channel is shown to be divisible in spite of the existence of Gaussian channels which are not infinitesimal divisible. A simpler and known consequence of non-compactness is the lack of generators for certain reversible channels. Along the way we provide new representations for classes of Gaussian channels: as matrix semigroup, complex valued positive matrices or in terms of a simple form describing almost all one-parameter semigroups.
We present a new application of harmonic analysis to quantum information by constructing intriguing classes of quantum channels stemming from specific representations of multiplier algebras over locally compact groups G . Beginning with a representation of the measure algebra M ( G ), we unify and elaborate on recent counter-examples to a conjecture on the structure of fixed point subalgebras in infinite dimensions, as well as present an application to the noiseless subsystems method of quantum error correction. Using a representation of the completely bounded Fourier multiplier algebra M cb A ( G ), we provide a new class of counter-examples to the recently solved asymptotic quantum Birkhoff conjecture, along with a systematic method of producing the examples using a geometric representation of Schur maps. Further properties of our channels including duality, quantum capacity, and entanglement preservation are discussed along with potential applications to additivity conjectures.
In the study of d-dimensional quantum channels (d⩾2), an assumption which includes many interesting examples, and which has a natural physical interpretation, is that the corresponding Kraus operators form a representation of a Lie algebra. Physically, this is a symmetry algebra for the interaction Hamiltonian. This paper begins a systematic study of channels defined by representations; the famous Werner-Holevo channel is one element of this infinite class. We show that the channel derived from the defining representation of su(n) is a depolarizing channel for all n, but for most other representations this is not the case. Since the standard Bloch sphere only exists for the qubit representation of su(2), we develop a consistent generalization of Bloch’s technique. By representing the density matrix as a polynomial in Lie algebra generators, we determine a class of positive semidefinite matrices which represent quantum states for various channels defined by finite-dimensional representations of semisimple Lie algebras. We also give a general method for finding positive semidefinite matrices using Lie algebraic trace identities. This includes an analysis of channels based on the exceptional Lie algebra g2 and the Clifford algebra.
In this dissertation, we investigate algebraic structures in finite-dimensional Hilbert spaces, as concerns quantum computation and quantum information, as well as these structures' applications to lattices. On the quantum computation side, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies these axioms. Subsequently, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, using the algebraic framework developed. We build our graphical calculus out of a fixed set of graphical primitives defined by algebraic expressions constructed out of elements of a given generalized Clifford algebra, a graphical primitive corresponding to the ground state, and also graphical primitives corresponding to projections onto the ground state of each qudit. We establish many algebraic identities, including a novel algebraic proof of a Yang-Baxter equation. We also derive a new identity for the braid elements, which is key to our proofs. We then use the Yang-Baxter equation proof to resolve an open question of Cobanera and Ortiz. We demonstrate that in many cases, the verification of involved vector identities can be reduced to the combinatorial application of two basic vector identities. In addition, we show how to explicitly compute various vector states in an efficient manner using algebraic methods. On the quantum information side, we introduce a new decomposition of quantum channels acting on group algebras, which we term Kraus-like operator decompositions (Kraus-like decompositions for short). An important motivation for this new decomposition is a general nonexistence result that we show for Kraus operator decompositions for quantum channels in this setting. We show that the notion of convex Kraus-like operator decompositions (in which the coefficients in the sum decomposition are nonnegative and satisfy a sum rule) that are induced by the irreducible characters of a finite group is equivalent to the notion of a conditionally negative-definite length when the length is a class function. For a general finite group G, we prove a stability condition which shows that if the semigroup associated with a length has a convex Kraus-like operator decomposition for all t>0 small enough, then it has a convex Kraus-like operator decomposition for all time t>0. Using the stability condition, we show that for a general finite group, conditional negativity of the length function is equivalent to a set of semidefinite linear constraints on the length function. By a result of Schoenberg, our result implies that in the group algebra setting, a semigroup P_t induced by a length function which is a class function is a quantum channel for all t greater than or equal to 0 if and only if it possesses a convex Kraus-like operator decomposition for all t>0. Finally, motivated by the importance of lattice problems in quantum cryptography, we extend the algebraic framework for multi-qudit representations of generalized Clifford algebras to d-dimensional lattices mod P. We show that under suitable number-theoretic conditions, the subalgebra induced by a lattice has trivial center. Under the trivial center constraint, we construct for pairs of lattice vectors satisfying an algebraic constraint a unitary operator based on the product of generalized Clifford algebra generators associated to each lattice vector.
This paper is devoted to further study of the Holevo capacity of infinite-dimensional quantum channels. The existence of a unique optimal average state for a quantum channel constrained by an arbitrary convex set of states is shown. The minimax expression for the Holevo capacity of a constrained channel is obtained. The χ-function and the convex closure of the output entropy of an infinite-dimensional quantum channel are considered. It is shown that the χ-function of an arbitrary channel is lower semicontinuous on the set of all states and has continuous restrictions to subsets of states with continuous output entropy. The explicit expression for the convex closure of the output entropy of an infinite-dimensional quantum channel is obtained and its properties are explored. It is shown that the convex closure of the output entropy coincides with the convex hull of the output entropy on the set of states with finite output entropy and, similarly to the χ-function, it has continuous restrictions to subsets of states with continuous output entropy. The applications of the obtained results to the theory of entanglement are considered. The properties of the convex closure of the output entropy make it possible to generalize some results related to the additivity problem to the infinite-dimensional case.