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

WORLD SCIENTIFIC eBooks

Applications of Unitary Symmetry and Combinatorics

James D. Louck

Published May 1, 2011• 3 citations
Publisher

Abstract

Composite Quantum Systems Algebra of Permutation Matrices Coordinates of A in a Basis Applications of Permutation Matrices Doubly Stochastic Matrices in AMT Magic Squares Alternating Sign Matrices The Heisenberg Magnetic Ring.
DOI
10.1142/8161

Related papers

Applications of Unitary Symmetry and Combinatorics

James D. Louck

This monograph is a synthesis of the theory of the pairwise coupling of the angular momenta of arbitrarily many independent systems to the total angular momentum in which the universal role of doubly stochastic matrices and their quantum-mechanical probabilistic interpretation is a major theme. A uniform viewpoint is presented based on the structure of binary trees. This includes a systematic method for the evaluation of all 3n-j coefficients and their relationship to cubic graphs. A number of topical subjects that emerge naturally are also developed, such as the algebra of permutation matrice

WORLD SCIENTIFIC eBooks•Jan 1, 2011•1 citation

Combinatorics of Alternating Sign Matrices in Quantum Integrable Systems

Thalia Greinke

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

Quantum Permutation Matrices

Moritz Weber

Abstract Quantum permutations arise in many aspects of modern “quantum mathematics”. However, the aim of this article is to detach these objects from their context and to give a friendly introduction purely within operator theory. We define quantum permutation matrices as matrices whose entries are operators on Hilbert spaces; they obey certain assumptions generalizing classical permutation matrices. We give a number of examples and we list many open problems. We then put them back in their original context and give an overview of their use in several branches of mathematics, such as quantum groups, quantum information theory, graph theory and free probability theory.

Complex Analysis and Operator Theory•Mar 15, 2023•9 citations

Quantum magic squares: Dilations and their limitations

Gemma De las Cuevas, Tom Drescher, Tim Netzer

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.

arXiv:1912.07332•Journal of Mathematical Physics•Nov 1, 2020•20 citations

Applications of Matrix in Quantum Computation and Quantum Information

Wang Xiao-hong

We introduce some important matrices and their applications in quantum computation and quantum information,including density matrix,unitary matrix,etc.

College Mathematics•Jan 1, 2007•0 citations
This monograph is a synthesis of the theory of the pairwise coupling of the angular momenta of arbitrarily many independent systems to the total angular momentum in which the universal role of doubly stochastic matrices and their quantum-mechanical probabilistic interpretation is a major theme. A uniform viewpoint is presented based on the structure of binary trees. This includes a systematic method for the evaluation of all 3n-j coefficients and their relationship to cubic graphs. A number of topical subjects that emerge naturally are also developed, such as the algebra of permutation matrice
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.
Abstract Quantum permutations arise in many aspects of modern “quantum mathematics”. However, the aim of this article is to detach these objects from their context and to give a friendly introduction purely within operator theory. We define quantum permutation matrices as matrices whose entries are operators on Hilbert spaces; they obey certain assumptions generalizing classical permutation matrices. We give a number of examples and we list many open problems. We then put them back in their original context and give an overview of their use in several branches of mathematics, such as quantum groups, quantum information theory, graph theory and free probability theory.
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.