Related papers: Algorithm for computing canonical bases and foldin…
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus comes largely from quantum information theory; in contrast to…
We propose a new class of quantum computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of Decision Theory and…
A quantum symmetric pair consists of a quantum group $\mathbf U$ and its coideal subalgebra ${\mathbf U}^{\imath}_{\boldsymbol{\varsigma}}$ with parameters $\boldsymbol{\varsigma}$ (called an $\imath$quantum group). We initiate a Hall…
The quantum Fourier transform (QFT) is sometimes said to be the source of various exponential quantum speed-ups. In this paper we introduce a class of quantum circuits which cannot outperform classical computers even though the QFT…
In this note we are dealing with a particular class of quadratic algebras -- the so-called quantum matrix algebras. The well-known examples are the algebras of quantized functions on classical Lie groups (the RTT algebras). We consider the…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…
We study based one-dimensional modules of quantum symmetric pairs over the field $\mathbb{Q}(q)$. We provide a complete classification of one-dimensional $\mathbf{B}$-modules that appear as submodules of simple finite-dimensional based…
It has been recently discovered in the context of the six vertex or XXZ model in the fundamental representation that new symmetries arise when the anisotropy parameter $(q+q^{-1})/2$ is evaluated at roots of unity $q^{N}=1$. These new…
In this work, we develop a novel mathematical framework for universal digital quantum computation using algebraic probability theory. We rigorously define quantum circuits as finite sequences of elementary quantum gates and establish their…
The $\imath$quantum groups have two realizations: one via the $\imath$Hall algebras and the other via the quantum Grothendieck rings of quiver varieties, as developed by the first author and Wang. The isoclasses of perverse sheaves provide…
Recently, Kuniba, Okado and Yamada proved that the transition matrix of PBW-type bases of the positive-half of a quantized universal enveloping algebra $U_q(\mathfrak{g})$ coincides with a matrix coefficients of the intertwiner between…
We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…
The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…
A proof is given that an invertible and a unitary operator can be used to reproduce the effect of a q-deformed commutator of annihilation and creation operators. In other words, the original annihilation and creation operators are mapped…
The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of…
The paper is devoted to the mathematical foundation of the quantum tomography using the theory of square-integrable representations of unimodular Lie groups.
It is quite common to use the generalized probabilistic theories (GPTs) as generic models to reconstruct quantum theory from a few basic principles and to gain a better understanding of the probabilistic or information theoretic foundations…
Let $\mathfrak{g}$ be a semi-simple Lie algebra with fixed root system, and $U_q(\mathfrak{g})$ the quantization of its universal enveloping algebra. Let $\mathcal{S}$ be a subset of the simple roots of $\mathfrak{g}$. We show that the…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…