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

Linear Algebra and its Applications

On Birkhoff's theorem for doubly stochastic completely positive maps of matrix algebras

Larry Landau, R. F. Streater

Published Nov 1, 1993• 178 citations
Publisher
DOI
10.1016/0024-3795(93)90274-r

Related papers

Comparison of completely positive maps on a C* algebra and a Lebesgue decomposition theorem

Kalyanapuram Rangachari Parthasarathy

Lecture notes in statistics•Jan 1, 1996•9 citations

A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem

Ian T. Durham

Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace and the identity. We expect these channels to be convex combinations of unitary channels and yet it is known that some channels cannot be written that way. Recent work has suggested that $n$ copies of a single channel might approximate a mixture (convex combination) of unitaries. In this paper we show that $n(n+1)/2$ copies of a symmetric unital quantum channel may be arbitrarily-well approximated by a mixture (convex combination) of unitarily implemented channels. In addition, we prove that any extremal properties of a channel are preserved over $n$ (and thus $n(n+1)/2$) copies. The result has the potential to be completely generalized to include non-symmetric channels.

arXiv:0905.4760•May 28, 2009•0 citations

Schoenberg correspondence for k-(super)positive maps on matrix algebras

B. V. Rajarama Bhat, Purbayan Chakraborty, Uwe Franz

arXiv:2301.10679•Positivity•Aug 3, 2023•2 citations

A problem relating to positive linear maps on matrix algebras

Peter M. Alberti, Armin Uhlmann

Reports on Mathematical Physics•Oct 1, 1980•71 citations

Birkhoff-von Neumann Teoremi bağlamında kuantum sihirli kareler

Sunay Doğan

Quantum magic squares are generalizations of doubly stochastic matrices to arbitrary, possibly non-commutative algebras, more specifically C∗-algebras. Birkhoff-von Neumann Theorem states that every doubly stochastic matrix is a convex combination of permutation matrices. One inevitable question is whether a quantum magic square is a convex combinations of quantum permutation matrices. It has been proven by Cuevas, Drescher, and Netzer that the generalization of the Birkhoff-von Neumann Theorem in the quantum setting is not true in general. A quantum magic square is a convex combination of Arveson extreme points but not necessarily a convex combination of quantum permutation matrices. Additionally, the relationships between different subsets of quantum magic squares, including their inclusion properties, have been studied in this context.

•Sep 18, 2024•0 citations

Extreme Points of the Convex set of Stochastic Maps on A C*-Algebra

Kalyanapuram Rangachari Parthasarathy

Let [Formula: see text] be a unital C*-subalgebra of the C*-algebra ℬ(ℋ) of all bounded operators on a complex separable Hilbert space ℋ. Let [Formula: see text] denote the convex set of all unital, linear, completely positive and normal maps of [Formula: see text] into itself. Using Stinespring's theorem, we present a criterion for an element [Formula: see text] to be extremal. When [Formula: see text], this criterion leads to an explicit description of the set of all extreme points of [Formula: see text]. We also obtain a quantum probabilistic analogue of the classical Birkhoff's theorem2 that every bistochastic matrix can be expressed as a convex combination of permutation matrices.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Oct 1, 1998•4 citations
Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace and the identity. We expect these channels to be convex combinations of unitary channels and yet it is known that some channels cannot be written that way. Recent work has suggested that nnn copies of a single channel might approximate a mixture (convex combination) of unitaries. In this paper we show that n(n+1)/2n(n+1)/2n(n+1)/2 copies of a symmetric unital quantum channel may be arbitrarily-well approximated by a mixture (convex combination) of unitarily implemented channels. In addition, we prove that any extremal properties of a channel are preserved over nnn (and thus n(n+1)/2n(n+1)/2n(n+1)/2) copies. The result has the potential to be completely generalized to include non-symmetric channels.
Quantum magic squares are generalizations of doubly stochastic matrices to arbitrary, possibly non-commutative algebras, more specifically C∗-algebras. Birkhoff-von Neumann Theorem states that every doubly stochastic matrix is a convex combination of permutation matrices. One inevitable question is whether a quantum magic square is a convex combinations of quantum permutation matrices. It has been proven by Cuevas, Drescher, and Netzer that the generalization of the Birkhoff-von Neumann Theorem in the quantum setting is not true in general. A quantum magic square is a convex combination of Arveson extreme points but not necessarily a convex combination of quantum permutation matrices. Additionally, the relationships between different subsets of quantum magic squares, including their inclusion properties, have been studied in this context.
Let [Formula: see text] be a unital C*-subalgebra of the C*-algebra ℬ(ℋ) of all bounded operators on a complex separable Hilbert space ℋ. Let [Formula: see text] denote the convex set of all unital, linear, completely positive and normal maps of [Formula: see text] into itself. Using Stinespring's theorem, we present a criterion for an element [Formula: see text] to be extremal. When [Formula: see text], this criterion leads to an explicit description of the set of all extreme points of [Formula: see text]. We also obtain a quantum probabilistic analogue of the classical Birkhoff's theorem2 that every bistochastic matrix can be expressed as a convex combination of permutation matrices.