Related papers: The quantum group fixing a sequence of finite subs…
We study sequences of noncommutative random variables which are invariant under "quantum transformations" coming from an orthogonal quantum group satisfying the "easiness" condition axiomatized in our previous paper. For 10 easy quantum…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
The concept of a random walk on a finite group converging to random - and a way of measuring the distance to random after $k$ transitions - is generalised from the classical case to the case of random walks on finite quantum groups. A…
Quantum groups were invented largely to provide solutions of the Yang-Baxter equation and hence solvable models in 2-dimensional statistical mechanics and one-dimensional quantum mechanics. They have been hugely successful. But not all…
Q-system completion can be thought of as a notion of higher idempotent completion of C*-2-categories. We introduce a notion of quantum bi-elements, and study Q-system completion in the context of compact quantum groups. We relate our notion…
We examine quantum normal typicality and ergodicity properties for quantum systems whose dynamics are generated by Hamiltonians which have residual degeneracy in their spectrum and resonance in their energy gaps. Such systems can be…
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
We study quantum field theories which have quantum groups as global internal symmetries. We show that in such theories operators are generically non-local, and should be thought as living at the ends of topological lines. We describe the…
We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unification of several ideas, as well as several results and methods that have not…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
We explore set-stabilizability by constrained controls, and both controllability and stabilizability can be regarded as the special case of set-stabilizability. We not only clarify how to define an equilibrium point of Schr$\ddot{o}$dinger…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…
The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork…
The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…