Related papers: Quantum increasing sequences generate quantum perm…
We construct spaces of quantum increasing sequences, which give quantum families of maps in the sense of Soltan. We then introduce a notion of quantum spreadability for a sequence of noncommutative random variables, by requiring their joint…
Advances in quantum computing over the last two decades have required sophisticated mathematical frameworks to deepen the understanding of quantum algorithms. In this review, we introduce the theory of Lie groups and their algebras to…
It is postulated that quantum gravity is a sum over causal structures coupled to matter via scale evolution. Quantized causal structures can be described by studying simple matrix models where matrices are replaced by an algebra of quantum…
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
Recently there has been much effort in developing a quantum generalisation of reference frame transformations. Despite important progress, a complete understanding of their principles is still lacking. In particular, we argue that previous…
We present a theory for the dynamical evolution of a quantum system coupled to a complex many-body intrinsic system/environment. By modelling the intrinsic many-body system with parametric random matrices, we study the types of effective…
We study the discrete quantum groups $\Gamma$ whose group algebra has an inner faithful representation of type $\pi:C^*(\Gamma)\to M_K(\mathbb C)$. Such a representation can be thought of as coming from an embedding $\Gamma\subset U_K$. Our…
Recent results by Alagic and Russell have given some evidence that the Even-Mansour cipher may be secure against quantum adversaries with quantum queries, if considered over other groups than $(\mathbb{Z}/2)^n$. This prompts the question as…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…
Without a complete theory of quantum gravity, the question of how quantum fields and quantum particles behave in a superposition of spacetimes seems beyond the reach of theoretical and experimental investigations. Here we use an extension…
We investigate a quantum generalization of the Mycielski construction for quantum graphs. In particular, we analyze the quantum symmetries of quantum Mycielskians and their relation to the symmetries of the underlying quantum graphs. We…
We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
The definition of the grafting operation for quasifuchsian groups is extended by Bromberg to all $b$-groups. Although the grafting maps are not necessarily continuous at boundary groups, in this paper, we show that the grafting maps take…
We study the discrete groups $\Lambda$ whose duals embed into a given compact quantum group, $\hat{\Lambda}\subset G$. In the matrix case $G\subset U_n^+$ the embedding condition is equivalent to having a quotient map $\Gamma_U\to\Lambda$,…
A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…
In this article we construct $GL_{h}(3)$ from $GL_{q}(3)$ by a singular map. We show that there exist two singular maps which map $GL_{q}(3)$ to new quantum groups. We also construct their $R$-matrices and will show although the maps are…
In this paper, we study the construction of quantum codes by applying Steane-enlargement to codes from the Hermitian curve. We cover Steane-enlargement of both usual one-point Hermitian codes and of order bound improved Hermitian codes. In…
We work out axioms for the duals $G\subset U_N^+$ of the finite quantum permutation groups, $F\subset S_N^+$ with $|F|<\infty$, and we discuss how the basic theory of such quantum permutation groups partly simplifies in the dual setting. We…