“…In what regards the higher orbitals, things do not seem to work here, as noticed in [22]. As explained in [24], the 3-orbital can fail to be transitive when the diagonal elements of the magic unitary generate a commutative algebra. We have now a precise counterexample for this, our result being as follows:…”
Section: This Gives a Theoretical But Quickly Impractical Way Of Clas...mentioning
confidence: 95%
“…(3) At N = 3 now, by using the same idea as in the N = 2 case, we must prove that the entries of any 3 × 3 magic matrix commute. This is something quite tricky, and there are 4 known proofs here [1], [22], [24], [35]. According to the proof in [24], which is the most recent, it suffices to show that u 11 u 22 = u 22 u 11 , by showing:…”
Section: Quantum Permutation Groupsmentioning
confidence: 99%
“…This is something quite tricky, and there are 4 known proofs here [1], [22], [24], [35]. According to the proof in [24], which is the most recent, it suffices to show that u 11 u 22 = u 22 u 11 , by showing:…”
Section: Quantum Permutation Groupsmentioning
confidence: 99%
“…When G × is finite and so C(G × ) is a multi-matrix algebra, the one-dimensional summands correspond precisely to the characters. See [24] for more.…”
Section: For a Liberation Of A Compact Groupmentioning
A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting the problem is to understand the structure of the compact quantum groups which can appear as quantum automorphism groups of finite graphs. We discuss here this question, notably with a number of negative results.
“…In what regards the higher orbitals, things do not seem to work here, as noticed in [22]. As explained in [24], the 3-orbital can fail to be transitive when the diagonal elements of the magic unitary generate a commutative algebra. We have now a precise counterexample for this, our result being as follows:…”
Section: This Gives a Theoretical But Quickly Impractical Way Of Clas...mentioning
confidence: 95%
“…(3) At N = 3 now, by using the same idea as in the N = 2 case, we must prove that the entries of any 3 × 3 magic matrix commute. This is something quite tricky, and there are 4 known proofs here [1], [22], [24], [35]. According to the proof in [24], which is the most recent, it suffices to show that u 11 u 22 = u 22 u 11 , by showing:…”
Section: Quantum Permutation Groupsmentioning
confidence: 99%
“…This is something quite tricky, and there are 4 known proofs here [1], [22], [24], [35]. According to the proof in [24], which is the most recent, it suffices to show that u 11 u 22 = u 22 u 11 , by showing:…”
Section: Quantum Permutation Groupsmentioning
confidence: 99%
“…When G × is finite and so C(G × ) is a multi-matrix algebra, the one-dimensional summands correspond precisely to the characters. See [24] for more.…”
Section: For a Liberation Of A Compact Groupmentioning
A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting the problem is to understand the structure of the compact quantum groups which can appear as quantum automorphism groups of finite graphs. We discuss here this question, notably with a number of negative results.
“…When G × is finite and so C(G × ) is a multi-matrix algebra, the one-dimensional summands correspond precisely to the characters. See [24] for more. We recall that for any finite group G we have a Peter-Weyl decomposition, as follows:…”
Section: Intermediate Liberations Of Finite Groupsmentioning
A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting, the problem is to understand the structure of the compact quantum groups which can appear as quantum automorphism groups of finite graphs. We discuss here this question, notably with a number of negative results.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.