Related papers: Algorithm for computing canonical bases and foldin…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states. However, various applications, such as integer factorization, optimization,…
Representations of small quantum groups $u_q({\mathfrak{g}})$ at a root of unity and their extensions provide interesting tensor categories, that appear in different areas of algebra and mathematical physics. There is an ansatz by Lusztig…
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…
Let $G$ be a connected simply-connected simple complex algebraic group and $\mathfrak{g}$ the corresponding simple Lie algebra. In the first half of the present paper, we study the relation between the positive part $U_q(\mathfrak{n^+})$ of…
We apply one of the formalisms of noncommutative geometry to $R^N_q$, the quantum space covariant under the quantum group $SO_q(N)$. Over $R^N_q$ there are two $SO_q(N)$-covariant differential calculi. For each we find a frame, a metric and…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
This article shows that one can consistently incorporate nonunitary representations of at least one group into the ``ordinary'' nonrelativistic quantum mechanics. This group turns out to be Lorentz group thus giving us an alternative…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
We construct a braided analogue of the quantum permutation group and show that it is the universal braided compact quantum group acting on a finite space in the category of $\mathbb{Z}/N\mathbb{Z}$-$\textrm{C}^*$-algebras with a twisted…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
Let ${\mathbf U}_q^-$ be the negative part of the quantum enveloping algebra, and $\sigma$ the algebra automorphism on ${\mathbf U}_q^-$ induced from a diagram automorphism. Let $\underline{\mathbf U}_q^-$ be the quantum algebra obtained…
Symmetry groups are projectively represented in quantum mechanics, and crystalline symmetries are fundamental in condensed matter physics. Here, we systematically present a unified theory of quantum mechanical space groups from two…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
Mathematical tools related to coherence theory and classical-quantum equivalence, due to Wigner and Glauber, are essential to modern, practical and empirical understanding of electromagnetics in areas like quantum optics and…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
The pair consisting of a quantum group and its corresponding coideal subalgebra, known as a quantum symmetric pair, was developed independently by M. Noumi and G. Letzter through different approaches. The purpose of this paper is threefold.…
We consider quantum transition amplitudes, partition functions and observables for 3D spin foam models within $SU(2)$ quantum group deformation symmetry, where the deformation parameter is a complex fifth root of unity. By considering…