Quantum measurements can be interpreted as a generalization of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalization of doubly stochastic matrices that we call doubly normalized tensors (DNTs), and investigate a corresponding version of Birkhoff–von Neumann's theorem, which states that permutations are the extremal points of the set of doubly stochastic matrices. We prove that joint measurability appears naturally as a mathematical feature of DNTs in this context and that this feature is necessary and sufficient for a characterization similar to Birkhoff–von Neumann's. Conversely, we also show that DNTs arise from a particular instance of a joint measurability problem, remarking the relevance of this quantum-theoretical property in general operator theory.
Quantum measurements can be interpreted as a generalization of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalization of doubly stochastic matrices that we call doubly normalized tensors (DNTs), and investigate a corresponding version of Birkhoff–von Neumann's theorem, which states that permutations are the extremal points of the set of doubly stochastic matrices. We prove that joint measurability appears naturally as a mathematical feature of DNTs in this context and that this feature is necessary and sufficient for a characterization similar to Birkhoff–von Neumann's. Conversely, we also show that DNTs arise from a particular instance of a joint measurability problem, remarking the relevance of this quantum-theoretical property in general operator theory.
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.
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.
The POVM measurement assemblage consisting of a set of positive operator-value measurements (POVMs) is an important tool for describing and studying the non-locality, quantum steering and quantum correlation of composite quantum systems. In this paper, we first introduce the definition of joint measurability of the POVM measurement assemblage MS consisting of a finite number of POVMs and then prove that the joint measurability of MS is equivalent to its compatibility. We give a general form of a POVM measurement which is jointly measurable with the one-rank projection measurement. It is proved that the POVM measurement assemblage MS is jointly measurable if and only if the corresponding “row stochastic operator matrix" MS composed of MS can be expressed as an “operator convex combination" of {0,IS}—the row stochastic operator matrices. In particular, it is proved that the POVM measurement assemblage M(n0,n1) induced by two three-dimensional real unit vectors ni(i=0,1) is jointly measurable if and only if n0=±n1. As an application, we obtain a necessary and sufficient condition under which a two-qubit quantum state is unsteerable with M(n0,n1).
Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff–von Neumann theorem characterizes magic squares as convex combinations of permutation matrices. In the non-commutative case, the corresponding question is as follows: Does every quantum magic square belong to the matrix convex hull of quantum permutation matrices? That is, does every quantum magic square dilate to a quantum permutation matrix? Here, we show that this is false even in the simplest non-commutative case. We also classify the quantum magic squares that dilate to a quantum permutation matrix with commuting entries and prove a quantitative lower bound on the diameter of this set. Finally, we conclude that not all Arveson extreme points of the free spectrahedron of quantum magic squares are quantum permutation matrices.
Abstract The entropy principle asserts that spontaneous processes drive systems toward states of higher disorder. Operational origin of such randomness is a question of utmost importance. The seminal Birkhoff theorem (also known as Birkhoff-von Neumann theorem) identifies doubly stochastic transformations as convex mixtures of reversible transformations, thereby providing an epistemic account of disorder. Quantum theory, however, does not satisfy this equivalence in general. In this work, we investigate this question within the framework of generalized probabilistic theories (GPTs). We prove a violation of the Birkhoff theorem in the square-bit model, a canonical non-quantum GPT, and further show that this violation persists asymptotically under tensor products of any finite, yet arbitrarily large, number of copies of even-polygon models. This provides evidence that the failure of the Birkhoff theorem is an intrinsic operational feature of a wide class of GPTs, rather than a peculiarity of quantum theory. Furthermore, we show that, beyond quantum theory, the preorder over states induced by mixtures of reversible transformations can differ from that induced by doubly stochastic transformations, leading to inequivalent notions of state convertibility and distinct resource theories of purity. Beyond its foundational significance, we show that the violation of the Birkhoff theorem admits a concrete operational interpretation: in the square-bit theory, it serves as a genuine resource for enhancing the performance of Random Access Codes. Finally, we discuss the construction of entropy functions in GPTs that remain consistent with thermodynamic principles, in the spirit of von Neumann’s formulation.
Chapter 1: On the existence of quantum representations for two dichotomic measurements. Under which conditions do outcome probabilities of measurements possess a quantum-mechanical model? This kind of problem is solved here for the case of two dichotomic von Neumann measurements which can be applied repeatedly to a quantum system with trivial dynamics. The solution uses methods from the theory of operator algebras and the theory of moment problems. The ensuing conditions reveal surprisingly simple relations between certain quantum-mechanical probabilities. It also shown that generally, none of these relations holds in general probabilistic models. This result might facilitate further experimental discrimination between quantum mechanics and other general probabilistic theories. Chapter 2: Possibilistic Physics. I try to outline a framework for fundamental physics where the concept of probability gets replaced by the concept of possibility. Whereas a probabilistic theory assigns a state-dependent probability value to each outcome of each measurement, a possibilistic theory merely assigns one of the state-dependent labels "possible to occur" or "impossible to occur" to each outcome of each measurement. It is argued that Spekkens' combinatorial toy theory of quantum mechanics is inconsistent in a probabilistic framework, but can be regarded as possibilistic. Then, I introduce the concept of possibilistic local hidden variable models and derive a class of possibilistic Bell inequalities which are violated for the possibilistic Popescu-Rohrlich boxes. The chapter ends with a philosophical discussion on possibilistic vs. probabilistic. It can be argued that, due to better falsifiability properties, a possibilistic theory has higher predictive power than a probabilistic one. Chapter 3: The quantum region for von Neumann measurements with postselection. It is determined under which conditions a probability distribution on a finite set can occur as the outcome distribution of a quantum-mechanical von Neumann measurement with hyphenation given that the scalar product between the initial and the final state is known as well as the success probability of the postselection. An intermediate von Neumann measurement can enhance transition probabilities between states such that the error probability shrinks by a factor of up to 2. Chapter 4: A presentation of the category of stochastic matrices. This chapter gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices). Chapter 5: Convex Spaces: Definition and Examples. We try to promote convex spaces as an abstract concept of convexity which was introduced by Stone as "barycentric calculus''. A convex space is a set where one can take convex combinations in a consistent way. By identifying the corresponding Lawvere theory as the category from chapter 4 and using the results obtained there, we give a different proof of a result of Swirszcz which shows that convex spaces can be identified with algebras of a finitary version of the Giry monad. After giving an extensive list of examples of convex sets as they appear throughout mathematics and theoretical physics, we note that there also exist convex spaces that cannot be embedded into a vector space: semilattices are a class of examples of purely combinatorial type. In an information-theoretic interpretation, convex subsets of vector spaces are probabilistic, while semilattices are possibilistic. Convex spaces unify these two concepts.