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:1510.01040 · International Journal of Quantum Information

Convex decomposition of dimension-altering quantum channels

Dongsheng Wang

Published Nov 17, 2016• 7 citations
arXivHTMLPDF

Abstract

Quantum channels, which are completely positive and trace preserving mappings, can alter the dimension of a system, e.g. a quantum channel from a qubit to a qutrit. We study the convex set properties of dimension-altering quantum channels, and particularly the channel decomposition problem in terms of convex sum of extreme channels. We provide various quantum circuit representations of extreme and generalized extreme channels, which can be employed in an optimization to approximately decompose an arbitrary channel. Numerical simulations of low-dimensional channels are performed to demonstrate our channel decomposition scheme.

DOI
10.1142/s0219749916500453

Related papers

Extremal Channels for a genaral Quantum system

Kuldeep Dixit, E. C. G. Sudarshan

Quantum channels can be mathematically represented as completely positive trace-preserving maps that act on a density matrix. A general quantum channel can be written as a convex sum of `extremal' channels. We show that for an $N$-level system, the extremal channel can be characterized in terms of $N^2$-$N$ real parameters coupled with rotations. We give a representation for $N$= 2, 3, 4.

arXiv:0909.3744•Sep 21, 2009•0 citations

Algorithmic Quantum Channel Simulation

Dongsheng Wang

Quantum simulation, which is generically the task to employ quantum computers to simulate quantum physical models, has been one of the most significant motivations of quantum computing. Quantum dynamics, unitary or nonunitary Markovian dynamics driven by local interactions, has been proved to be efficiently simulatable on quantum computers. Extending the underlying models from unitary to nonunitary evolution, and from continuous-time to discrete-time evolution is essential not only for quantum simulation of more general processes, e.g., dissipative processes with evident non-Markovian effects, but also for developing alternative quantum computing models and algorithms. In this thesis, we explore quantum simulation problems mainly from the following three themes. First, we extend quantum simulation framework of Hamiltonian-driven evolution to quantum simulation of quantum channels, combined with the scheme of algorithmic simulation that accepts a promised simulation accuracy, hence algorithmic quantum channel simulation. Our simulation scheme contains a classical preprocessing part, i.e. a classical algorithm for quantum-circuit design, and a quantum part that is the execution of a quantum circuit for the quantum channel simulator. Second, we employ simulation algorithms for arbitrary quantum channels beyond the dilation method. We explore channel decomposition in terms of convex combination of smaller channels, known as generalized extreme channels, which is known as a nontrivial open problem. To attack this problem, we develop an optimization algorithm for approximate decomposition into a convex sum of generalized extreme channels. We provide an ansatz that proves to be able to yield arbitrary generalized extreme channels and allows a precise quantum circuit description. Furthermore, our numerical simulation has demonstrated the validity of our optimization algorithm for low-dimensional quantum channels. Third, by considering quantum simulation problems beyond the rough distinction between digital and analog simulations, and beyond the quantum-state generation problem, we define uniform, strong, and weak quantum simulations from the point view of operator topology. Besides strong simulation of quantum channels, we define a general weak quantum simulation problem, which simulates observable effects instead of the effects on state generation. Also we study the channel simulation problem in the quantum query model, and provide the query complexity by employing uniform quantum simulation method.

•Jan 1, 2015•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

On the extreme points of quantum channels

Shmuel Friedland, Raphael Loewy

Let Lm,n denote the convex set of completely positive trace preserving operators from Cm×m to Cn×n, i.e. quantum channels. We give a necessary condition for L∈Lm,n to be an extreme point. We show that generically, this condition is also sufficient. We characterize completely the extreme points of L2,2 and L3,2, i.e. quantum channels from qubits to qubits and from qutrits to qubits.

•Jan 1, 2013•13 citations

On Faces of the set of Quantum Channels

Raphael Loewy

A linear map $L$ from ${\mathbb C}^{n \times n}$ into ${\mathbb C}^{n \times n}$ is called a quantum channel if it is completely positive and trace preserving. The set ${\cal L}_n$ of all such quantum channels is known to be a compact convex set. While the extreme points of ${\cal L}_n$ can be characterized, not much is known about the structure of its higher dimensional faces. Using the so called Choi matrix $Z(L)$ associated with the quantum channel $L$, we compute the maximum dimension of a proper face of ${\cal L}_n$, and in addition the possible dimensions of faces generated by $L$ when $rank \ Z(L)=2 $.

arXiv:1609.05890•Sep 18, 2016•0 citations

On approximation of infinite-dimensional quantum channels

Максим Евгеньевич Широков, Alexander Semenovich Holevo

We develop an approximation approach to infinite-dimensional quantum channels based on a detailed investigation of continuity properties of entropic characteristics of quantum channels and operations (trace-nonincreasing completely positive maps) as functions of a pair “channel, input state.” Obtained results are then applied to the problems of continuity of the χ -capacity as a function of a channel, strong additivity of the χ -capacity for infinite-dimensional channels, and approximating representation for the convex closure of the output entropy of an arbitrary quantum channel.

Problems of Information Transmission•Jun 1, 2008•42 citations
Quantum channels, which are completely positive and trace preserving mappings, can alter the dimension of a system, e.g. a quantum channel from a qubit to a qutrit. We study the convex set properties of dimension-altering quantum channels, and particularly the channel decomposition problem in terms of convex sum of extreme channels. We provide various quantum circuit representations of extreme and generalized extreme channels, which can be employed in an optimization to approximately decompose an arbitrary channel. Numerical simulations of low-dimensional channels are performed to demonstrate our channel decomposition scheme.
Quantum channels can be mathematically represented as completely positive trace-preserving maps that act on a density matrix. A general quantum channel can be written as a convex sum of `extremal' channels. We show that for an NNN-level system, the extremal channel can be characterized in terms of N2N^2N2-NNN real parameters coupled with rotations. We give a representation for NNN= 2, 3, 4.
Quantum simulation, which is generically the task to employ quantum computers to simulate quantum physical models, has been one of the most significant motivations of quantum computing. Quantum dynamics, unitary or nonunitary Markovian dynamics driven by local interactions, has been proved to be efficiently simulatable on quantum computers. Extending the underlying models from unitary to nonunitary evolution, and from continuous-time to discrete-time evolution is essential not only for quantum simulation of more general processes, e.g., dissipative processes with evident non-Markovian effects, but also for developing alternative quantum computing models and algorithms. In this thesis, we explore quantum simulation problems mainly from the following three themes. First, we extend quantum simulation framework of Hamiltonian-driven evolution to quantum simulation of quantum channels, combined with the scheme of algorithmic simulation that accepts a promised simulation accuracy, hence algorithmic quantum channel simulation. Our simulation scheme contains a classical preprocessing part, i.e. a classical algorithm for quantum-circuit design, and a quantum part that is the execution of a quantum circuit for the quantum channel simulator. Second, we employ simulation algorithms for arbitrary quantum channels beyond the dilation method. We explore channel decomposition in terms of convex combination of smaller channels, known as generalized extreme channels, which is known as a nontrivial open problem. To attack this problem, we develop an optimization algorithm for approximate decomposition into a convex sum of generalized extreme channels. We provide an ansatz that proves to be able to yield arbitrary generalized extreme channels and allows a precise quantum circuit description. Furthermore, our numerical simulation has demonstrated the validity of our optimization algorithm for low-dimensional quantum channels. Third, by considering quantum simulation problems beyond the rough distinction between digital and analog simulations, and beyond the quantum-state generation problem, we define uniform, strong, and weak quantum simulations from the point view of operator topology. Besides strong simulation of quantum channels, we define a general weak quantum simulation problem, which simulates observable effects instead of the effects on state generation. Also we study the channel simulation problem in the quantum query model, and provide the query complexity by employing uniform quantum simulation method.
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.
A linear map LLL from Cn×n{\mathbb C}^{n \times n}Cn×n into Cn×n{\mathbb C}^{n \times n}Cn×n is called a quantum channel if it is completely positive and trace preserving. The set Ln{\cal L}_nLn​ of all such quantum channels is known to be a compact convex set. While the extreme points of Ln{\cal L}_nLn​ can be characterized, not much is known about the structure of its higher dimensional faces. Using the so called Choi matrix Z(L)Z(L)Z(L) associated with the quantum channel LLL, we compute the maximum dimension of a proper face of Ln{\cal L}_nLn​, and in addition the possible dimensions of faces generated by LLL when $rank \ Z(L)=2 $.
We develop an approximation approach to infinite-dimensional quantum channels based on a detailed investigation of continuity properties of entropic characteristics of quantum channels and operations (trace-nonincreasing completely positive maps) as functions of a pair “channel, input state.” Obtained results are then applied to the problems of continuity of the χ -capacity as a function of a channel, strong additivity of the χ -capacity for infinite-dimensional channels, and approximating representation for the convex closure of the output entropy of an arbitrary quantum channel.