Related papers: Algorithm for computing canonical bases and foldin…
We introduce and study Lyndon bases of split $\imath$quantum groups $\mathbf{U}^\imath(\mathfrak{g})$. A relationship between the Lyndon bases and PBW-type bases was provided. As an application, we establish the existence of canonical bases…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We construct a basis for a modified quantum group of finite type, extending the PBW bases of positive and negative halves of a quantum group. Generalizing Lusztig's classic results on PBW bases, we show that this basis is orthogonal with…
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. Symmetries, such as point-group symmetries in molecules, are apparent in the…
We experimentally demonstrate quantum data compression exploiting hidden subgroup symmetries using a photonic quantum processor. Classical databases containing generalized periodicities-symmetries that are in the worst cases inefficient for…
We use the theory of $\textbf{U}_q$-tilting modules to construct cellular bases for centralizer algebras. Our methods are quite general and work for any quantum group $\textbf{U}_q$ attached to a Cartan matrix and include the non-semisimple…
Let ${\mathbf U}^-_q$ be the negative half of the quantum group associated to a Kac-Moody algebra ${\mathfrak g}$, and $\underline{\mathbf U}^-_q$ the quantum group obtained by a folding of ${\mathfrak g}$. Let ${\mathbf A} = {\mathbf…
The dual basis of the canonical basis of the modified quantized enveloping algebra is studied, in particular for type $A$. The construction of a basis for the coordinate algebra of the $n\times n$ quantum matrices is appropriate for the…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
Quantum groups in general and the quantum Anti-de Sitter group $U_q(so(2,3))$ in particular are studied from the point of view of quantum field theory. We show that if $q$ is a suitable root of unity, there exist finite-dimensional, unitary…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
We consider the problem of designing a variety of "system guided" basis sets for quantum mechanical anharmonic oscillators. Using ideas based on supersymmetric quantum mechanics, we design canonical transformations of the usual position and…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
We propose a construction of some canonical bases for quantum loop algebras of Kac-Moody algebras. We consider a smooth projective curve X, a group of automorphism G of X such that X/G=P^1, and we consider some Quot schemes of G-equivariant…